Do an in-order BST walk without additional data structures and without recursion.
Developer Net Interview Questions
711,088 developer net interview questions shared by candidates
nothing was difficult. He did ask me questions like "how many balls can fit in a car"..and find a root-cause problem..
Nothing was difficult. They are very helpful and will help you solve the problem.
Write a C procedure to reverse a string in-place.
Given a sorted array, find how many times a specified element appears.
Search smallest value from a tree. What if you have enough memory, how to improve the speed?
Given an array of numbers, there is one number that has a duplicate. How would you find the number?
Find if there are two members of an array that sum to 10 (10 and 0 count, but 10 alone does not).
Hardest things to unit test
Given two sorted integer arrays, write an algorithm to get back the intersection.
Viewing 1051 - 1060 interview questions
See Interview Questions for Similar Jobs
Documentum DeveloperAssistant Professor Management Information SystemsComputer Information SystemsInformation SystemsVb6 DeveloperDocumentum AdministratorVxml DeveloperSoftware Developer NetAccess DeveloperComputer Information Systems AnalystComputer TeacherEntry Level Applications DeveloperCloud ComputingDot NetComputer Information Technology TeacherHtml DeveloperInformation ArchitectInformation System