Solution:

They were the same person "Grover Cleveland".

Solution:

A typical way will be to start thinking about summing up the distance that the bee will travel but that will be quite a tedious task. How about we offer you a much easy solution?

The tunnel is 200 miles long and the trains are running at as peed of 100 mph which means that they will collide exactly at the center of the tunnel and seeking their speed, they will collide after an hour.

Now consider the bee which is flying at a speed of 1000 mph and will keep flying till the train collides. As calculated, it will keep flying for an hour which means the distance that it will cover is 1000 miles.

Solution:

100

Series of number that do not contain albhabet 'T'

Solution:

13 x 3 + 1 = 40

The number of decks is absolutely not relevant here which means whether we mix 5 or 500 cards still results would be same.
Any card drawn will be a Ace,2,3,4,5,6,7,8,9,10,Jack,Queen or King, so there are 13 possibilities each time a card is drawn.
If you are lucky just 5 cards of the same kind can be obtained in 4 steps

The unluckiest(worst) way is our solution as we need to guarantee a four of a kind.
Draw 3 of each kind =>now we have 39 cards. Next card will guarantee 4 of a kind.

Solution:

192

Explanation:
I started with the number 192.
Adding the reversed 291 to 192 gave me 483.
Similarly,
483 + 384 = 867
867 + 768 = 1635
1635 + 5361 = 6996

Solution:

There are six unique answers

Ans1:
7 x 4 = 28
36 / 4 = 9
1 + 4 = 5

Ans2:
9 x 4 = 36
28 / 4 = 7
1 + 4 = 5

Ans3:
3 x 8 = 24
56 / 8 = 7
1 + 8 = 9

Ans4:
7 x 8 = 56
24 / 8 = 3
1 + 8 = 9

Ans5:
4 x 8 = 32
56 / 8 = 7
1 + 8 = 9

Ans6:
7 x 8 = 56
32 / 8 = 4
1 + 8 = 9

Solution:

Karate Kid (car + at + tea + kid)

Solution:

The old lady of course.
After helping the old lady into the car, I give the car keys to my best friend.
And then i go ib the bus with child love <3

Solution:

1/3

Explanation
Assuming T1 is the Toy for brother1, T2 is the toy for brother2 and T3 is the toy for brother3.

Following are the possible cases for toys distribution:

Boy1 Boy2 Boy3
T1 T2 T3
T1 T3 T2
T2 T1 T3
T2 T3 T1 .... (A)
T3 T1 T2 .... (B)
T3 T2 T1

In both steps (A) & (B), no one gets the correct toy.
Therefore probability that none brother can get the own toy is 2/6 = 1/3

Solution:

'five'

Its the count of alphabet

Solution:

They use the bricks and dirt from the tunnel to stand on it.