Implement division without using multiplication or division. It should work most efficient and fast.
Perguntas de entrevista de Software Engineering New Grad
107 Perguntas de entrevista compartilhadas pelos candidatos | software engineering new grad
How to access data from a tree structure and to sort them into an array?
Given a Pre-Order and In-Order string of a binary tree, can we and if we can, construct the "Post-Order" String.
Phone interview questions: Given an array of numbers (1,2,3,8,0,2,2,0,10), move all 0s to the right end and all other numbers to the left while keeping relative order of non-zero numbers. Has to be linear in time and in-place.
Given a decimal number, find the number of 1s in its binary representation? Follow up: Can u solve this in O(1) run time and O(1) space.
Isomorphic trees
What is primary key?
You have an unsorted array of integers and a function........string getCategory(integer)........which deterministically returns 1 of three possible strings: "low", "medium", or "high", depending on the input integer. You need to output an array with all the "low" numbers at the bottom, all the "medium" numbers in the middle, and all the "high" numbers at the top. This is basically a partial sort. Within each category, the order of the numbers does not matter...For example, you might be give the array [5,7,2,9,1,14,12,10,5,3]. For input integers 1 - 3, getCategory(integer) returns "low", for 4 - 10 it returns "medium," and for 11 - 15 it returns "high". You could output an array (or modify the given array) that looks like this: [3,1,2,5,5,9,7,10,14,12]
Linked list and string manipulation
There was a question on longest common subsequence (dynamic programming).
Exibindo 1 a 10 perguntas de entrevista