21:I[344796,["/_next/static/chunks/0whdtqcc5h8md.js","/_next/static/chunks/1qo17jq3o72yb.js","/_next/static/chunks/00mfjk9z2ewie.js","/_next/static/chunks/3_0kqrj9zuodm.js","/_next/static/chunks/2q9x6spyz4qxv.js","/_next/static/chunks/2cxhk-z7t3ztw.js","/_next/static/chunks/35kg0tmkl08ow.js","/_next/static/chunks/09hukzrse-ioj.js","/_next/static/chunks/3-qfh2-yexhl7.js","/_next/static/chunks/0_-iwh06bu1or.js"],"default"] 22:T5a6,

How many such pairs of letters are there in the word CHORDAMESODERM which has as many letters between them (from both the sides) as in the alphabets from A to Z?

(inferred — the photographed question is cut off at the right edge of the screen after "which has as many letters betwe"; the clause is restored from the identical wording used by two other items of this same assessment. The restoration is not load bearing: counting only pairs whose alphabetical step runs forward and counting pairs in both directions give the same total for this word.)

A pair qualifies when the number of letters lying between the two letters inside the word equals the number of letters lying between those same two letters in the English alphabet. Letters repeat in this word, and each occurrence is treated as a separate letter, so a pair is a pair of positions.

For reference, the letters of the word occupy these positions:

Position	1	2	3	4	5	6	7	8	9	10	11	12	13	14
Letter	C	H	O	R	D	A	M	E	S	O	D	E	R	M

23:T474,How many such pairs of letters are there in the word **CHORDAMESODERM** which has as many letters between them *(from both the sides)* as in the alphabets from A to Z? *(inferred — the photographed question is cut off at the right edge of the screen after "which has as many letters betwe"; the clause is restored from the identical wording used by two other items of this same assessment. The restoration is not load bearing: counting only pairs whose alphabetical step runs forward and counting pairs in both directions give the same total for this word.)* A pair qualifies when the number of letters lying **between** the two letters inside the word equals the number of letters lying **between** those same two letters in the English alphabet. Letters repeat in this word, and each occurrence is treated as a separate letter, so a pair is a pair of **positions**. For reference, the letters of the word occupy these positions: | Position | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | |---|---|---|---|---|---|---|---|---|---|---|---|---|---|---| | Letter | C | H | O | R | D | A | M | E | S | O | D | E | R | M | 24:Tdaa,## Overview Every unordered pair of positions in the fourteen-letter word is tested against one rule, and exactly four pairs satisfy it. The answer is `4`. ## Key Insight The rule compares two independent gaps: how many letters sit between the pair *inside the word*, and how many letters sit between the same two letters *in the alphabet*. Both are counts of the letters strictly in between, not distances, so adjacent items give a gap of zero on both sides. Because the word repeats letters — `D`, `E`, `M`, `O` and `R` all appear twice — a pair must be identified by position, not by letter, or repeats get miscounted. ## Approach Index the word: `C` at 1, `H` at 2, `O` at 3, `R` at 4, `D` at 5, `A` at 6, `M` at 7, `E` at 8, `S` at 9, `O` at 10, `D` at 11, `E` at 12, `R` at 13, `M` at 14. For each of the ninety-one position pairs, compute the in-word gap as the difference of the two positions minus one, compute the alphabet gap as the difference of the two letters' alphabet indices minus one, and keep the pair when the two agree. I ran this enumeration as a short script over all ninety-one pairs, under both readings of the rule — forward-only, where the second letter must come later in the alphabet, and both-directions, where either orientation counts. Both readings printed the same four pairs and the same total of `4`, which is what makes the missing clause in the photograph harmless. The four qualifying pairs the script printed are `H`(2) with `M`(7), where four letters sit between them in the word and `I`, `J`, `K`, `L` sit between them in the alphabet; `D`(5) with `M`(14), where eight letters sit between them in the word and `E` through `L` sit between them in the alphabet; `O`(10) with `R`(13), where two letters sit between them in the word and `P`, `Q` sit between them in the alphabet; and `D`(11) with `E`(12), which are adjacent in both the word and the alphabet, giving a gap of zero on each side. Comparing the four options: `3` is what you get by overlooking the adjacent `D`–`E` pair at positions 11 and 12, which is easy to miss because a zero gap does not look like a gap. `5` and `6` come from double-counting the repeated letters — treating `D`–`M` as several pairs because both `D` and `M` occur twice, when only the `D` at position 5 with the `M` at position 14 actually satisfies the rule. `4` is the answer. ## Why This Works The rule is a pure equality between two independently computable integers, so a pair either satisfies it or it does not, and exhaustive enumeration over all ninety-one pairs cannot miss one or invent one. Running both readings of the ambiguous clause and observing that they agree closes the only gap the damaged source left open. Note that the option marked on the photographed screen is `6`, which is the double-counting error, not the correct count. ## Complexity Quadratic in the length of the word — ninety-one pairs for fourteen letters — with constant work per pair, which is trivial at this size. ## Common Pitfalls Counting the letters *including* the endpoints instead of strictly between them shifts every comparison by two and produces a completely different set. Treating repeated letters as a single letter, or as automatically forming multiple valid pairs, is the other frequent error. Finally, scanning only left-to-right neighbours misses the long-range pairs such as `D` at position 5 with `M` at position 14, where eight letters separate them in both the word and the alphabet.19:[["$","script",null,{"type":"application/ld+json","dangerouslySetInnerHTML":{"__html":"{\"@context\":\"https://schema.org\",\"@type\":\"LearningResource\",\"learningResourceType\":\"Coding Question\",\"name\":\"Alphabet-Gap Letter Pairs in the Word CHORDAMESODERM\",\"description\":\"How many such pairs of letters are there in the word \\\"**CHORDAMESODERM**\\\" which has as many letters between them (from both the sides) as in the alphabets from A to Z?\",\"educationalLevel\":\"medium\",\"about\":{\"@type\":\"Organization\",\"name\":\"Qualcomm\"},\"provider\":{\"@type\":\"Organization\",\"name\":\"OAHelper\",\"url\":\"https://www.oahelper.in\"},\"isPartOf\":{\"@type\":\"WebSite\",\"name\":\"OAHelper\",\"url\":\"https://www.oahelper.in\"},\"url\":\"https://www.oahelper.in/problems/OTEwMDAxMjYxfDA/alphabet-gap-letter-pairs-in-the-word-chordamesoderm\"}"}}],["$","script",null,{"type":"application/ld+json","dangerouslySetInnerHTML":{"__html":"{\"@context\":\"https://schema.org\",\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https://www.oahelper.in/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Problems\",\"item\":\"https://www.oahelper.in/problems\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Alphabet-Gap Letter Pairs in the Word CHORDAMESODERM\",\"item\":\"https://www.oahelper.in/problems/OTEwMDAxMjYxfDA/alphabet-gap-letter-pairs-in-the-word-chordamesoderm\"}]}"}}],["$","$L21",null,{"fallback":["$","section",null,{"className":"mx-auto max-w-5xl px-6 py-24 text-white","children":[["$","h1",null,{"className":"mb-5 text-3xl font-bold","children":"Alphabet-Gap Letter Pairs in the Word CHORDAMESODERM"}],["$","p",null,{"children":["Company: ","Qualcomm"]}],["$","p",null,{"children":["Difficulty: ","medium"]}],["$","div",null,{"children":[["$","h2",null,{"children":"Problem Statement"}],[["$","div","910000818",{"children":[["$","h3",null,{"children":["Question ",1]}],["$","p",null,{"children":"How many such pairs of letters are there in the word \"**CHORDAMESODERM**\" which has as many letters between them (from both the sides) as in the alphabets from A to Z?"}]]}]]]}],false,false,["$","nav",null,{"aria-label":"Related company pages","children":[["$","$L9",null,{"href":"/company-questions/qualcomm","children":["More ","Qualcomm"," OA questions"]}],["$","$L9",null,{"href":"/interview-experiences","children":"Interview experiences"}]]}]]}],"id":"OTEwMDAxMjYxfDA","initialQuestion":{"id":"OTEwMDAxMjYxfDA","title":"Alphabet-Gap Letter Pairs in the Word CHORDAMESODERM","google_doc_link":null,"problem_statement":"$22","solution_cpp":null,"solution_python":null,"solution_java":null,"pregiven_code_cpp":null,"pregiven_code_python":null,"pregiven_code_java":null,"difficulty":"medium","question_type":"mcq","premium_required":0,"created_at":"2026-08-20T11:01:49.665971+00:00","updated_at":"2026-08-20T13:26:50.315938+00:00","solution_code":null,"solution":null,"pregiven_code":null,"input_test_case":null,"output_test_case":null,"lc_tags":"[\"Logical Reasoning\", \"Alphabet Series\", \"Counting\"]","visual_animation":null,"difficulty_score":52,"md_problem_statement":"$23","unique_company_name":"qualcomm","sql_solution":null,"bash_solution":null,"js_solution":null,"editorial":"$24","hidden_test_cases_blob_count":null,"youtube_tutorial":null,"prompt_solution":null,"campus_type":"on_campus","college_name":"IIT Kharagpur","role":"SDE","hidden_test_cases_ref":null,"is_mock_oa":false,"publication_status":"published","has_image":true,"company_name":"Qualcomm","is_first_in_company":false,"company_ref":"MTg5OXww"},"isQotdToday":false,"qotdReward":5}]]

Alphabet-Gap Letter Pairs in the Word CHORDAMESODERM

Problem Statement

Question 1