Freeman & curiel engineers, llp Interview Questions, Process, and Tips

The answer for this question is very simple: it is called Ceaser Cipher.
It consists of replacing a character by another located in (current character position + (key-1)), where key = how many positions you want to skip.
For Example: VICTORY -> YLFWRUB with the key = 3.
Then SUCCESS -> QXFFHQQ

Note: it should work like a circle(Z+1 = A).

12%

Let the firt number be n,
The largest number will be n+1
Their sum
n+n+1=55
2n+1=55
2n=54
n=27
Largest number =27+1=28

here the 30% of 100 is 30
and 10% of the 30 = 3
so 20% = 6%
so ans = 6%

1×2×…100=100!
Number of zeros in product of n numbers =[5n​]+[52n​]+[53n​]+…
Number of zeros in product of 100 numbers =[5100​]+[52100​]+[53100​]
where [.] is greatest integer function
=[20]+[4]+[0.8]=20+4=24

40
40
30
60
– 10 cows
+ 20 days
if 40 cows can eat for forty days
then 20 cows can eat for 80 days

Camel is the answer
Camel can store water for many days or months in there intestines

A