CareerCup

You can add me on vineetsetia009@gmail.com and we can talk on this.Also if you have contacts to admin then you can suggest that idea to him/her too..

First of all, I dont have privilege to do that... and I have some cool idea to do that.. If admin wants then i can share with him.

but if we delete redundant questions...then we can revise all questions in a small span of time..

can you post a main function for this?..thanks in advance

Can anyone explain the test cases?...Thanks in advance.

We can take a global variable instead of storing each computation.
And the nodes can also be stored in some global variable.

got similar mail from Amazon few days ago..I appeared for intern hiring test, wrote good code...but still got rejected..dont know what the reason behind rejection...

extern is used outside.It should be used inside code.

dude for which position are you applying at Amazon??..Was that telephonic interview or inperson?

How will you mark the traversal as you are not supposed to do any change in the structure of list...and secondly if you store the lists'node address somewhere, then it will consume a lot of space..

Will someone explain answer of this question?

Will you please explain with an example?

yeah...you can consider this..

ok...thanks

I solved this question by hash map, then they asked me try to solve this in O(1) extra memory.......

you cant use extra space....

Counting sort will consume a lot of space and hash map will consume O(n) space...think apart from this..

yeah right..

I think you should compare numbers after calculating..
And for 891.see below
891->191 so neglected
891->898 first answer
891->901 now find for 901 and compare it with 898.
now for 901 next palindrome will be 909 and 898 is smaller than 909 so 898 is the answer.

NO......this is the correct question...if array is incremental then the answer is straight forward..

No....

they asked to optimize this to constant amount of time

@anonymous...they asked to do this in constant amount of time..