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?
To set 'N' bits in a number efficiently , N is a variable.
How do you test if water is toxic without tasting it
Difference between Thread and Process. Code for Reversing elements of array and sorting of an array elements. About project in detail OOP concepts like inheritance,polymorphism,abstraction,encapsulation Name the methods of "Object" class in Java. DBMS queries and normalization.
explain basic OOP concepts.
Leetcode
Bar-raiser was difficult and unexpected (to me) as I'm from embedded application dev background and haven't dealt with such scenario's.
Viewing 1351 - 1360 interview questions