Can you find the hidden animal in the picture below?

See the given image carefully. What you have to do is move the blue checkers in the position of the black checkers and vice versa. You are only allowed to move the checker to an adjacent empty space. Do it in the least possible moves.

What 4-letter word can be written forward, backward or upside down, and can still be read from left to right?

A man embarked on a questionnaire game. He kept asking the same question to whomever he found. The answer each time was different.

Can you guess what the question was?

I have no life, but I can die. What am I?

Speaking of rivers, a man calls his dog from the opposite side of the river. The dog crosses the river without getting wet, and without using a bridge or boat. How?

Joseph organises an exotic office New year party at the beach to his important fellow employees.

Following are the important people that will come to the party

1. Joseph

2. Joseph 2 girlfriends- Carol Vanstone and Tracey Hughes

3. The sales head Clay Vanstone.

4. Clay Vanstone 2 associates.

5. Mr. Jeremy and his Secret Tab.

They all need to cross a small river to reach the beach, however, Joseph has got just one boat.

There are few rules for crossing the river.

1. The capacity of the boat is limited to just two people.

2. Clay Vanstone associates will not stay with Joseph without Clay Vanstone.

3. Carol Vanstone and Tracey Hughes will not stay with the Clay Vanstone without Joseph.

4. Mr. Jeremy would never leave the Secret Tab alone.

5. Secret Tab counts as a person.

6. Only Joseph, Clay Vanstone or Mr. Jeremy can drive the boat.

7. The two girlfriends Carol Vanstone and Tracey Hughes will not stay with the Clay Vanstone without Joseph.

8. No Associates would stay with Joseph without their Clay Vanstone.

9. Mr.Jeremy will not leave the Secret Tab alone.

What can run but never walks, has a mouth but never talks, has a head but never weeps, has a bed but never sleeps?

Which of the following words don't belong in the group and why?
CORSET, COSTER, SECTOR, ESCORT, COURTS

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?