Crisp thinking Interview Questions, Process, and Tips

1:2

First write equations from info:
(A) (Mon + Tue + Wed)/3 = 111 Rearrange as ——–> Tue + Wed = 111 – Mon
(B) (Tue + Wed + Thu)/3 =102 Rearrange as ——–> Tue + Wed = 102 – Thu
(C) Thu = 0.8(Mon)

Substitute equation C into B:
(B) Tue + Wed = 102 – 0.8(Mon)

At this point I changed the values for clearer algebra:
Mon = x
Tue + Wed = y

Re-write equations A & B with new values:
(A) y = 111 – x
(B) y = 102 – 0.8x

Solve simultaneous equations:

111 – x = 102 – 0.8x
111 – 102 = x – 0.8x (Re-arraged)
9 = 0.2x
x = 45

Thus, Mon = 45C

Thu = 0.8(45)
Thu = 36C

So the answer is it was 36C on Thursday

16

Chambal

1200*5 : 750*4
6000:3000
2:1

5! = 120

A. Rs. 8000, Rs. 7500, Rs. 3500

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).

190 sec

A

Total number of pairs is NC2^{N}C_2NC2​. Number of pairs standing next to each other = N. Therefore, number of pairs in question = NC2^{N}C_2NC2​ – N = 28/2 = 14. If N = 7,
7C2​ – 7 = 21 – 7 = 14….
N =7

3606