You need to arrange three 7 and mathematical symbols to form number 1?

In the given picture, you can find two letters missing. When two particular letters are placed in the missing spots, you get an eight-letter word while reading in the anti-clockwise direction. Can you find out the missing letters and the missing word eventually?

There are three Athletes (John, Tarun and Harish) and their individual Coaches (Jacob, Meenaxi and Priyanka) standing on the shore.
No Coach trusts their Athlete to be near any other Coach unless they are also with them.
There is a boat that can hold a maximum of two persons.
How can the six people get across the river?

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.

Spot 5 differences in two Christmas tree below:

Count the squares in the matchstick puzzle below?

One of the leprechaun is missing if you see the two pictures attached to this question. Where did he go? When he comes back, do you know where has he been?

During which month do people sleep the least?

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?

Can you write down eight eights so that they add up to one thousand?