A guard is positioned at the one side of the bridge saying ‘A’. His task is to shoot all those who try to leave from ‘A’ to the other side and say ‘B’. He also need to welcome the person who comes from another side ‘B’ to his side ‘A’. The guard comes out of his post every 1 hour and looks down the bridge for any people trying to leave. You are at side ‘A’ and wish to go to another side ‘B’. you also know that it would take 1:45 hr to cross the bridge. How will you cross the bridge?

I taste better than I can smell. Who am I?

John and his team plan to rob a safe. They got just one chance to break the code else the local police will be informed. Below are clues:
A) Exactly one number is perfectly placed: 9 8 1
B) Everything is incorrect: 9 2 4
C) Two numbers are part of the code of the safe but are wrongly placed: 0 9 3
D) One number is part of the code of the safe but is wrongly placed: 1 4 7
E) One number is part of the code of the safe but is wrongly placed: 7 8 3

It is a nine-letter word.
The exact opposite of the phrase "friendly and outgoing"
It contains the word "over".
It starts will a vowel.

What is it?

When can we add 2 to 11 and get 1 as the correct answer?

what does the below math rebus puzzle mean?

Which Burger Is Different in below image?

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?

It walks on 4 when its young, walks on 2 when it's older, and walks on 3 when its very old?

Imagine a box with two cogwheels, one big with 24 teeth and one small with 8 teeth. The big one is firmly attached to the center of the box which means it does not turn or move while the small one rotates around the big one.

How many times do you think that the smaller wheel will turn compared to the box when it turns once around the big one?