Given an integer, return all sequences of numbers that sum to it. (Example: 3 -> (1, 2), (2, 1), (1, 1, 1))
Software Engineer At Interview Questions
665,682 software engineer at interview questions shared by candidates
"Reverse" of the problem if finding k-th smallest element in a tree: I had to find k-th largest.
The second ninja (coding) test was about event processing system using pulling model, which literally no one in the industry is using.
I received two questions. The first was print out all possible strings that a phone number can produce. For instance: 2 -> A,B,C and 3 -> D,E,F. So if the input is 23, then the output should be "AD, AE, AF, BD, etc.." The second question was if you had multiple points (x,y), find the n closest points to the origin (0,0).
Move all zeroes to end of array with minimum assignment operations
Given a string of digits, where every digit represents a letter (1->a, 2->b, 26->z). Find the number of words that we can generate from that string. For example: 123 -> abc, lc, aw. The answer: 3 456 -> def. The answer: 1
How would you quickly find the kth smallest number in an unsorted array?
Given a list 1,0,3,5,0,0,34,5,0,36 push all the zeroes to the end. Develop an in-place algorithm
To set 'N' bits in a number efficiently , N is a variable.
How do you test if water is toxic without tasting it
Viewing 1331 - 1340 interview questions