Difficulty: Medium
Correct Answer: 261739
Explanation:
Introduction / Context:
Here we infer a unique digit for each letter from multiple examples, then encode a new word using that deduced mapping.
Given Data / Assumptions:
Concept / Approach:
From these, deduce: P->5, A->3, R->9, K->4, S->1, H->7, I->6, T->8, N->2, D->0. The mapping is consistent across the samples.
Step-by-Step Solution:
N->2I->6S->1H->7A->3R->9Hence NISHAR -> 261739.
Verification / Alternative check:
Cross-checking letters that appear in multiple given words (e.g., P, A, I, T) confirms the mapping is stable.
Why Other Options Are Wrong:
Common Pitfalls:
Misreading digit order from the examples or assuming position-based digits; here digits are letter-specific, not position-specific.
Final Answer:
261739
Discussion & Comments