A charming young lady was approached by a kind looking old woman in a restaurant. The old woman said to her, 'You look exactly like my younger daughter. Sadly she passed away a couple of months back. Could you do me a favor and say 'Goodbye, mother' with a kind smile on your face when I leave?
The young lady agreed for the same and said, 'Goodbye, mother' when the old woman left. Soon after, she got the most disengaging shock of her life.
John and Jenni are a married couple. They have two kids, one of them is a girl. Assume safely that the probability of each gender is 1/2.
What is the probability that the other kid is also a girl?
A crime was committed at baker street. Ibrahim Dakota who was shot in the stomach was the main suspect. Sherlock questioned the suspect. The conversation started as:
Sherlock: What's your story, Ibrahim?
Ibrahim: I was walking around baker street and suddenly a man from the back shot me. I ran as fast as I could to save my life".
Sherlock: That is enough (and ask the police to arrest him).
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
A woman is sitting in her hotel room and hears a knock at the door. She opens the door to see a man whom she’s never met before. He says, “I’m sorry, I have made a mistake, I thought this was my room.†He then goes down the corridor and into the elevator. The woman goes back into her room and calls security. What made the woman so suspicious of the man?
Samuel was out for a walk when it started to rain. He did not have an umbrella and he wasn't wearing a hat. His clothes were soaked, yet not a single hair on his head got wet. How could this happen?
I am first found in caves, now prolific online; I am a depiction, a drawing, a symbol, or sign. I will convey whichever mood you could wish; or for that matter, a fist, flask, or fish. What am I?
Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.
