CareerCup

Given a string containing only digits, restore it by returning all possible valid IP address combinations.

For example:
Given "25525511135",

return ["255.255.11.135", "255.255.111.35"]{hint:recursion,backtrack}

Given a m * n matrix and value k. Find k * k matrix within the given matrix whose sum is maximum.

Find the longest
subarray which consists of numbers that can be arranged in a continuous sequence.
For ex- {4,5,1,5,7,6,8,4,1}
output-{5,7,6,8,4}.Find the longest.

Given a stream of text eg you can read 1 char at a time, write fn that will return true if you can find a string str is in the stream before the stream runs out.Do not store the stream.

Print all combinations of M members of a set of N elements in a sequence such that each set can be obtained from the previous set by deleting one member and adding one member.

Given the Pre-order of the BST .check if each non-leaf node has only one child.Linear Time is expected.

Given a boolean matrix where 0 represent the blank and 1 represent the dot.So,dots form a image.Find the number of images.i.e.
You have to find the number of blocks having continuous 1s.
11000
01001
10011
00000
10101
here,it is 5 images.

Delete the tree completely.Tree need not be a binary tree.
Write clean code.

Given a1a2a3a4...anb1b2b3b4..bnc1c2c3..cn.
Convert this array to
a1b1c1a2b2c2...anbncn.

Given a Binary tree,find the level at which the tree is complete.Complete Binary tree-All leaves should be at same level and every internal node should have two children.
Asked to write both Recursive and iterative code.

Create the n-ary tree from the ancestor matrix.
matrix[i][j]=1 if i is the ancestor of j.
My answer-
find the root (row with all zeroes).
Set the column with a[i][root] =0
find all the rows with all zeroes.insert into the tree all the children.and push all into the queue.
pop and find the children ,insert into the tree with popped node as parent and push into the queue.
Can not implement properly as it needed some modifications.
This is asked from my friend at amazon bangalore.

Tokenize the given string.
node* strtok(char* input ,char* delims)
Put the words seperated into the linked list and return the linked list.delims can be a single character or group of characters like "abc".
Dictate the code as you write.

Given two strings .Print all the interleavings of the two strings.
Interleaving means that the if B comes after A .It should also come after A in the interleaved string.
ex-
AB and CD
ABCD
ACBD
ACDB
CABD
CADB
CDAB

Given an array which contains the parent of the ith element in the n-ary tree.Parent[i] = -1 for root.
Find the height of the tree.
Gave O(n2) ,space O(1).
Expected Complexity- Linear
You can use extra space if you want.
Example-
{-1 0 1 6 6 0 0 2 7}
0 1 2 3 4 5 6 7 8
0 is the root here.
0 is the parent of 1 5 6
1 is parnt of 2
6 is parent of 3 4
2 is of 7 which is parent of 8.

Find the(two) nodes which are at maximum distance in a binary tree?
This is not finding the distance but the nodes which are farthest.