Write a program to find depth of binary search tree without using recursion
Softwareentwickler 2 Interview Questions
513,242 softwareentwickler 2 interview questions shared by candidates
Writing the code to convert numeric amount of price into English words.
How would you sort a file which is too large to fit in memory.
Given a list L of n numbers. Write a function to return true if the sum of any two numbers of L equals to k; false otherwise.
Serialize and deserialize a collection of strings into a single one.
Round 1 Given a bitmap, use a quaTree data structure to represent the bitmap. The maps are all squares with black or white pixels and the length of the map is 2^n (you can always divide the map into 4 smaller parts). Then give you a root node of a quaTree, calculate the total black pixel in this map. Follow up: Given two root node, generate the intersection of these two maps.
A array : 1 3 0 2 4 9 input: dest-node: A0 output: all the source nodes: (A1, A3, A4) Each element in this array means the steps it can take. Each element can go left or right. So A[1] and A[4] can reach A[0]. A[1] can reach A[4], A[4] can reach A[0], so A[1] can reach A[0]. Output the index of element which can reach A[0].
consider one situation, 9,9,9,9 to 1,0,0,0,0.
Write a code that show all possible permutation from a given String.
Q: List all comments in the given segment of codes.
Viewing 2201 - 2210 interview questions