In the Mexico City area, there are two Houses H1 and H2. Both H1 and H2 have two children each.
In House H1, The boy plays for Mexico Youth academy and the other child plays baseball.
In House H2, The boy Plays soccer for his school in Mexico and they recently have a newborn.

Can you prove that the probability of House-H1 having a girl child is more than that of House-H2?

Four children having five rocks each were playing a game in which they had to throw the rock at a particular solid area in the water. Child 1- Succeeded in throwing three rocks at a solid area but one of the rocks sunk. Child 3 - His aim was so bad that all rocks got sunk. Child 4- He was awesome and none of the rocks got sunk. Child 2 - Was the winner but was struck by a rock in the head and died. Who killed Child 2?

John and Jacob are twin brothers. One of them is a liar whereas the other one is a truth-teller.

I called their home number and one of them picked up.
I asked. 'Does John lie?' The person replied with a yes.

Whom did I talk with, John or Jacob?

Pronounced as one letter,
And written with three,
Two letters there are,
And two only in me.
I am double, I am single,
I am black blue and grey,
I am read from both ends,
And the same either way.

I get hot but I never sweat,
I cook food but I am not a chef,
I have a door but you can't enter me,
I have a light but I am not a lamp.
Who am I?

Can you identify if it's a murder or a suicide ?

A mathematician couple was having a Frappuccino in Starbucks sitting opposite to each other. Suddenly the guy noticed the text written on the paper in front of them and exclaimed that it was wrong. The girl denied it and said it is appropriate. Both are correct. What is written on the paper?

A Car is crossing a bridge 2 miles long. The bridge can only hold 10000 lbs, which is the exact weight of the car. The Car makes it half way across the bridge and stops. A bird lands on the car. Does the bridge collapse? Explain.

Which is the correct shadow of the bird?

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?