Recent Interview Questions
More Questions »
0of 0 votesProblem: you are given 2 words with equal number of characters. Find an algorithm to go from first word to second word, changing one character at each step, in such a way that each intermediate word exist in a given dictionary.
Example:
Words are pit, map. A possible solution:
pit, pot, pet, met, mat, map
0of 0 votesHow would you test each of the 3 layers in a 3-tier web app?
-
0of 0 votes
How would you test amazon search functionality on the home page?
-
0of 0 votes
Give me real time application of BST.....
-
0of 0 votes
You are given an array of 1's 2's and 3's. Sort this list so the 1's are first, the 2's come second, and the 3's come third.
Ex: Input [1, 3, 3, 2, 1]
Output [1, 1, 2, 3, 3]
But there is a catch!! The algorithm must be one pass, which means no merge/quick sort. Also no extra list allocations are allowed, which means no bucket/radix/counting sorts.
You are only permitted to swap elements.