On rolling two dices (six-sided normal dice) together, what is the probability that the first one comes up with a 2 and the second one comes up with a 5?

At a party, there are five people and a whole round cake lying at the centre of the table. Only four people will make a cut and take their piece and the last one will get the remaining piece on the table. How can they make sure that everyone gets a 1/5th of the piece?

In a classic wine shop, the list of three most popular wines are:
- The cost of 1 French wine bottle: 500$
- The cost of 1 German wine bottle: 100$
- The cost of 20 Dutch wine bottles: 100$

John entered the wine shop and he needs to buy
- All three types of wine bottles.
- Needs to buy Dutch wine bottles in multiples of 20.
- Need to buy 100 wine bottles in total.

John has only 10000$. How many wine bottles of each type, John must buy?

In the following picture, E is going to slide the object down and as per the terrain and the physics, the round object is going to travel all the way till the end. Now, can you analyze who all people will die when it happens?

What can run but never walk, have a mouth that never speaks, have a head that never weeps, and have a bed but never sleeps?

Two friends were betting. One said to the other, "The coin will be flipped twenty times and each time the coin lands on the head, I will give you $2 and each time it lands on the tale, you will give me $3." After flipping the coin twenty times not a single penny was exchanged among them.

How many times did the coin land on heads?

Jack was having a candle light dinner with his girlfriend. Suddenly a cold gush of wind entered through the open window and three of the ten candles were extinguished. Assuming that none of the other candles were extinguished.

How many candles are they left with in the end ?

I hide my treasure in the ground, my tail is big and fluffy. If you spot me in a tree, please don’t call me scruffy. What am I?

What has six faces, but does not wear makeup, has twenty-one eyes, but cannot see? What is it?

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?