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].
Given a set of shapes in 2D space, and a coordinate pair, write a routine that returns true if any of the shapes overlap the coordinate pair.
Write a program to find depth of binary search tree without using recursion
Given a set of integers find if two elements sum to a given value.
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.
Find the intersection of two integer lists
Java 8 vs 1.6
What is _?
A string for example: AAAAABBBCCCCDD has to be converted into A5B3C4D2.
Viewing 2251 - 2260 interview questions