| TC-01 | Login page renders all elements | Table of expected elements, anyMatch scan per item | Two Sum (#1): existence lookup. A set would make it O(1), but at about 10 items a scan is fine | Analogy |
| TC-02 to TC-08 | Login validation (7 cases) | Data-driven table (Object[][]), boundary values 7 vs 8 | "Write the test cases for this function" (boundary values, equivalence classes); off-by-one thinking from First and Last Position (#34) | Analogy |
| TC-09 | Captcha blocks an automated login | Wait, check, retry the click once, then assert | Retry with backoff | Analogy |
| TC-10 | API rejects login without a captcha token | Assert status and a JSON field | Validate a JSON response against an expected shape | Analogy |
| TC-11 | Header: logo, tabs, streak, logout | Expected map of tab to href compared with the DOM | Deep-compare / diff two objects | Direct |
| TC-12 | Every tab navigates to its page | LinkedHashMap iterated in insertion order | LRU Cache (#146): same hash map + doubly linked list structure | Direct |
| TC-13 | Greeting shows today in IST | Timezone-aware date formatting | - | None |
| TC-14 | Panchangam box and three kalams | Build map of name to time, containsOnlyKeys | Valid Anagram (#242): exact equality of two collections | Direct |
| TC-15 | Family switcher shows Me and Add child | Visibility checks | - | None |
| TC-16 | Add child opens the family section | URL match after click | - | None |
| TC-17 | Streak card: streak, best, punya | Several regex patterns over one block of text | Parse a log file and extract fields | Analogy |
| TC-18 | Anushtanams list: slots and Mark Done | Filter cards by a child element's text | - | None |
| TC-19 | Mark one sandhya slot (opt-in) | Regex extract the count, skip if already done | - | None |
| TC-20 | Picker disables tracked practices | Verifies the app refuses duplicates | Contains Duplicate (#217): set membership | Direct |
| TC-21 | Search filters the picker | Substring filter, count equals 1 | - (a linear scan here; at scale this becomes a Trie) | None |
| TC-22 | Add an untracked anushtanam (opt-in) | filter then findFirst, then membership re-check | First Unique Character (#387): first item matching a condition, early exit | Analogy |
| TC-23 | Lists every read-along practice | Count equals 14, plus each name present | Intersection of Two Arrays (#349) / set equality | Direct |
| TC-24 | Hanuman Chalisa reader, language switch | One-hot toggle state | - | None |
| TC-25 | History: family switcher and dated entries | div[not(*)]: leaf nodes of the DOM tree | Maximum Depth of Binary Tree (#104): tree traversal, leaf = no children | Direct |
| TC-26 | Sabha defaults to this week | Text and class checks | - | None |
| TC-27 | Week / Month / Kids switch the board | State switches and returns to start | - | None |
| TC-28 | Calendar day view details and kalams | Soft assertions in a loop | - | None |
| TC-29 | Next and Previous move a day and back | Inverse operations return to the start state | Valid Parentheses (#20): every open matched by a close returns to balance | Analogy |
| TC-30 | Week and Month views | Exclusive selection | - | None |
| TC-31 | Profile: name, tier progress, stats | Regex on text (8-char hex invite code) | - | None |
| TC-32 | Save enabled only after the name changes | Dirty check: current value compared to original | Deep-compare / diff two objects | Analogy |
| TC-33 | Delete account disabled without the email | Guard condition check | - | None |
| TC-34 | Footer links | Map of link text to href compared with the DOM | Deep-compare / diff two objects | Direct |
| TC-35 | Add a child and remove it | Unique name from a timestamp, paired add/remove | - | None |
| TC-36, TC-37 | Tradition / marital status round-trips | Swap by destructuring, event wait, poll until a fresh reload agrees | Retry with backoff (bounded polling) | Analogy |
| TC-38 | Leaderboard opt-in round-trip | Same pattern for a boolean | Retry with backoff (bounded polling) | Analogy |
| TC-39 | Logout returns to the login page | Runs last, as the final node of the project DAG | Course Schedule (#207): topological sort | Direct |