CareerCup

How to use private members of Base class in Subclasses without exposing them ?

Implement simple tail command in C++.

Given a array of characters of this replace the characters which occur continously with the character and no. of times it occured e.g. AAAABCCDDD A4BC3D3 (count for characters that occurs once can be ignored). Do it Inplace.

You are given an array in which you’ve to find a subarray such that the sum of elements in it is equal to zero.

Copy a linked list with next and arbitary pointer without modifying original linked list i.e. read only linked list.

Multiply two linked list represented as linked list and return result as linked list.

Given a string, you have remove duplicates from it in O(n) time and O(1) space.

WAP to find no of possible paths from source node to destination node. If connection between various nodes is given. If there exists a cycle in a path from source to destination print Infinite path else print total no of path. eg
5 8
5 is no of nodes
8 is no of connection
and connections are
1 2
1 3
1 5
2 5
2 3
3 4
3 5
4 5
nodes are 1 indexed. ( not 0 )
find no of path from 1 - 5.
ans : 6

There is a rectangular grid of size m * n . Bob is in location ( x, y ) inside grid. He can move in 4 directions up, down, right and left. He will die if he steps outside of rectangular grid. Find the probability that bob is alive given initial position of bob as ( x, y ) and number of steps he moves as N.
Edit : Bob moves one step at a time in all 4 directions but he can move N step starting from start state.

There is a big file of words which is dynamically changing. We are continuously adding some words into it. How would you keep track of top 10 trending words at each moment ?

You have a matrix of size n*n with entries either 1 or 0. 1 means there is a path, 0 means no path. Find shortest path and print it from (0,0) to (n-1, n-1)

Solve T(n) = 2T(n/2) + 2.

How to find a place to insert new element effictively in a max heap implemented using tree and we dont know the index or no of element in tree.

Is it possible to find all permutations of given string in time O(n) ?

Given a Circuit (with resistors), we need to calculate the total resistance. Input will be like AB-5ohm, BC-6ohm, BC-10ohm, BC-20 ohm, CD-5 ohm. BC has been repeated twice implying they are in parallel. "Write a program by implementing efficient data structure for storing and calculating the total resistance."

file 1:
int arr[10];

file 2:
extern int *arr;
foo(){
arr[0]=10;
}
what can be the problems and in what conditions ?

Find preorder successor in BST.

Can we do 3 sum problem on unsorted array in time (n logn) ?
3 sum problem : given unsorted array you have to find 3 numbers such that their sum is zero.

We have given start and end array which corresponds to start and end time of lecture which are to be scheduled in some classes. Find minimum no of classes required inn least time complexity.

Print all combinations of a number N, as a sum of positive integers?
eg.
3 =
1 2
1 1 1

4=
3 1
2 2
1 1 2
1 1 1 1

Two strings are given to you like abhinav and navigate and you have to give output abhinavigate and all the characters are stored in linked list node. Input is a->b->h->i->n->a->v and n->a->v->i->g->a->t->e and output should be a->b->h->i->n->a->v->i->g->a->t->e.

Give an efficient algorithm to check whether 9*9 matrix is valid sudoku solution or not ?

Given an array find 3 elements such that a[i] < a[j] < a[k] and i < j < k in 0(n) time.

Please suggest best book to read so that I can crack Interview of big companies like Google, Amazon, adobe . And I am C, C++ coder.