Return k smallest element in a tree
Software Engineers Interview Questions
419,267 software engineers interview questions shared by candidates
given rand5() that return 1-5 uniformly produce rand7() that returns 1-7 uniformly
Given unsorted sequence of billions of numbers that cannot all fit in memory at the same time, find the median of these values.
Phone Interview 1: (1)Find maximum height of BST. This is easy using recursion. Then he asked me to do it iteratively, which I somehow managed to solve. (2)The Dutch flag problem. This was not tough. But the next question was tough. It was about finding particular keys in a dictionary. They have a custom function that tells you if a key is in the dictionary and you to find out if for given input, you get required output. For example -- The dictionary is like: {hi,hello,sir,how, are, you} And you have a function isWord(x) that tells you if a particular word is in that dictinary. So if the input is hisirhowareyou the output must be hi sir how are you I couldn't solve this problem. :(
Do company tagged leetcode questions.
Find the kth largest element in a sorted 2D array (the rows are sorted and the columns are sorted).
It was a question about graphics / topology - how to do lines between a few points drawn on the whiteboard without the lines crossing each other.
What's the fastest way to tell if 2 signed floats are the same polarity?
What's the difference between JavaScript and Python?
Given two array of characters, add them together like an addition problem and return them in a char array. ['3', '5', '9'] ['1', 2', '8', '4'] = 1284 + 359 = 1643 = ['1', '6', '4', '3']
Viewing 1261 - 1270 interview questions