CareerCup

use enum...

shifting the characters seems better here,than taking a new array and only filling it with desired characters.

ok thanks.naga are you from pagalguy ?

did not understand your third point here.

no this won't do that.

but I don't think they will meet at 4 ..which we need.

the diagram is not coming fine here..take it as 4 is joined to 7 ,and 0 joined to 9.

Yeah,true.no idea about this binary tree.

I hate this binary tree,Damn!! @

Ok yeah got it thanks.So,is bit wise XOR faster than usual swapping we generally perform.

how is this swapping here ?
input[i] ^= 1;
input[j] ^= 1;
something wrong I guess.

what datastructure are you using ?

there is one hashset class in java already available.
So interviewer wanted me to design own hashset class,he did not mention whether he want same hashset or want to see some new class which can do the same functionality.

can you explain me this XOR thing ? what actually is achieved by using it,and how actually it is better than swapping.
Thank you!

Bhai aapka logic kaam nhn kar rha..pata nhn and or se kya karna chahte ho ??

Hmmm..

code looks fine,but is it a single iteration ? coz you are reducing i's value..and your iterations are increasing due to that..

Place at ggn,initial round 2 hrs 2 problems to code/design.I forgot the second problem.
Dynamic programming..I don't know how to implement it.

what's the logic here ? did not understand what you are storing at some location...Thanks.

Going through all the codes I guess this is not possible in O(n) time..the best solution I got here is using 2 loops,inner loop for shifting the elements.
anyways Q is still open hope someone gets some logic to find it in O(n)

Hmm,I have no clue how to convert it in java..may be if you can explain the logic a bit..then I might try it out.Thanks

This won't work in java..

you can make one at office :P . I guess with your 2 pointer solution the order will be changed ... :|

Yeah! noone soln is correct soln!

ohk thanks for suggestion.I'll do the same.

anyone ?? :|

Can you do it without using temporary array ? as it will increase space complexity.

3+ years Java.

ok so you are shifting the elements using 2 pointers.

Isn't it O(n^2) with 2 for loops ? is it possible in O(n)

...............

you have just printed the elements,your array still has some other order.

what is this memcpy() finction in your code ? how to write it in Java ? also is the order maintained ?

This is just an example,generic case is what we are looking for.

Order is not maintained by your code.

you can't take 2 temp arrays here.

I was told to sort it..using concept of binary numbers..