As shown in the image, the nine Dogs are square fenced. By constructing just two square fences can you make sure that two Dogs cannot meet each other without crossing the fence?

A number with an interesting property:

When I divide it by 2, the remainder is 1.
When I divide it by 3, the remainder is 2.
When I divide it by 4, the remainder is 3.
When I divide it by 5, the remainder is 4.
When I divide it by 6, the remainder is 5.
When I divide it by 7, the remainder is 6.
When I divide it by 8, the remainder is 7.
When I divide it by 9, the remainder is 8.
When I divide it by 10, the remainder is 9.

It's not a small number, but it's not really big, either.
When I looked for a smaller number with this property I couldn't find one.

Can you find it?

Use only one mathematical symbol and all numbers (0-9) to get a sum of 99

The picture shows the dice results in each couple of throws. If they are actually following a pattern, can you find out the missing one?

Four cars come to a four-way stop, each coming from a different direction. They can’t decide who got there first, so they all go forward at the same time. All 4 cars go, but none crash into each other. How is this possible?

On a magical land of Mexico , all the animal in the land are rational.

There are 10 tigers and one goat.
Tiger can eat goat but since it's a magical land , the tiger who eats the goat , turns into goat and then can be eaten by the remaining tiger(s).

If we leave them for some time then how many goat and tiger will be there , when we come back ?

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?

Which is Odd One Out and why?

4377

3954

9862

8454

9831

While handling a project, the landscaper is asked by the owner of the mansion that he wants four trees in front of his mansion that are exactly equidistant from each other.

How will he do it?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?