## Puzzle Interview Questions

- 1of 1 vote
which number most unlikely belong to following set of number 9 23 46 75 116

- 2of 2 votes
Given a cube made of N x N x N sub-cubes, how many sub-cubes are on the outside of the cube?

- 2of 2 votes
There are 10 coin producing machines which produces a coin of weight x grams. Out of those, 2 machines are defective and produces coins of x-1 grams. How to find those two defective machines.

Then extend this question to a total of n machines and out of those m machines are defective.

- -2of 2 votes
A lovely place where ohm law is checked every day + you can feel the grapes (without the first letter).

Clue:

** You can also find there goldâ€¦ (The golden state)

- 0of 0 votes
Can you think of a problem with the following singleton? If so, can you make it better and in the most efficient way?

public class MySingelton {

private static volatile MySingelton mySingelton;

public static MySingelton getInstance() {

if (mySingelton == null) {

mySingelton = new MySingelton();

}

return mySingelton;

}

public static void main(String[] args) {

MySingelton s = MySingelton.getInstance();

...

}

- 0of 0 votes
The question inside the link.

The pictures below contain a message in a secret code.

You will need to program to decode this message and to discover the password.

http://tsofen2015ms.azurewebsites.net/

- 0of 0 votes
Round 3

Question 1, you are given a puzzle, You can check the image here`https://drive.google.com/file/d/0B6-TjTC-KfTqQThBamxPa0NwNGM/view?usp=sharing`

You have to write a program to provide a solution for this.

- 0of 0 votes
If 2 employees are travelling and they have a start date and an end date, how many overlaps are possible?

- 1of 3 votes
You are standing before two doors.One door leads to the heaven and the other leads to Hell but you don't know what hides behind the doors. There are two gatekeepers. You know one of them always tells the truth and the other always lies, but you don't know who is the honest one and who is the liar.

You can only ask one question to one of them in order to find the way to heaven. What is the question?

- 0of 0 votes
Given a stairs of very large size. You are standing at the 0th step. You have to perform n actions. 1st action means you can move forward to 1 step or not. 2nd action is you can move 2steps or keep standing. 3rd action is you can move 3 steps or not and so on. Given is a step no. k which is broken. You can't stand on this step. Find out after performing n actions what can be the maximum no. of steps you can go.

- 1of 1 vote
During appraisal due to bell curve funda a manager is restricted to give promotion to only one of his team members. Three of his team members are equally competant. He wanted to select one by giving a puzzle. He called his three talented team members and blidfolded them. He placed a hat on each of their heads. Manager took off their blindfolds and gave following clues and conditions

1) Each hat is either white or blue

2) There is atleast one blue hat

3) Contest is fair for all the three team members

4) Each team member can see the hat of other team members but not his.

5) The team members should not communicate to each other.

The manager declared that who ever comes up first with right answer shall be given promotion.

The most talented of his team members came up with right answer and explanation.What is the answer and the logic behind that?

- 0of 0 votes
WORD PROBLEM:

Tara has already spent 6 minutes on the telephone and she expects to spend 9 more minutes with every phone call she routes. In all, how many phone calls does Tara have to route to spend a total of 14400 seconds on the phone?

Print the result.

- 0of 0 votes
You're the guard of a prison, you want to keep an eye on the most dangerous prisoner. Each prisoner has a danger rank of his own and a group of friends (prisoners, who also have danger ranks). The guard has a list of prisoners with their corresponding danger ranks and he also has a list of the friends of each of the prisoners in the prison.

The danger rank is computed as follows: Prisoner 1 has a danger value of 5, his friends are Prisoner 2 and Prisoner 5, who have danger values of 3 and 4 respectively. So the danger value of Prisoner 1 is 5+3+4 = 12.

There could be any number of prisoners. Whichever prisoner has the highest value is the most dangerous(computed using the above method).

Friendship can be assumed to be symmetric.

Come up with an efficient algorithm to find the most dangerous prisoner?

The solution I came up with runs in quadratic time.

A hash table which has the Prisoner as Key and list of his friends as value

Compute the sum of danger rank of all friends one key at a Time. (n * N)

Maintain a max count and update it as necessary.

I believe there is a solution for this problem having better time complexity than O(N^2).

- 0of 0 votes
You are given a list of strings

/flapp/server/apache

/d/apps

/d/apps/pub

/flapp

/flocal/firms

/d/sw/java

/d/sw/orcl/jdbc

The filtered strings shoud be

/flapp

/d/apps

/d/sw/java

/d/sw/orcl/jdbc

/flocal/firms

You have to identify the problem/requirement and provide solution that can work for any input with similar pattern.

- 2of 2 votes
Got this sh***y problem.

A judge tells a person under trial that if your answer is true, you get 2 year sentence and if your answer is false you get 3 year sentence. The person under trial gives an answer which made the judge set him free. What did he say?