Second Round: This was a bit difficult. The question is to generate sample math problems(additions) for a 8th grade student and the results should be stored in such a way that they can be printed when required. Sample problem is 7+8=_____ The constraints are:- 1) The numbers that are to be added should be <=9 2) The result should be <=17
Main question was verifying whether a binary tree was a BST, given the function header that looked like public boolean isBST(root). He stated no other functions could be created and that child nodes did not have links to their parents.
Q: forgot the specifics but there were many questions
Given an integer as input, return how many 1's are in the binary representation of that integer.
Given a string consisting of characters A,B,C in any order . Sort them such that all A`s,B`s and C`s are placed together .
Reverse the words in a sentence.
what is difference between hash map and hash table?
It was a question where given an expression in a string with parentheses, we must find out the result of that expression and print it out using BODMAS Input : "7+(8-6)*4" Output: 15
How would you go about finding the kth to last element in a singly linked list?
How would you insert an element into a singly linked list, given that there is also another thread that is iterating over it. (non-blocking)
Viewing 321 - 330 interview questions