Yellowstone boys and girls ranch Interview Questions, Process, and Tips

6,36

Let and A and B are playing and A has 3$ and B won 3 times.

Total money earn by A = no of games A won – no of games A loss
if A loss game means B won.
Therefore
Total money earn by A = no of games A won – no of games B won
3 = no of games A won -3
no of games A won=6
So
A won = 6 games
B won = 3 games

Hence total no of games is 9

Servlets are faster as compared to JSP, as they have a short response time.
JSP is slower than Servlets – JSP is a HTML-based codes.
Servlets are harder to code, as here, the HTML codes are written in Java – JSPs are easier to code, as here Java is coded in HTML.
In an MVC architecture, Servlets act as the controllers. – In MVC architectures, the JSPs act as a view to present the output to the users.
The service() function can be overridden in Servlets. – The service() function cannot be overridden in JSPs.

Dear friends i ofcourse confused like you when i come
across to solve this problem. Really friends its very
simple if you understand the question clearly. First thing
is what is mean by “as many as” means its called ‘idiom and
phrase’ in english and it means “the same number of”. now
read the question “how many pairs of letters in STAINLESS
which has same number of letters between them in the word
as they have in english alphabet”.
In the alphabetical order, A-Z can be numbered as 1-26.
In A(INL)E which is same as in the alphabetical order A
(BCD)E. In both the cases E is in the Fourth position. so
we got one pair.
And in ST, there are no letters between them in the word
stainless. In alphabetical orer from A-Z also there is no
letters between them..so we got the second pair…
In STAINLESS it has two pairs ST and AE

75/8 days

13 and 15

450÷100×30=135
450-135=315
Ans: 315

3

Quick

360 years old
Nepo’s son age = x
Nepo’s age = 3x
Nepo’s father age = 2*3x + 40

x + 3x + 6x + 40 = 1240
10x = 1200
x = 120

Nepos age = 3* 120 = 360 years

Sunil Shetty

answer can be 1,2,3,4 can’t be determined exact number
just explaining a case:
there are 10 people in the party.
name of people no. of people with they made handshake list of those people(this can vary but showing the possibility)
1 1 9
2 2 8, 9
3 3 7, 8, 9
4 4 6, 7, 8, 9
5 5 6, 7, 8, 9. 10
6 6 4, 5, 7, 8, 9, 10
7 7 3, 4, 5, 6, 8, 9, 10
8 8 2, 3, 4, 5, 6, 7, 9, 10
9 9 1, 2, 3, 4, 5, 6, 7, 8, 10
10 4 5, 6, 7, 8, 9
jack got 9 different answer so jack can be either 4th number or 10th number and jack’s wife know jack very well so she can’t have handshake with jack so if 4th is jack then she can’t be handshake with 6,7,8,9, in this case she can be 1,2,3, 5, 10 and now depending upon which no is jack’s wife she can have hand shake with- 1- 4 people, and if jack is number 10 then she can’t be 5,6,7,8,9 so again depending upon her number she can handshake with people in range of 1-4

Greatest number of 5 digits=99, 999
Smallest number of 5 digits=10, 000
And their sum=99, 999+10, 000=109, 999