Given a binary tree, which is not necessarily balanced, print the nodes in the tree in a level-wise manner. Also, nodes on the same level should be printed on a single line. A modification of the question was added later in which I cannot really add a "level" variable in the structure of the node in the tree.
There were 2 questions I tackled. The first was a power function that needed to be implemented in logn time and a Java encapsulation question (asking questions about making arrays inaccessible from outside the object).
Given a string and a dictionary. Break the string into meaningful words.
Print out a binary tree level by level
Given an unsorted array, extract the max and min value using the least number of comparison.
Write a function that takes in an array and repeats an integer that appears the most.
Given a string of Rs and Gs, design an algorithm to produce a string with Rs in the front and Gs after that. The number of flips from Rs to Gs or otherwise should be minimum. The number of Rs and Gs in the end need not be same as that in the beginning, however the length of the entire string should be the same.
First question was to find all numbers that occurred an odd-number of times in an array and second question was implement a stack that could return the largest number in the stack at anytime.
Write a C procedure to reverse a string in-place.
Given an array of numbers, there is one number that has a duplicate. How would you find the number?
Viewing 81 - 90 interview questions