In the Chess Board picture below white army is arranged. You need to add a black army on the board such that no piece is under any threat.
Note: Army comprised of 1 king, 1 queen, 2 rooks, 2 bishops, 2 knights, and 8 pawns.

There was a competition where the contestants had to hold something. At the end of the event, the winner was a person who had no hands or feet. What was it that the contestants had to hold?

Imagine a box with two cogwheels, one big with 24 teeth and one small with 8 teeth. The big one is firmly attached to the center of the box which means it does not turn or move while the small one rotates around the big one.

How many times do you think that the smaller wheel will turn compared to the box when it turns once around the big one?

Decode the below four famous ciphers:

8P of the SS
1M of the E
1S of the SS
60M in 1H

It is a 5 letter word if you take away first letter it is something you get from sun, if you remove second letter you will get something to eat, if you remove third letter you get a word you use in pointing at and if you remove the fourth letter you get something to drink. What is it?

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?

A network of 20 x 10 squares is given to you.

Can you calculate how many unique squares and rectangles can be formed combining two or more individual squares ?

Why is it against the law for a man living in Delhi to be buried in Mumbai?

15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?

There is a movie name hidden in the picture that is attached with this question. Can you find out which movie is it?