A Japanese ship is sailing in the Indian Ocean. The captain of the ship feels tired and decides to take shower to be rejuvenated. He goes to take the shower after keeping his diamond-studded Rolex watch and gold chain on the table.
When he comes back after 15 minutes, he finds them missing. There are 4 crew members on the ship and he calls them one by one to ask them what they were doing in that duration.

Following are the answers:
1. Crew 'A' who is the cook replies that he was cooking mutton for the crew members.
2. Crew 'B' who is a housekeeper tells that he was sleeping in his room.
3. Crew 'C' who is the engineer says that he was checking on the generator.
4. Crew 'D' who is another housekeeper says that he was correcting the hoisted flag that was put upside down.

It took only a couple of seconds for the captain to find the thief. Can you find the thief too?

Can you count the number of blocks in the picture below?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

Solve below popular number sequence
314 159 265 358 979 323 846 ?

You’re out on the water and see a boat filled with people. You look away for a second and look back again, but this time you don’t see a single person on the boat. Why? Hint: The boat did not sink.

Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

In a chess board, the queen piece can move horizontally, vertically and diagonally freely. The picture represents the same.Can you place 8 queens on the board in a manner that none of the queens can attack each other?

Can you replace the question mark with the correct letter?

6 + 6 + 6 = N
7 + 7 + 7 = E
8 + 8 + 8 = R
0 + 0 + 0 = ?

Complete the table series riddle by finding the number that can replace "??".

Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?