Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.

They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?

There are seven sisters in a house in a village where there is no electricity or any gadget.

Sister-1: Reading Novel
Sister-2: Cooking
Sister-3: Playing Chess
Sister-4: Playing Sudoku
Sister-5: Washing clothes
Sister-6: Gardening

what is Sister-7 doing ?

One animal is different from the rest in the picture, and the challenge for the readers is to spot it in 5 seconds.

Sahir enters the bank aims to rob and finds Jai standing inside armless. He aims a gun at him and asks him the code for the safe. Jai says, 'The code is different every day but if you hurt me, you will never get to know the code'.

Sahir pins him down and ties him with a rope. He then inserts the safe code and easily takes all the money with him.

How did he know the code?

One is to three as three is to five and five is to four and four is the magic number.
What is the pattern?

Kareena is older than Katrina and younger than Karishma. Isabelle is younger than Bipasha and Karishma. Bipasha is older than Karishma. If Kareena and Isabelle are the same age, who's the youngest?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

This is a game of Tic-Tac-Toe which you all might have played innumerable times. Here, we are playing with the black and white markers instead. Also, there is a bit change to the rules. The changed rules allow you to play just three times. After the three markers are put by each of the players, you can only slide your marker into an empty square that shares a common wall with the square that the marker is leaving. You can refer to the figure given. If this is the position of the game, the white's next move would be from 6 to 3. Now, whatever the black one does, the white one will move his marker from 5 to 2 and he will have a three in a row. What you have to decide is if both of the players are using a perfect strategy, will the white player (who plays first) always win? Or it will be the black one who will win always? Or every game will be a draw?

A dying old man wants to divide his entire land between his only two sons. Since his only wish is to treat them as equal as both of them have been too good to him, he wants to divide his land equally between them. The problem is that the land is significantly irregular in shape and thus there is no choice of cutting them into two equal halves.

Can you help him divide the land in a manner that both of his sons will be happy?

1 dollar = 100 cent
= 10 cent x 10 cent
= 1/10 dollar x 1/10 dollar
= 1/100 dollar
= 1 cent

=> 1 dollar = 1 cent

solve this tricky problem?