You know three triplets: Frank John and Wayne (need to return your money). Frank always tells the truth while John and Wayne always lie. You meet one of them on the road and can ask him a three-word question.
Which question, will you ask?

You have three orange, two pink and five purple balls in the drawer beside your bed. There is no electricity and the room is entirely dark. How many balls must you take out to ensure at least one ball of each colour at least?

Which is the smallest number that you can write using all the vowels exactly once?

Two girls were born to the same mother, on the same day, at the same time, in the same month and year and yet they're not twins. How can this be ?

Aman has 1.15 rupees in his pocket. There are a total of 6 coins in his pocket.

When his friend asked him for a change, he could not give change for a rupee and five paisa.

Can you tell which coins he has?

How can you throw a ball as hard as you can and have it come back to you even if it doesn't hit anything there is nothing attached to it and no one else catches or throws it.

Count the number of times the letter "F" appears in the following paragraph:

FAY FRIED FIFTY POUNDS OF
SALTED FISH AND THREE POUNDS
OF DRY FENNEL FOR DINNER FOR
FORTY MEMBERS OF HER FATHER'S FAMILY.

Can you find the six hidden animals in the picture below?

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?

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?