I have signed an NDA, so cannot reveal questions. But, the preparation material is enough.
Grad Interview Questions
8,340 grad interview questions shared by candidates
Why SMB
Check whether a given tree is a binary search tree.
Print out a matrix in spiral form.
Given a binary tree, print out the elements in order. Without recursion.
Explain in detail what a hash table is, how would you implement it, what would be a good hash function, and when is it good to use a hash table.
I was asked how I would implement, in OO code, a maze. Then, given that implementation, to design an algorithm to solve that maze. Then, how would I create a random maze from scratch with an algorithm.
Given a string of parentheses, return false for an un-balance-able string, or return the number of parentheses needed to balance.
When I asked what they were looking for in an ideal candidate they turned the question back around and ask me what I thought they were looking for.
All Questions are strengths-based that require you to use your own examples
Viewing 1031 - 1040 interview questions