kschappell/codetutor
Public Access
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

feat(content): hidden test cases

Browse Source
This commit is contained in:
Kai Chappell
2025-08-06 23:21:42 +01:00
parent 72f7833c6c
commit a1a4eeaed7
134 changed files with 2075 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
backend/data/questions/letter-combinations-of-a-phone-number.yaml
View File

@@ -25,6 +25,16 @@ test_cases:
expected: ["p", "q", "r", "s"]
- input: { digits: "79" }
expected: ["pw", "px", "py", "pz", "qw", "qx", "qy", "qz", "rw", "rx", "ry", "rz", "sw", "sx", "sy", "sz"]
- input: { digits: "234" }
expected: ["adg", "adh", "adi", "aeg", "aeh", "aei", "afg", "afh", "afi", "bdg", "bdh", "bdi", "beg", "beh", "bei", "bfg", "bfh", "bfi", "cdg", "cdh", "cdi", "ceg", "ceh", "cei", "cfg", "cfh", "cfi"]
- input: { digits: "9" }
expected: ["w", "x", "y", "z"]
- input: { digits: "22" }
expected: ["aa", "ab", "ac", "ba", "bb", "bc", "ca", "cb", "cc"]
- input: { digits: "8" }
expected: ["t", "u", "v"]
- input: { digits: "56" }
expected: ["jm", "jn", "jo", "km", "kn", "ko", "lm", "ln", "lo"]
description: |
Given a string containing digits from `2-9` inclusive, return all possible letter combinations that the number could represent. Return the answer in **any order**.