CareerCup

A number is given as a palindrome, write a function to return the next largest palindrome.

A group of persons is fighting on a road. We have details about who punched whom, and there are only two groups, and a person will punch only a person from another group. What data structure would you choose for the input, output and write a fully functioning program for this.

A binary tree is represented in a array as the ancestor array, build the binary tree from this array.
eg

1
|
2---------------- --------------3
|
------------------
4 5

The array would be

1 2 3 4 5
1 x 1 1 1 1
2 0 x 0 1 1
3 0 0 x 0 0
4 0 0 0 x 0
5 0 0 0 0 x

where if i isAncestor of j, a[i][j] would be set to 1

Write the code (either c++ or Java) to generate factorial of a number? Please don't laugh at it yet, the program must be highly scalable, it should (somehow) be able to return the factorial of a number as big as a million.

You have a student class which have String firstName, boolean isBoy and int age. Write equals method for the class.

I wrote it then he asked there is a class Student2 which extends from this and has lastName field as well.

Now

Student s1 = new Student("firstName", 23, true);
Student s2 = new Student("firstName", "lastName", 23, true);

what will s1.equals(s2) will return. Is it correct ?

You have been given array of n numbers. Find min and mix. Give optimized solution and minimum number of comparisons.

You are given an array of integers.
Find the mininum value of all the subarrays of size k in O(n)

Given a triangle you need to divide it in 7 equal non overlapping triangles

Following is a tree
A
/ \
B C
/ \ / \
D E F G
/\ /
H I J

You need to print
A CB DEFG JIH

Modified LEVEL order traversal

A set contains 1 million Points.

Given a Point(x,y) you need to find out 100 closest points.

What is a deadlock?
How can you avoid it?

What are the main concepts in multi threading code?

Level order traversal of a binary tree.

You are given a file containing integers in the range (1 to 1 million). There are some duplicates and hence some numbers are missing

Find the fastest way of finding missing numbers?

write a method in java which takes argument as text string and array of token strings and find number of occurrences for each of the tokens in text string.

Design an elevator system, improvise it to multiple elevators with single button on each floor.

given an array of integers, find the 3rd largest integer in it.

Given a Binary tree, write an algorithm to find all the nodes at a distance k from given node n in the tree.

Given 3 product categories and a respective file of a huge size containing only the list of order numbers in sorted manner. Write an algorithm (best possible time complexity to be achieved) which can find common order numbers in all 3 files.

what is the signature & body of method returning a singleton instance?

How will you sort 1 million floating point numbers?

Write a chunk of code in Java which shows an example of deadlock.

Write a URL shortner (like tinyurl) . Take a URL as input & return a shortened URL. If you use any kind of storage or persistence, please use the appropriate api's of the language. Another requirement is that we want to make our URLs as different as possible, so that successive calls return very different URIs
This is to ensure that small typo errors do not lead to users getting to a valid URL, but rather throwing up an error page.

What Data Structure will you use to implement a garbage collection engine?

Given a BST and a node value, find the mirror node of the node containing that value.

Given a Tree, verify that it is a binary search tree. (input not specified as a binary tree, just a tree)

How would you Implement an LRU Cache?

there is 1000*1000 matrix each row is filed with 0 and 1 . left 1 right 0 once a 0 come thn 1 cannot come..
U have to find out the row which has maximum 1 and no. of 1 in that row..

This thing hav to do in complexity O(n+constant)

u hav root a node address and length is given
u need to find all the node frm give node which can be reachabe upto the given length. It can be left or right or top of node. but tree is simple binary which donot hav parent link

Implement a phone book.

1. u can search either by name or phone number.
2. u can serach by prefix also.
3. They want to write whole code with proper syntax..

I told its possible by hashing thn i come to tri... but whole code is too big to write. I almost took 1.5 hour to write