Can you replace the question mark with the correct letter?

6 + 6 + 6 = N
7 + 7 + 7 = E
8 + 8 + 8 = R
0 + 0 + 0 = ?

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?

Can you figure out the logic I used to decide the order of the following words:
gun, shoe, spree, door, hive, kicks, heaven, gate, line, den

John said, "If yesterday was tomorrow, today would be Friday."

When did John make this statement?

A woman lives in a skyscraper thirty-six floors high and is served by several elevators which stop at each floor going up and down. Each morning she leaves her apartment and goes to one of the elevators. Whichever one she takes is three times more likely to be going up than down. Why?

At my favorite fruit stand,
an orange costs 18,
a pineapple costs 27,
and a grape costs 15.
Using the same logic, can you tell how much a mango costs?

An office is divided into 8 cubicles. How many of the cubicles are painted if only 1/8 of the cubicles are painted?

A new clothing store has a unique method of pricing items. A vest costs $20, a tie costs $15, a blouse costs $30, and underwear costs $45. How much would pants cost?

Find the next number in the series?
2, 12, 36, 80, 150, 252, 392, _ ?

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?