Generate all valid n pairs of parenthesis, i.e. ( ( ) ( ) ) is valid 3 pairs, ) ( ) ( is not valid.
Software Development Programmer Interview Questions
33,200 software development programmer interview questions shared by candidates
Why do you choose to shift from business to computer science when you were applying college? (I mean, no technical question becomes more difficult than this one.)
print the matrix in spiral format (inside out). Not that difficult, but challenging if you have not heard of the question before (as was the case with me)
I am unable to give details, due to a non-disclosure agreement.
X==NULL and NULL==x, what is the difference
Write a function to determine if a tree is a BST.
Given any binary tree, write an method to test whether it is a Binary Search Tree
Write a function to tell whether a BST is balanced
3 coding question.1.tree,2.algorithm based on string,3.linked list.
Write a function that converts an int into its alpha-numeric equivalent represented as a null terminated string. The function should accept an int as input and return a string as output. For instance, calling the function with an int value of 324 would return a null terminated string containing "324". Ensure that your function checks for appropriate boundary conditions and edge cases. Assume you cannot use any standard libraries (for example, no itoa or sprintf).
Viewing 1581 - 1590 interview questions