- Prepare
- All Platforms
- Programming
- Aptitude
- Syllabus
- Interview Preparation
- Interview Exp.
- Off Campus
- Prime Video
- Prime Mock

- PrepInsta Prime
- OffCampus
- Internship
- Placement Stats
- Prime Video
- Prime Mock

^{0}Notifications Mark All Read

No New notification

- Login
- Get Prime

# Infosys Cryptarithmetic Questions and Answers PDF

## Infosys Latest Cryptarithmetic Questions

**On this page you will learn all the tricks to solve Cryptarithmetic Problems for Infosys Questions. We will discuss about –**

**All Rules to solve Cryptarithmetic****Tricks and Shortcuts****Most asked Questions from latest Drive****YouTube Solutions for Cryptarithmetic**

### Rules to Solve Infosys Cryptarithmetic Questions

- Every Character/letter must have a unique and distinct value
- The values of a character/letter can not be changed, and should remain same throughout
- Starting character of number can not be zero example – 0341 should be simply 341.
- The problem will have only and only one solution
- Addition of two numbers is always even
- In case of addition of two numbers, if there is carry then, the carry can only be 1
- Once all the characters/letters are replaced with numbers, arithmetic operations must be correct

Now let us, learn all these rules with the help of an example –

**Infosys Cryptarithmetic Questions 1**

**Question – TO + GO = OUT. Find the value of T + G + O + U?**

- 15
- 11
- 7
- 18

**Step 1**

- The value of O is clearly 1.
**(Rule 6)** - Since, T + G is generating O is carry so value of O is 1.

Now, after substituting the values –

T O + G O ----- O U TThe above 0 is O

### Step 2

- Value of T = 1 + 1
- Thus, value of T = 2

T 1 + G 1 ----- 1 U T

### Step 3

- Now, 2 + G > 10 (as its resulting a carry 1 on next)
- Now, possible values of G to get 1 carry at next step is – {G = 8 or 9}

If G is 9 then –

- U = 2 + 9 = 11
- So value of U becomes 1 and 1 goes to carry
- Now, value of O is already 1 so U value can not be 1 also.
**(Rule – 1)**

Now, obv the value of G has to be 8, lets verify this also

- U = 2 + 8 = 10
- So value of U becomes 0, there is no conflict.

So final values are –

T = 2, O = 1, G = 8, U = 0

2 1 + G 1 ----- 1 U 2

### Final Step

Replace values in all steps and solution looks like –

**Use Coupon Code “CT10” and get flat 10% OFF on your Prime Subscription :**

**1 month extra subscription on 3 & 6 months plans****2 months extra subscription on 12 & 24 months plans****3 months extra subscription on 36 & 48 months plan**

1 1 + 9 9

+ 8 8 ----------- 1 9 8

**Infosys Cryptarithmetic Questions 2**

**Question – HERE = COMES – SHE, (assume S = 8). Find values of R + H + O**

- 15
- 18
- 14
- 12

We can make this addition problem by re-writing it as – ** HERE + SHE = COMES**

### Step 1

- C = 1 ( Rule 1, as carry is there)

Now, since –

H + _ --------- C O

- H + _ (nothing), can be written as H + 0 now the result of H + 0 should also be H right?
- But, the answer is coming as O, which means there must be a carry from previous step
- So, H + 1 generates a number >10 as result is C O

So, H value is 9, and O value will be H + 1 = 9 + 1 = 0 (1 carry to next step)

rewriting the problem again

H E R E + S H E --------- C O M E S

### Step 2

- Now, they have already given S value as 8
- Now, E + E = 8, thus, E = 4

Lets find value R

- R + 9 = E
- after substituting E value R + 9 = 4
- Thus, R = 5 and (1 carry to next step)

Lets, find the value of M

- E + S + 1 (Carry) = M
- after substituting the value 4 + 8 + 1 = 3 (1 carry to next step)

The final values are –

H = 9, E = 4, R = 5, S = 8, C = 1, O = 0, M = 3

9 E R E + S 9 E --------- 1 0 M E S

**Infosys Cryptarithmetic Questions 3**

**Question – THIS + IS = HERE. Find all the values?**

### Step 1

- T + (nothing ) = H
- Thus, 1 carry must be coming from previous step

### Step 2

- Similarly, H + (nothing) = E
- Thus, 1 carry must be coming from previous step
- Now, H + 1 must be >10, as its generating carry on next step too (T)
- Thus, H = 9
- And since, H + 1 = E => E = 0 (carry to next step)

Now, the problem would look this –

1 1

T 9 I S + I S --------- 9 0 R 0

T H I S + I S --------- H E R E

### Step 3

- T + 1 (carry) = 9
- Thus, T = 8

### Step 4

- S + S = 0
- Now, two possible values for S can be 0 or 5
- Now, 0 is not possible as its already taken by E
- So, S value is 5, as 5 + 5 = 0 (1 carry to next step)

### Step 6

- I + I will always generate even number
- But, there is 1 carry from previous step, so I + I + 1 will generate odd number
- Also, this is generating 1 carry at next step
- So, Sum of I + I + 1
- Is >10
- Is odd
- I + I + 1 > 10

- Possible values for I to generate this are 6, 7, 8, 9
- Since, 8 and 9 are already taken so 6, 7 are the only options

### Step 7

Lets take 6 first

- I + I + 1 = R (1 carry to next step)
- 6 + 6 + 1 = 13 = 3 ( 1 carry to next step)
- R value is 3.

There are no conflicts anywhere so question is solved.

Lets take I = 7, this should generate conflict.

- I + I + 1 = R (1 carry to next step)
- 7 + 7 + 1 = 15 = 5 ( 1 carry to next step)
- R value can not be 5 as S value is already taken as 5.

So our assumption of I = 6 was correct

Final Answer – H = 9, E = 0, T = 8, S = 5, I = 6, R = 3

1 1

T 9 I S

+ I S

---------

9 0 R 0

**Infosys Cryptarithmetic Questions 4**

### Step 1

- E is 1 as max carry possible is 1
- P + (nothing) = N, it should have had been P
- This means that there is a carry from previous step
- P + 1 (carry) >10 as it gives Carry at next step to result E
- Thus, P = 9
- E = P + 1 = 0 (1 carry)

So, E = 1, P = 9, N = 0

Since, the problem contains both 0 and O we will replace O by X to avoid confusion

P O I N T

+ Z E R O

-----------

E N E R G Y

### Step 2

- In, column 2, R + 0 = G, this means there must be 1 carry from previous step
- Thus, G = R + 1 that means they are consecutive and G >R
- Similarly, in column 3, R = I + 1. This means I and R as consecutive, with R >G
- Since, G = R + 1 and R = I + 1 => G = (I + 1) + 1 => G = I + 2
- Thus, G, R and I are consecutive, with G > R > I.

### Step 3

- T + O = Y

1 1 9 O I 0 T + Z 1 R O ----------- 1 0 1 R G Y

### Step 3

- T + O > 10, as its generating carry on next step.
- It will also not be 10 or 11 as T + O = Y and Y cant be 0 or 1 as those values are already taken.
- So lets assume T + O to be 12. Thus, Y = 2
- Possible values can be –
- T, O = (3, 9) not possible as 9 already taken
- T, O = (4, 8) possible as unoccupied, let’s try this.

1 1 1 9 O I 0 T + Z 1 R O ----------- 1 0 1 R G Y

### Step 4

- Till now the values are –
- N = 0, E = 1, Y = 2, T = 4, O = 8, P = 9
- Remaining values are 3, 5, 6, 7
- Now, Z + 8 = 11
- Thus, Z has to be 3

And since, we already know G, R, I are consecutive, thus, they are 5, 6, 7

So, E + N + E + R + G + Y = 1 + 0 + 1 + 6 + 7 +2 = 17

1 1 1 9 8 I 0 4 + Z 1 R 8 ----------- 1 0 1 R G 2

**Infosys Cryptarithmetic Questions 5**

**Question – If AA + BB + CC = ABC, then what is the value of A+B+C= ?**

- 15
- 18
- 21
- 12

### Step 1

What could be max possible value of ABC?

- If AA = 99
- If BB = 88
- If CC = 77

Thus, ABC = 99 + 88 + 77 = 264, from this fact we are 100% sure that max value of A can be 2

So A can be (1 or 2)

### Step 2

Now, lets look at the Unit’s place position. We have –

- A + B + C = C
- This can be possible if
- A + B = 0 or
- A + B = 10

- We already know A is either 1 or 2
- A + B = 1 + 9 = 0 or — (1)
- A + B = 2 + 8 = 0 — (2)

### Step 3

Now, lets try equation (1)

- At tens place we have A + B + C = B. Let’s replace the values
- 1 + 9 + C = 9 (1 carry obv)
- 1 + 9 + C = 19
- C = 9

B is already 9 so there must be one carry from previous step

- If carry is 1 then C = 9 – 1 = 8

So, A = 1, B = 9, C = 8

Note – Carry of 2 can’t be generated as A is 1 and B is 9 max possible value for C is 8 thus sum is 18

A A + B B

+ C C ----------- A B C

### Final Step

Replace values in all steps and solution looks like –

1 1 + 9 9

+ 8 8 ----------- 1 9 8

**Infosys Cryptarithmetic Questions 6**

**Question – If YOUR + YOU = HEART (Given O = 4) Value of Y + U + R + E is ?**

- 15
- 16
- 17
- 18

### Step 1

- Obv H = 1
- Y + nothing = E (not Y)
- Thus there is 1 cary from previous step
- Y + (1 carry) is generating 1 carry resulting H
- Thus, Y + 1 > 10 => Y = 9
- So, E = 0

H = 1, Y = 9, E = 0

Y O U R

+ Y O U ----------- H E A R T

### Step 2

Possibilities for A

- A can be A = 4 + 9 = 3
- or A = 4 + 9 + 1 (carry) = 4
- O is already 4 thus, A = 3

Step, 4 + 9 = A also, doesn’t get any carry from previous step U + 4 = R

### Step 3

U + 4 = R results in no carry.

- Thus, U + 4 < 10
- U < 6
- 4, 5, 1, 0 are already taken by O, A, H and E respectively
- So, U is either 5 or 2

Let’s take U = 5 ( no carry)

- U + 4 = R
- 5 + 4 = R = 9
- 9 is already taken by Y

Let’s take U = 5 ( 1 carry)

- U + 4 + 1 = R
- 5 + 4 + 1 = R = 0
- 0 is already taken by E
- Thus, U = 2

### Step 4

For tens position U + O = R i.e. 2 + 4 is 6

Guessing that there is no carry, T = R + U = 6 + 2 = 8

9 4 U R

+ 9 4 U ----------- 1 0 A R T

### Final Step

If we put all these values they generate no conflicts, thus we have reached the solution

9 4 2 6

+ 9 4 2 ----------- 1 0 3 6 8

**Infosys Cryptarithmetic Questions 7**

**Question – If TOM + NAG = GOAT Value of G + O + A + T is ?**

- 15
- 12
- 14
- Can not be determined

### Step 1

Clearly, G = 1 (Max carry is 1)

- O + A = O
- This is only possible in two ways
- If O is zero
- Or O is 9 and there is 1 carry from M + G = T step

- However, T + N = O it generates 1 carry to result G
- Thus, clearly T + N results 10 and O is zero and 1 carry to result G

T O M

+ N A G ----------- G O A T

### Step 2

- T + N should be 10
- T and N can be (8,2), (7,3), (6,4), (3,7), (2,8)
- Lets take (8,2)
- In this case A can take any values 3, 4, 5, 6, 7
- There are too many possibilities
- In this case unfortunately, the answer can not be determined.

T 0 M

+ N A G ----------- 1 0 A T

**Infosys Cryptarithmetic Questions 8**

**Question – If NO + NO + GUN = HUNT, what is the value of HUNT?**

- 1082
- 1802
- 1208
- 1280

### Step 1

- H = 1 (Max carry)
- G + (nothing) = U
- Thus, G has a carry => G + 1 > 10
- G = 9
- So, U = 0
- Since, we have 0 (zero) and O and both look similar, we will replace O with X to avoid confusion between O and 0 and also replace all other values

N O

+ N O

+ G U N ----------- H U N T

### Step 2

- From Tens digit, N + N + 0 = N
- Now, from the previous steps carry can be 0 or 1 or 2 since instead of 2 digit its 3 digit addition
- If carry is 0 from previous step then only possible scenario to satisfy N + N + 0 = N is when N = 0 itself. This is not possible as U value is already found out to be 0

### Step 3

Now, lets assume carry to be 2 from previous step (Hit and trial)

- The step N + N + 0 = N is generating 1 carry to next step so.
- N + N + 0 > 10
- We can also write this as
- N + N + 0 = 10 + N
- Solving this we get N = 8

1

N X

+ N X

+ 9 0 N ----------- 1 0 N T

### Step 4

- From units place we have
- X + X + 8 = T
- This step is generating a carry of 2 in next step as assumed

- So, X + X + 8 = 20 + T
- 2X – T = 12

Values already taken are 0, 1, 8. If, we look at the options the possible values for T from options are 0 or 8 as options say

**HUNT?**

- 1082
- 1802
- 1208
- 1280

8 is already taken so T = 2. Thus, X = 7

Verify the question again. We have found all the values the answer is 1082

1

8 X

+ 8 X

+ 9 0 8 ----------- 1 0 8 T

**Infosys Cryptarithmetic Questions 9**

**Question – IF EAT + THAT = APPLE, What is A + P + P + L + E?**

- 13
- 14
- 12
- 15

### Step 1

- Clearly A = 1, T = 9, P = 0 ( Think why?)
- After replacing the values here

E A T + T H A T ----------- A P P L E

### Step 2

- From Units place we know T + T = E
- We found T = 9 Thus E = 9 + 9 = 8 (1 carry to next step)
- L = A + A + 1 (carry from previous step)
- L = 1 + 1 + 1 = 3
- Finally E + H = 0 we already know E = 8
- Thus, H = 2

E 1 9 + 9 H 1 9 ----------- 1 0 0 L E

**Infosys Cryptarithmetic Questions 10**

### Step 1

- Clearly, P = 1, U = 9, E = 0
- Let’s replace the values here

U S A + U S S R ----------- P E A C E

### Step 2

- A + R = 0
- This is possible if, A = 5, R = 5, but, both can’t take same values
- So its possible with (8,2), (7,3), (6,4), (4,6), (3,7), (2,8)
- Let’s do hit and trial and take (2,8) and replace the new values.

0 S A + 9 S S R ----------- 1 0 A C 0

### Step 3

- Now, assuming S value to be 3
- We have S + S + 1 (carry) = C
- 3 + 3 + 1 => C = 7 (unoccupied)
- All the values are found out we just need to verify

1

0 S 2 + 9 S S 8 ----------- 1 0 2 C 0

### Step 3

- Values, are replaced and all the operations work just fine

Value of P + E + A + C + E = 1 + 0 + 2 + 7 + 0 = 10

1

0 3 2 + 9 3 3 8 ----------- 1 0 2 7 0

**Infosys Cryptarithmetic Questions 11**

**Question – MAC + MAAR = JOCKO, find value of 3A + 2M + 2C?**

- 31
- 36
- 33
- 38

### Step 1

- Here obviously J = 1 as max carry allowed it
- (nothing) + M = O, i.e. 0 + M = O this should have had been M only
- It means that there is 1 carry coming from previous step
- Also this M + 1 (carry) = O, is generating 1 carry to next step
- This means M + 1 > 10, this is only possible when M = 9
- => O = M + 1 = 9 + 0 = 0 (1 carry)

M A C + M A A R ----------- J O C K O

### Step 2

C + R = 0

Since, this is at units place there can be no carry from previous step

Possible values of (C, R) can be (2, 8), (3,7), (4, 6), (6,4), (7,3), (2,8)

Lets assume, first case C = 2 and R = 8 in that case C + R, will generate 1 carry to next step A + A = K. The new problem looks like this –

1 1

9 A C + 9 A A R ----------- 1 0 C K 0

### Step 3

- Thus, A + A + 1 (Carry) = K
- Also, 9 + A = 2, this is possible in two ways
- If, A = 3 (no carry from previous step) 9 + 3 = 2 (1 carry to next step)
- If, A = 2 (1 carry from previous step) but C value is already assumed to be 2, so this is not possible thus, A has to be 3
- Thus K = 3 + 3 + 1 = 7

All values are fetched and there is no conflict.

1 1 1

9 A 2 + 9 A A 8 ----------- 1 0 2 K 0

### Step 4

- Thus, 3 A + 2 M + 2 C = 3(3) + 2(9) + 2(2) = 9 + 18 + 4 = 31

1 1 1

9 3 2 + 9 3 3 8 ----------- 1 0 2 7 0

Thanks for providing the questions,may god gives all the things you desire

Thanku for explaining this topic beautifully and i want to buy infosys online class to learn more from where can i buy it?

Sure, you may prepare from here https://prepinsta.com/infosys/online-classes/

Hello Sir, your page helped me a lot in understanding the concept of Cryparithmetic. But still ido not have full confidence on cypto so do you have any online class or paid material from where i can practice more question. If there is then plzz guide me how to buy it.

Sure, you may prepare from here https://prepinsta.com/infosys/online-classes/

It is very useful site for preparing for an interview.

i don’t have much idea about this section can anyone tell me about this section.

sure