There are hundred red gems and hundred blue gems. The blue gems are priceless while the red gems equal wastage. You have two sacks one labeled Heads and the other Tails. You have to distribute the gems as you want in the two sacks. Then a coin will be flipped and you will be asked to pick up a gem randomly from the corresponding sacks.

How will you distribute the gems between the sacks so that the odds of picking a Blue gem are maximum?

John is on an island and there are three crates of fruit that have washed up in front of him. One crate contains only apples. One crate contains only oranges. The other crate contains both apples and oranges.

Each crate is labelled. One reads 'apples', one reads 'oranges', and one reads 'apples and oranges'. He know that NONE of the crates have been labeled correctly - they are all wrong.

If he can only take out and look at just one of the pieces of fruit from just one of the crates, how can he label all of the crates correctly?

He loves to dance, twist and prance, he shakes his tail, and as a way he sails, wingless he flies into the sky. What is he?

Find the last number in the series below:

voN luJ yaM raM ---

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

You can see three almost identical images below. Can you spot the odd one out from them?

What common phrase is represented by the below lines

Easy going:
Weak, 'I'm going.'
Tough, 'I'm staying.'

Medium going:
Weak, 'I'm going.'
Tough, 'I'm staying.'

Tough going:
Weak, 'I can't do it, I'm staying!'
Tough, 'Let's get going.'

Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

What's a single-digit number with no value?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?