A mother bought three dress for her triplets daughters(one for each) and put the dresses in the dark. One by one the girls come and pick a dress.
What is the probability that no girl will choose her own dress?

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?

Can you solve the maths in the below-given picture equation?

What begins with T, ends with T, and has T in it?

Using eight eights and addition only, can you make 1000?

You are presented with three boxes. One of them has a red ball inside and the other two have a black ball inside each of them. You are asked to pick up the one with red ball and you pick one. Now, one of the other boxes is opened and it is found to have a black ball.

You are presented with a chance to change your box with the one that is left closed. Will you change your box? Why or why not?

I am a seven-letter word but if you remove four of my letters I will have one left. What word am I?

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 ?

I got a bee but no honey.
got an eye but am still blind.
got a sea but no water.
got a tea but no coffee.
got a why but no answer.

What Am I?

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?