There is a box full of marbles,
all but two are blue,
all but two are green,
and all but two are red.

How many marbles are in the box?

Five thieves looted a bank and they ran away in a car. The bank staff informed the police and they began the search of their car in their jeep. They found them on a road and chased them eventually catching them. The light that is used to fill the number plate was broken on the thieves' car. Also, the headlights of the jeep police were not working. How were the police able to catch the thieves then?

How will you measure 15 minutes using two hourglasses of 7 minutes and 11 minutes respectively?

A bridge is about to collapse. There are four people P, Q, R and S on one of the sides. Before the bridge collapses, they want to cross it. Now since the bridge is too weak, it can only stand the weight of two people at a time. Also, it is night time and nothing is visible. They have just one torch with them.

Now P takes one minute to cross the bridge, Q takes two minutes to cross, R takes five minutes to cross and S takes ten minutes to cross.

The bridge will collapse in seventeen minutes. How will they be able to cross the bridge before it collapses?

Can you find a pattern and the missing number in the series given below?

100, 155, 258,? , 584, 819.

There are 2 sand hourglasses.

The small one can measure 5 hours and the large one can measure 7 hours.

How can we measure 16 hours with 2 sand hourglasses running together ?

A chess tournament is taking place on knock-out terms (the one who loses the match is out of the game).
(a) If 10 matches are played in total, how many players participated?
(b) If 20 players took part in the tournament, how many matches were played?

A spaceship was lost. The detective was given a piece of paper. This was the location of the spaceship! This is what the slip had scribbled on it:
Juice, Umbrella, Potato, Ice, Tomato, Elephant, Rice.

Where is the spaceship?

Solve the below puzzle by replacing the question mark with the correct number.

3 6 12

4 8 16

5 10 ?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?