1. Given a NxN matrix which contains all distinct 1 to n^2 numbers, write code to print sequence of increasing adjacent sequential numbers.
ex:
1 5 9
2 3 8
4 6 7

should print
6 7 8 9

From <http://www.careercup.com/question?id=5147801809846272>



	1. Given a string (for example: "a?bc?def?g"), write a program to generate all the possible strings by replacing ? with 0 and 1.
Example:
Input : a?b?c?
Output: a0b0c0, a0b0c1, a0b1c0, a0b1c1, a1b0c0, a1b0c1, a1b1c0, a1b1c1.

From <http://www.careercup.com/question?id=5192571630387200>


Traveler wants to travel from city “A” to city “D”.
There is a path from city “A” to city “D”.
Path consists of steps, i.e. travel from city “A” to city “B”.
Path is encoded as sequence of steps.
Sequence is in incorrect order.
Your task is to restore order of steps in the path.
Input (unordered sequence):
C -> D
A -> B
B -> C
Output (Correctly ordered list which represents path):
A, B, C, D

From <http://www.careercup.com/question?id=5749537700315136>



Given a Binary Search tree of integers, you need to return the number of nodes having values between two given integers. You can assume that you already have some extra information at each node (number of children in left and right subtrees !!).

From <http://www.careercup.com/question?id=5165570324430848>



You are given information about hotels in a country/city. X and Y coordinates of each hotel are known. You need to suggest the list of nearest hotels to a user who is querying from a particular point (X and Y coordinates of the user are given). Distance is calculated as the straight line distance between the user and the hotel coordinates.

From <http://www.careercup.com/question?id=5634947435986944>


Look for 2D tree algorithm

Given a complete binary tree, print the outline of the tree in anti-clockwise direction, starting from the root. I.e. first print all the nodes on the left
edge of the tree going downwards, then print all the leaves going left to right (including leaves on both the last and the 2nd last level if necessary), then
print the nodes on the right edge of the tree going upwards.

Example tree:
A
/ \
/ \
B C
/ \ / \
D E F G
/ \ /
H I J

Expected Output: ABDHIJFGC

From <http://www.careercup.com/question?id=5924407818059776>

Design a two player battleship game to be played over internet

From <http://www.careercup.com/question?id=5644457835757568>



Suppose you have a million integer numbers.
Return all possible values of a,b and c such that
a+b+c<=d.
d will be provided to you.
ex: if the numbers are 1,2,3,4,5,6,7
and d=7
[1,2,3]
[1,2,4]

[1,2,3] will be same as [1,3,2] and [3,2,1]...

follow up:

Return all such parts that satisfy the above condition if d is not provided.

From <http://www.careercup.com/question?id=5744225618493440>



Given a string with multiple spaces write a function to in-place trim all spaces leaving a single space between words
e.g.
_ _ _ Hello _ _ _ World _ _ _
Hello _ World _ _ _ _ _ _ _ _ _

From <http://www.careercup.com/question?id=5178446623801344>

How many occurrences of a given search word can you find in a two-dimensional array of characters given that the word can go up, down, left, right, and around 90 degree bends?

Ex:
Count of occurrences of SNAKES
S N B S N
B A K E A
B K B B K
S E B S E

The answer is 3.



Write a program for that question.

From <http://www.careercup.com/question?id=5709186067333120>


Find minimum number of steps to reach the end of array from start (array value shows how much you can move).

From <http://www.careercup.com/question?id=5677781199355904>



Determine minimum sequence of adjacent values in the input parameter array that is greater than input parameter sum.

Eg
Array 2,1,1,4,3,6. and Sum is 8
Answer is 2, because 3,6 is minimum sequence greater than 8.

From <http://www.careercup.com/question?id=5653018213089280>