You are given four results as below:
1111 = F
2222 = E
3333 = T
Then, can you find out how to code 4444?

There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?

By using 'because' continuously three times, can you make an English statement ?

Which number comes next in the number series?

2, 9, 30, 93, ?

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

You along with your friend are standing in front of two houses. Each of those houses inhabits a family with two children.

Your friend tells you the below two facts:
1) On your left is a family that has a boy who likes accounts but the other child loves science.
2) On the right is a family with a seven-year-old boy and a newborn baby.

You ask him, "Does either of the family have a girl?"

To this, he replies, "I am not quite sure. But can you guess that? If you are right, I will give you $500."

Which family do you think is likely to have a girl?

As we know that white starts the game of chess. Can you find the scenario shown in the picture below is possible when all the white pieces are at the original place while the black pawn is not as in the below picture?

In the four images below, can you find the odd one out?

You’ll find me on Mercury, Earth, Mars, Jupiter, Saturn, and Uranus. But never Neptune, or Venus. What am I?

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?