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?

If you read clockwise, you can form a word by inserting three missing letters in the picture given below. Can you do it?

Which digit occurred maximum times between the number 1 and 1000?

There are three identical triplets sisters. Demi is the oldest of them all and she always speaks the truth. Diana is the next one who is a liar always. Drew, the youngest of them all speaks both truth and lies randomly.

On a rainy day, a family friend Victor visited them. Since there were starkly identical, he was not able to recognize them. Thus to clarify, he asked one question to each one of them.

He started with the one standing on the left and asked, 'Which sister is in the middle of you three?' She answered, 'That's Demi.'

Then, he asked the one standing in the middle, 'What is your name?' She answered, 'I am Drew.'

Finally, he asked the one standing on the right, 'Who is standing in the middle?' She answered, 'She is Diana.'

Victor was left baffled. He asked the questions three times and received different answers every time.

Can you tell who was who?

In an office's desk, you find a unique method that shows the current day of the month. Two numbered cubes are used to depict the current date.

Can you find out the numbers on both the cubes so that each date can be mentioned using them?

Please note that you have to use both the cubes to display any date. Thus the 1st day must be represented by 01 and so on.

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?

It has a long neck, A name of a bird, Feeds on cargo of ships, It's not alive,

What is it?

Sherlock Holmes was challenged to make a pre-drawn line smaller without erasing it. He did it in fractions of seconds. How?

Replace the question mark with the number below given a simple math problem.

There are four 3-link chains. All you have to do is join them into a big 12-link chain. For joining two closed links, one of the links must be cut and placed onto the other link for closing.

How many minimum links will you have to cut to make the big chain?