Q2. If DELHI is coded as 73541 and CALCUTTA as 82589662, how can CALICUT be…

CONCEPT: In a letter-to-number coding puzzle, every letter that appears in any of the given coded words is assigned one fixed digit, and that same digit must reappear wherever the letter recurs, whether within the same word or across a different word. Solving the puzzle means merging the digits from every example into a single letter-to-digit key, rather than treating each coded word in isolation.

APPLICATION:

1. Read the digits DELHI's code assigns to its own letters: D-7, E-3, L-5, H-4, I-1.

2. Read the digits CALCUTTA's code assigns to its own letters: C-8, A-2, L-5, C-8, U-9, T-6, T-6, A-2.

3. Merge both readings into one key, checking that every repeated letter lines up: L=5 agrees across both words, and within CALCUTTA the repeats C-C, A-A and T-T each land on the same digit (8-8, 2-2, 6-6).

4. Substitute every letter of CALICUT (C, A, L, I, C, U, T) using this merged key: 8, 2, 5, 1, 8, 9, 6.

5. Concatenate the digits in that order to get the code: 8251896.

CROSS-CHECK: CALICUT repeats the letter C at its first and fifth positions; both substitute to the same digit, 8, mirroring the self-consistency already seen in CALCUTTA (where C, A and T each repeat and agree). This independent check confirms the key was read correctly, so the code for CALICUT is 8251896.