It's a 7-letter word.
If we remove 1 letter from it, it remains the same.
If we remove 2 letters from it, it remains the same.
If we remove 3 letters from it, it remains the same.
If we remove all the letters from it, still it remains the same.
What is it?

What has many keys but can’t open a single lock?

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?

I got a bee but no honey.
got an eye but am still blind.
got a sea but no water.
got a tea but no coffee.
got a why but no answer.

What Am I?

You have an empty wine bottle with a cork that has been secured at the top in a normal way. There is a metal ring inside the bottle that is suspended by a string.

How can you make the metal ring drop to the bottom if you are not allowed to touch anything - not the bottle, not the cork, not the thread and not the ring?

What is more useful when it is broken?

Below, you can see three complete equations and one incomplete. Based on the three complete ones, can you complete the incomplete one?

5 $ 4 $ 3 $ 9 = 4215
6 $ 9 $ 2 $ 6 = 3816
4 $ 7 $ 3 $ 3 = 1122
7 $ 2 $ 7 $ 4 = ____

You walk into a creepy house by yourself. There is no electricity, plumbing, or ventilation. Inside you notice 3 doors with numbers on them. Once you open the doors you will die a particular way. Door No.1 You’ll be eaten by a lion who is hungry. Door No.2 You’ll be stabbed to death. Door No.3 There is an electric chair waiting for you. Which door do you pick?

Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?

You are given 16 witch hats. The hats are divided in four different colours – red, blue, green and yellow. Every colour has been assigned to four hats. Now each of the hat will be glued with a label of an arithmetic sign – ‘+’, ‘-‘, ‘x’ or ‘/’. But you can label one sign only once on one colour. In such an arrangement, the hats can be uniquely defined by its colour and symbol.

Can you arrange all the 16 hats in a 4x4 grid in a fashion that no two rows and columns have a repetition of colour or sign?
We have arranged four hats in the below picture to assist you.