pawan.aa712
BAN USER
Comments (4)
Reputation -5
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
-1
of 1 vote
Make a quadratic equation and then solve using simple discriminant calculation etc. Sounds like an elementary problem.
- pawan.aa712 November 08, 2013Comment hidden because of low score. Click to expand.
0
of 0 vote
Use a hash table to store the cumulative sum entries. Also, keep the indices of the array. If two cumulative sums are equal, then that subarray has a sum of 0.
- pawan.aa712 October 02, 2013Comment hidden because of low score. Click to expand.
0
of 0 vote
Inorder traversal. The places where the ascending order breaks will be the swapped nodes positions.
- pawan.aa712 September 14, 2013Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
you are not given a string of length n. You are just given length n; from which you can form many words of that length by using the letters from A to Z. Just you need to keep length equal to the given n and the words must satisfy the validity condition.
- pawan.aa712 November 08, 2013