In a Society, there are over 100 flats.

Flat 1 is named the first flat.
Flat 2 is named the second flat.
Flat 3 is named the third flat. And So On.....

A visitor decides to walk through all the flats, and he finds all the flats except flat 62.
Anmol later founds that the locals of the town have given it another name.

What is the name of the Flat?

He runs but never walks. Murmurs, but never talks. Has a bed, but never sleeps. And has a mouth, but never eats?

A tourist visits a small town for his research. While in the town, he decides to get a haircut. Since the town is quite small, there are only two barbers in the town � one on the North Street and one on the South Street. The barbershop on the North Street is a mess and the barber has a weird and pathetic haircut. While the barbershop at the South Street is pretty tidy and the barber as well has an impressive haircut.

Which barbershop will the tourist visit for his haircut and why?

A number can be multiplied by multiple of nine
i.e 9 18 27 36 45 ...

and the resulting number consist of only one digit.

Can you identify the number ?

I noticed one of the words in the oxford dictionary is spelled incorrectly. What about you?

Wednesday, Steve and Pam go to a restaurant to eat lunch. After eating lunch, they pay the bill. But Steve and Pam do not pay the bill. So…who does?

A man is found dead with a knife in his back When the investigation is done. A chair lays beside him and the forensic team finds moisture around the body.

If he committed suicide, how did he do it?

Sally lives in a place where six months of the year is mild summer and the temperature drops significantly the other six months. She owns a lake where there is a small island. She wants to build a house on the island and needs to get materials there. She doesn’t have a boat, plane, or anything to transport them to the island. How does Sally solve this problem?

I was speeding and ran through a stop sign, yet two traffic officers who were there do nothing about it.

why?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?