What can you catch but never throw?

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.'

A finger goes in me. You fiddle with me when you're bored. The best man always has me first. What am I?

Three friends decide to distribute the soda cans they had among them. When all of them had drunk four cans each, the total number of cans that remained was equal to the cans each one of them had after they had divided the cans.

Can you calculate the total number of cans before distribution?

John needs to purchase 100 chocolates from three different shops and he has exactly 100 rupees to do that which he must spend entirely. He must buy at least 1 Chocolate from each shop.

The first shop is selling each chocolate at 5 paise, the second is selling at 1 rupee and the third is selling at 5 rupees.

How many chocolates should he buy from each shop?

Which digit occurred maximum times between the number 1 and 1000?

A father told his three sons he would die soon and he needed to decide which one of them to give his property to. He said, “Go to the market and buy something large enough to fill my bedroom, but small enough to fit in your pocket. From this, I will decide which of you is the wisest and worthy enough to inherit my land.” They all went to the market, and each came back with a different item. The father told his sons to come into his bedroom one at a time and try to fill up his bedroom with their items. The first son came in and put some pieces of cloth he bought and laid them across the room, but it barely covered the floor. The second son came in and laid some hay on the floor, but there was only enough to cover half the floor. The third son came in and showed his father what he bought. He wound up getting the property. What did the third son show his father?

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?

Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?

How many times in a given day, minutes and hour clock comes in a straight line ?