I know a ten-letter word in the English language which can be typed using only the top rows of the computer keyboard.

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 ?

Always in you, Sometimes on you;

If I surround you, I can kill you.

What am I?

Assume there are approximately 5,000,000,000 (5 billion) people on Earth. What would you estimate to be the result, if you multiply together the number of fingers on every person's left hand? (For the purposes of this exercise, thumbs count as fingers, for five fingers per hand.) If you cannot estimate the number then try to guess how long the number would be.

On my way to St. Ives I saw a man with 7 wives. Each wife had 7 sacks. Each sack had 7 cats. Each cat had 7 kittens. Kittens, cats, sacks, wives. How many were going to St. Ives?

You need to climb ten stairs. At every stair, you can either take one step up or you can jump two steps up.

In how many different ways you can climb 10 stairs?

John is looking at Jenifer, but Jenifer is looking at Jacob. John is married, but Jacob is not.

Is a married person looking at an unmarried person ?

Luis Garavito killed Density x Volume.

Who is Luis Garavito ?

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?

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 = ?