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
What do you know about semi conductors?
Given an integer as input, return how many 1's are in the binary representation of that integer.
Reverse the words in a sentence.
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 find the n-th greatest element in a binary search tree?
what is the difference betwenn Typescript and java script
Viewing 231 - 240 interview questions