find a way to separate money into n parts. For example, if total money is 121, find a way to separate 121 into 4 closest parts and the solution would be an array with elements 30, 30, 30, 31
Engineers Interview Questions
841,850 engineers interview questions shared by candidates
Not difficult. It is like why can not compare two strings. And how to compare one object which initialed as a string with string. The coding quesition is to find the kth in two sorted arrays.
Given a string input, create a function that will output a compressed version of the string. E.g. Input = "AAABBZZDDD", Output = "A3B2Z2D3"
Asked to write a function to determine if numbers were a power of X.
First Step includes Java proficiency test where candidate is required to do 2 tasks. First one involves coding for converting .dat file to .csv file. second includes debugging of the first assignment done by someone else and write an email addressing the issues. respond to client's complain about the implementation
If a 3x3 white cube is painted blue on its face and then cut into 1x1 cube, what are the chances of picking a cube with a blue side from a bag
How can you efficiently detect whether two linked lists converged? If they do, how do you identify at which node this occurs?
Given sorted arrays of length n and 2n with n elements each, merge first array into second array.
phone numbers: provided a phone number (654-876-0987), return all possible strings that the phone number could represent if 2 -> {A, B, C}, 3 -> {D, E, F}, and so on common substring: find the biggest common substring in 2 strings, "abcdef" "gbcdh" would return "bcd"
Write a function to determine if a bin tree is a valid BST. I wrote a fully working solution in 3-5 minutes. It was also the most optimal but maybe because she needed to kill time, she asked me to rewrite it in what she thought was optimal (her reasoning didn't make much sense). Then she asked me for time and space requirements of the solutions. I said O(n) for both which is correct but she insisted that the space requirement was O(logn) which is wrong.
Viewing 921 - 930 interview questions