Can you arrange four 9's and use at most 2 math symbols, to make the total 100?

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?

Which Burger Is Different in below image?

In the following series, a set of numbers is progressing with a particular pattern. Can you deduce that pattern and find the missing set?

(2 + 6), (21 + 6), (58 + 6), (119 + 6), ___

A pond had 60 fish, out of which, all but 20 died.
How many fishes are now present in that pond?

They do not possess flesh or feathers or scales or bone
But still, they are blessed with fingers and thumbs of their own.

For this puzzle, you might have to find logic in something illogical. But hey, it's fun and a healthy little break from your strenuous puzzle-solving sessions.

Can you decipher the meaning in the following cluster of letters?

ITIT,NCENTCENT

What does man love more than life, and hate more than death or mortal strife; that which satisfied men want; the poor have, and the rich require; the miser spends, the spendthrift saves, and all men carry to their graves?

You are on your way to visit your Friend, who lives at the end of the hill. It is his birthday, and you want to give him the cakes you have made. Between your house and his house, you have to cross 5 bridges, and as it goes in the land of make believe, there is a troll under every bridge! Each troll, quite rightly, insists that you pay a troll toll. Before you can cross their bridge, you have to give them half of the cakes you are carrying, but as they are kind trolls, they each give you back a single cake. How many cakes do you have to leave home to make sure that you arrive at a friend's house with exactly two

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?