You are given a String number containing the digits of a
phone number (the number of digits, n, can be any positive integer) . To help you memorize
the number, you want to divide it into groups of contiguous digits. Each group must contain
exactly 2 or 3 digits. There are three kinds of groups:
• Excellent: A group that contains only the same digits. For example, 000 or 77.
• Good: A group of 3 digits, 2 of which are the same. For example, 030, 229 or 166.
• Usual: A group in which all the digits are distinct. For example, 123 or 90.
The quality of a group assignment is defined as
2 × (number of excellent groups) + (number of good groups)
Divide the number into groups such that the quality is maximized. Design an efficient
algorithm to return the solution that maximizes the quality.

How would you store pictures from Google's street view? (assume massive amounts of high quality pictures)

Multiply two numbers without using multiply(obviously),division,bitwise operators and no loops.
For example: 3*2=6 without *,/,bitwise operators and no for,while loops.

Hint: Answer using recursion..

Find the Max. sum of two elements in a Matrix.

Find the Max. sum of three elements in a matrix.

Find the max. sum of K elements, where k < n, in a given matrix.

In 2d array declaration or defintion of a function the first dimension argument is optional, why ?
and how it will works?

Describe and algorithm and implement UNIX tail command

Explain what is a weak reference. How do you declare a weak reference? Why would you implement a weak reference - versus a strong reference?

Write a function to compare two xml files

bool CompareXMLFiles(string fileName, string fileName);

Scenario
1. Path to files are given
2. We have to compare the content of xml files.
3. Xml with different element position would be same i.e.
<Tests>
<Test>UI<Test>
<Test>Functional<Test>
</Tests>

is same as
<Tests>
<Test>Functional<Test>
<Test>UI<Test>
</Tests>

4. Different position of attributes can be there e.g.
<Test Id="4" No="50">Functional<Test>
is same as
<Test No="50" Id="4">Functional<Test>

5. One Xml file can contain comments and other can/cannot but this is same

Within a 2D space, there is a batch of points(no duplicate) in the region (0,0),(0,1),(1,0),(1,1), try to find a line which can divide the region to parts with half points in each .the input will be an array of points and the length of the array.

struct point{
int x;
int y;
};
input : struct point * points, int length

Within a 2D space, there is a batch of points(no duplicate) in the region (0,0),(0,1),(1,0),(1,1), try to find a line which can divide the region to 2 parts with half points in each .the input will be an array of points and the length of the array.

struct point{
int x;
int y;
};
input : struct point * points, int length

Given a string which may contain one or multiple spaces in between the word characters. If there are multiple whitespaces, replace all with single whitespace.

Constraint -
1. Do not use any extra char string or array

e.g.
char *string = "Test-String----to-be--displayed-";

The string should be replaced like
'Test-String-to-be-displayed-'

Consider '-' as whitespace.

Given a Queue Perform following operations -
1. Enqueue
2. Dequeue
3. Max

Constraints -
Max has to be implemented in such a way that complexity should be O(1)

What is the purpose of the session() in a servlet?

How does hiberante handle atttached objects?

Can you have mutliple instances of a database running in hibernate?

Create a balanced binary tree from a given link list

Given an array of integers where some numbers repeat 1 time, some numbers repeat 2 times and only one number repeats 3 times, how do you find the number that repeat 3 times. Using hash was not allowed

Given a n*m matrix having numbers such that each row and each column sorted. Now print the numbers in present in the matrix in sorted order... I tried to explain k way merge sort but he didnt wanted that. He was loking for better sol.

Write a code to calculate kth power of a matrix of size nxn. You can assume that matrix multiplication is O(n^3).

find the diameter of tree