In a town, there are over 100 flats.
Flat-1 is named first flat.
Flat-2 is named second flat.
Flat-3 is named third flat.
A visitors 'Victor' decides to walk through all the flats, he finds all the flats except flat-62.
Victor later founds that the local of the town have given it another name.
John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.
The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.
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?
Living above a star, I do not burn
Eleven friends and they do not turn
I can just be visited in a sequence, not once or repeatedly
PQRS are my initials
Can you tell my name accurately?