CareerCup

Nice solution in c#. Complexity O(n)

onestopinterviewprep.blogspot.com/2014/04/find-next-higher-number-with-same-digits.html

Nice code in C#. Complexity O(n)

onestopinterviewprep.blogspot.com/2014/04/longest-consecutive-sequence-of-numbers.html

Complete code with comments in C#.

onestopinterviewprep.blogspot.com/2014/04/find-next-higher-number-with-same-digits.html

No, It's to help others. As long as someone is getting value out of it. It shdn bother you. I am sorry I din wanna be rude to u.

Here is the code with nice explanation.

onestopinterviewprep.blogspot.com/2014/03/excel-column-number-to-alpha-and-reverse.html

@Anonymous, if you are not interested , just don't click on the link or don't see my posts. It's as simple as that.

Done using stack with explaination.

onestopinterviewprep.blogspot.com/2014/03/detect-duplicate-parentheses-in.html

onestopinterviewprep.blogspot.com/2014/03/detect-duplicate-parentheses-in.html

A nice C# implementation of the above problem.

onestopinterviewprep.blogspot.com/2014/03/stock-quote-problem.html

cheers

onestopinterviewprep.blogspot.com/2014/03/print-sub-matrix-with-equal-number-of.html

This link has code which counts it for both positive and negative numbers.

onestopinterviewprep.blogspot.com/2014/03/count-1s-in-binary-format-of-number.html

Enjoy :)

It would work because at each node you are storing the sum of smaller values i.e. sum of those nodes towards that particular node's left. and while adding a new node to a tree and if you are moving towards right, ull add tat node's value and the sum value it contains, so u get the sum of previous small numbers.