- Practice
- Algorithms
- Implementation
- Encryption
- Discussions
Encryption
Encryption
Schuetzl + 0 comments I see a lot of people in the discussions are using a 2d array, did anyone else solve it by simply iterating through the input string? Is there a difference in efficiency? All of my submissions were 0.09s of quicker (using Java). Is there a better way to do it?
samar5yadav + 0 comments import math s=input() sm=s.replace(" ","") r=math.floor(math.sqrt(len(sm))) c=math.ceil(math.sqrt(len(sm))) for i in range(c): print(sm[i::c],end=" ")
short and sweet. that's why you gotta love python
saurabh_jasper + 0 comments why is this happening?
sujithvm + 0 comments This is the solution i submitted. Can anyone please tell me why ideone is giving correct answer for TestCase 1 and Hackerrank is giving a different answer. No difference in code
TestCase : feedthedog Ideone output : fto ehg ee dd Hackerrank editor output : fto ehg ee
StopAsh12 + 0 comments hey what does poosible square with the minimum have to do with this,as i think there are going to be only two square.ceiling and floor of an integer are going to be two consecutive number,following the constraints one can be increased and the other can only be decreased.so there are going to be only 2 square.The language of the question could have been easy to understand.
Sort 1067 Discussions, By:
Please Login in order to post a comment