People are waiting in line to board a 100-seat aeroplane. Steve is the first person in the line. He gets on the plane but suddenly can't remember what his seat number is, so he picks a seat at random. After that, each person who gets on the plane sits in their assigned seat if it's available, otherwise, they will choose an open seat at random to sit in. The flight is full and you are last in line. What is the probability that you get to sit in your assigned seat?

One day Jenifer meets the Lion and the Tiger in the Forest of Forgetfulness. She knows that the Lion lies on Mondays, Tuesdays, and Wednesdays, and tells the truth on the other days of the week. The Tiger, on the other hand, lies on Thursdays, Fridays, and Saturdays, but tells the truth on the other days of the week. Now they make the following statements to Jenifer:

Lion: Yesterday was one of my lying days.

Tiger: Yesterday was one of my lying days too.

What day is it?

12345 a famous South Indian actor
567 is a path in jumbled form
8 & 10 are same letters
9 is one among the first six alphabets.
WHO AM I?

There are two dice with empty faces in front of you and a marker. You can mark any number on each of the faces of the two dice, but you have to display all 31 days of the month using the two of them.

Which numbers will you mark on which dice so that you can easily depict all the dates of the month?

You are a thief and you are being punished for your crime. People have tied your head down on a tree with a rope that has been anchored in the ground. A candle is burning below the rope which is slowly burning it away. Just below your head, a Lion has been left loose and is waiting for you to drop down on the ground so he can have you as his lunch.

You have to survive the scenario. How will you do it?

Three brothers Jacob, John, and James live in Mexico City. The product of the ages of these brothers is 175. Jacob and John are twins. How old is James?

Which tank will fill first?

What number comes next in the series?

5 15 5 18 5 24 14 20 _

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

What word begins and ends with an E, but has only one letter?