I have four wings but can't fly.
I express no emotions.
I am found on the exact spot every time you look.
I keep toiling away with a little sound.

Do you know 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?

There are five people. One of them shot and killed one of the other five.
We know following clues:
1. Dan ran in the NY City Marathon yesterday with one of the innocent men.
2. Mike consider being a farmer before he moved to the city.
3. Jeff is a top notch computer consultant and wants to install Ben new computer next week.
4. The murderer had his leg amputated last month.
5. Ben met Jack for the first time six months ago.
6. Jack has been in seclusion since the crime.
7. Dan used to drink heavily.
8. Ben and Jeff built their last computers together.
9. The murderer is Jack's brother. They grew up together in Seattle.

Consider yourself to be a famous detective "Sherlock Homles", Can you find the killer?

What do you get if you add 2 to 100 four times?

They are the five precious gems of an everyday sort and all can be found on a Tennis Court. Who are they?

When we see 2 but call 10?

John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?

Akbar summoned Birbal out of anger.
He told him that he will have to face death.
He asked him to make a statement and if the statement is true he will be buried alive and if the statement is false, he will be thrown at lions.
After hearing Birbal’s statement, Akbar could do nothing but smile.
He gave him 5 gold bars and let him go.

What did Birbal say?

Find the Odd One Out?
84129
32418
47632
36119
67626
72927

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?