This is a classy optical illusion puzzle. What more you can find except bricks in the image below?

What will be the best approach to finding all the prime numbers less than 75 that leave an odd reminder when we divide them with 5?

Find the hidden panda in the image below.

Using the clues below, what four numbers am I thinking of?

The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.

Can you replace the question mark with the correct number?

A clock loses 10 minutes each hour. If the clock is set correctly at noon, what time is it when it reads 3 PM?

You are given 2 eggs.
You have access to a 100-storey building.
Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor, Both eggs are identical.
You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking.
Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process

Let's play a word game. Following are some meaningless words that can be completed by adding random letters on either side of the word.

For example, the word "rdo" can be formed into "pardon".

Using the same technique, can you complete the given words?
ecalc
airb
rinci
tibac
uidel
gorit
igna
eyho

There is a basket full of hats. Three are white and two are black. Three men, Tom, Tim, and Jim, each take a hat out of the basket and put it on their heads without seeing the hat they selected or the hats the other men selected. The men arrange themselves so Tom can see Tim and Jim’s hats, Tim can see Jim’s hat, and Jim can’t see anyone’s hat. Tom is asked what color his hat is and he says he doesn’t know. Tim is asked the same question, and he also doesn’t know. Finally, Jim is asked the question, and he does know. What colour is his hat?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?