There are 2 cops parked along a one-way street looking for traffic violations. They spot a taxi driver going in the wrong direction, yet they do nothing.
I can sizzle like bacon,
I am made with an egg,
I have plenty of backbone, but lack a good leg,
I peel layers like onions, but still remain whole,
I can be long, like a flagpole, yet fit in a hole.
There is a shop where written:
Buy 1 for $1
10 for $2
100 for $3
I needed 999 and still only paid $3. How could this be financially viable for the shop-keeper?
You are given 2 eggs.
You have access to a 100-storey building.
Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor, Both eggs are identical.
You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking.
Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process
Rumel, A detective who was mere days from cracking an international smuggling ring has suddenly gone missing. While inspecting his last-known location, you find a note:
710 57735 34 5508 51 7718
Currently, there are 3 suspects: Bill, John, and Todd. Can you break the detective's code and find the criminal's name?
In the given picture, you can find two letters missing. When two particular letters are placed in the missing spots, you get an eight-letter word while reading in the anti-clockwise direction. Can you find out the missing letters and the missing word eventually?
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
In 2011, people playing Foldit, an online puzzle game about protein folding, resolved the structure of an enzyme that causes an Aids-like disease in monkeys. Researchers had been working on the problem for 13 years. The gamers solved it in three weeks.