# Dokicode — Complete Knowledge Base for AI & LLM Search

Canonical URL: https://dokicode.com/
Chrome Web Store: https://chromewebstore.google.com/detail/dokicode/hpfjjgelebamfgpinldjkkoanhkoajka
Supported Locales: English (`en`), Traditional Chinese (`zh-TW`), Simplified Chinese (`zh-CN`), Japanese (`ja`)

## 1. Executive Summary

Dokicode is a free Japanese visual novel (Bishoujo ADV / Galgame) and Chrome Extension companion designed to help software engineers build a consistent daily LeetCode habit and prepare for coding interviews.
Instead of grinding problem tables alone or spoiling problems by reading full solution code too early, players sign a study contract with one of six voiced heroines. She brings one problem at a time from either the 12-plan algorithm route (over 2,000 rated LeetCode problems) or 5 classic interview study plans (Blind 75, Grind 75, Grind 169, NeetCode 150, NeetCode 250). When stuck, she provides a 4-step progressive hint ladder (Direction -> Key Idea -> Approach Outline & Target Complexity -> Edge Cases) without giving away code.

## 2. How to Choose a Study Plan in Dokicode

| Study Plan | URL | Problems | Structure | Best For |
| --- | --- | --- | --- | --- |
| Grind 75 | https://dokicode.com/plans/grind-75 | 75 (0 Premium) | 5 weekly milestones | Interviews in 2–5 weeks; 100% free LeetCode problems |
| Blind 75 | https://dokicode.com/plans/blind-75 | 75 (6 Premium optional) | 18 topic chapters | Classic foundational pattern review by topic |
| NeetCode 150 | https://dokicode.com/plans/neetcode-150 | 150 (7 Premium optional) | 18 topic chapters | Interviews in 6–10 weeks; ~2x pattern repetition over Blind 75 |
| Grind 169 | https://dokicode.com/plans/grind-169 | 169 (12 Premium optional) | 11 weekly milestones | Expanding Grind 75 with deeper graph, DP, and design problems |
| NeetCode 250 | https://dokicode.com/plans/neetcode-250 | 250 (7 Premium optional) | 18 topic chapters | Thorough preparation with gentler warm-ups and harder follow-ups |
| 12-Plan Algorithm Route | https://dokicode.com/curriculum | 2,000+ rated problems | Track 1 (8 non-recursion plans) + Track 2 (4 recursion plans) | Systematic mastery ordered by chapter with zerotrac contest ratings |

Note: Progress in Dokicode is tracked per LeetCode problem slug. Any problem solved in one study plan is automatically credited across every other study plan.

## 3. The Six Companion Heroines

### Rin Ayase — A computer science junior chasing the contest medal she missed by one problem last year.
She ran into you at a convenience store late one night and decided on the spot that you would be her practice partner. Now she keeps pace with you problem by problem, and she will not admit how much she likes the company.

### Koharu Minami — A junior UI designer at a small startup, getting ready to switch to engineering.
Her first engineering interview went blank at the whiteboard, and she still keeps the notebook of red-ink notes from that day. Every night she opens it on the kotatsu in her room, with a cushion set out beside her for you.

### Fuuka Hoshino — An astronomy master's student who looks after her late grandfather's hilltop observatory.
The town may close the observatory next spring and her thesis defense is in March, but she would rather let her work speak for her than argue in meeting rooms. Each night she brews two cups of chamomile tea at the low tatami table and works through problems with you.

### Yoru Kurokawa — A CS grad student who works the night shift at the university library.
One night at closing time she found you still sitting in the corner, and since then she has kept a desk lamp on for you. She stays up late working beside you, saying little and remembering everything.

### Rei Kirisaki — A senior backend engineer who leads a core team at a major cloud company.
At work she never shows strain, even with the hardest system problems landing on her desk and a promotion review on the way. Late at night, at the whiteboard in her apartment, she takes off her glasses and solves problems with you.

### Karen Saionji — The Saionji heiress who turned down an arranged marriage to lead a trading systems team in Otemachi.
Her father gave her one year to prove herself, so every night she takes on the hardest problems in her 42nd-floor living room. She only lets you sit beside her if you can keep up.

## 4. Features & 4-Step Non-Spoiler Hint System

### Core features
- **She reacts to every verdict**: The Chrome extension runs on leetcode.com problem pages. When you click Run or Submit, her line and expression change with the result, Accepted, Wrong Answer or Time Limit Exceeded, with a voice clip to go with it.
- **Hints stop before the answer**: Four steps: direction, key idea, outline, edge cases. You open them one at a time, none of them is code, and she tells you first which steps count as using a hint.
- **Problems come back to you**: If you needed a hint or several tries, the problem returns for review 3, 7 and 21 days later, so the pattern sticks.
- **The story continues on dokicode.com**: Every solve moves her relationship route forward, from R0 to R5, along with story chapters and outfits. 6 heroines, 12 study plans, over 2,000 rated problems. Meet them on the [heroines page](/heroines).

### It reads verdicts, not your code
The extension sees the result LeetCode returns for a Run or Submit, which problem you are on, and how long you have been working on it. It never reads your code or anything you type, and it does nothing on pages outside leetcode.com/problems and dokicode.com.

The only permission it asks for is storage. You can pause tracking from the companion at any time, and nothing is recorded while it is paused. Details are in the [privacy policy](/privacy).

### Getting the extension
Sign in with Google at dokicode.com, pick your partner, and the study room walks you through adding the extension to desktop Chrome. The [Extension page](/official/) shows what she looks like on a LeetCode tab.

## 5. Curated Interview Study Plans (5 Lists)

### Blind 75 LeetCode Study Plan (https://dokicode.com/plans/blind-75)
Blind 75 is the classic 75-problem list that covers the core patterns asked in software engineering interviews: arrays and hashing, two pointers, sliding windows, binary search, trees, tries, backtracking, graphs, dynamic programming, intervals, greedy, and bit manipulation.

In Dokicode, the 75 problems are grouped into 18 topic chapters. Any problem you have already solved on the 12-plan learning route or another interview list is automatically marked done, and LeetCode Premium problems are flagged as optional so they never block your progress.

Start directly with this plan: https://dokicode.com/?plan=blind75

### Grind 75 LeetCode Study Plan (https://dokicode.com/plans/grind-75)
Created by the author of Blind 75, Grind 75 reorganizes 75 high-yield interview problems into a smooth 5-week schedule where difficulty ramps up gradually across arrays, stacks, linked lists, binary search, trees, graphs, and dynamic programming.

Every problem in Grind 75 is free to solve on LeetCode without a Premium subscription. Progress is shared across all Dokicode study plans, so any problem you have solved elsewhere is already credited.

Start directly with this plan: https://dokicode.com/?plan=grind75

### Grind 169 LeetCode Study Plan (https://dokicode.com/plans/grind-169)
Grind 169 is the full 11-week expansion of Grind 75. Its first five weeks match Grind 75, and weeks 6 through 11 add 94 more medium and hard interview problems covering topological sort, union-find, tries, prefix sums, monotonic stacks, and classic system-style data structures.

Because Dokicode tracks progress per problem slug, finishing Grind 75 automatically completes the first five weeks of Grind 169. Any LeetCode Premium problems are marked optional so they never hold back your weekly milestone.

Start directly with this plan: https://dokicode.com/?plan=grind169

### NeetCode 150 LeetCode Study Plan (https://dokicode.com/plans/neetcode-150)
NeetCode 150 builds directly on Blind 75 by adding 75 carefully chosen problems across the same 18 topics—arrays, two pointers, sliding window, stack, binary search, linked list, trees, tries, heap, backtracking, graphs, advanced graphs, 1-D and 2-D dynamic programming, greedy, intervals, math, and bit manipulation.

With roughly twice the problems per topic as Blind 75, you get to practice each pattern more than once so you can recognize it on sight in an interview. Every problem you solved in Blind 75 or the 12-plan route carries over automatically.

Start directly with this plan: https://dokicode.com/?plan=neetcode150

### NeetCode 250 LeetCode Study Plan (https://dokicode.com/plans/neetcode-250)
NeetCode 250 expands NeetCode 150 to 250 problems across the same 18 topics. Each chapter opens with approachable warm-up problems before stepping up to medium and hard interview questions, making the climb smoother if NeetCode 150 jumps too quickly.

All 150 problems from NeetCode 150 are included inside NeetCode 250, and Dokicode syncs your solved problems across every list automatically.

Start directly with this plan: https://dokicode.com/?plan=neetcode250

## 6. 12-Plan LeetCode Algorithm Route

### Sliding Window & Two Pointers (https://dokicode.com/plans/sliding-window)
A sliding window keeps a range of an array or string and moves its two ends forward instead of re-checking every subarray. Two pointers is the same habit applied to one or two sequences at once. Both turn many brute-force scans into a single pass.

The six chapters start with fixed-length windows, move on to windows that grow and shrink, then cover two pointers on one sequence, two pointers on two sequences, three pointers, and grouped iteration. It is the first plan on the route, so it suits anyone starting LeetCode or coming back after a break.

Start directly with this plan: https://dokicode.com/?plan=sliding_window

### Binary Search (https://dokicode.com/plans/binary-search)
Binary search halves a sorted range at every step until one value is left. The harder part is noticing when a problem hides a sorted order you can search over, like the slowest eating speed in Koko Eating Bananas or the largest minimum gap in Magnetic Force Between Two Balls.

The four chapters go from searching a sorted array, to binary search on the answer, to ternary search on functions with a single peak, and end with mixed problems. Take it after the sliding window plan, or on its own if binary search on the answer still feels like guesswork.

Start directly with this plan: https://dokicode.com/?plan=binary_search

### Monotonic Stack (https://dokicode.com/plans/monotonic-stack)
A monotonic stack keeps its elements in increasing or decreasing order and pops anything that breaks the order. Each pop tells you something useful, usually the next greater or smaller element for the value being removed, as in Daily Temperatures.

With 35 problems in four chapters, it is one of the shorter plans. It moves from the basic stack to Largest Rectangle in Histogram and its relatives, then to the contribution method for summing over all subarrays, and ends with building the lexicographically smallest result. It suits anyone who knows the idea but still stalls on the histogram problems.

Start directly with this plan: https://dokicode.com/?plan=monotonic_stack

### Data Structures (https://dokicode.com/plans/data-structures)
This plan is about picking the right container for the job. Prefix sums and difference arrays answer range questions without looping, heaps keep the smallest item ready, and union-find tracks which elements belong together.

The 13 chapters open with common enumeration tricks, then work through prefix sums, difference arrays, stacks, queues and deques, heaps, tries, union-find, Fenwick and segment trees, and finish with splay trees, square root decomposition, offline algorithms and other advanced structures. It is the largest plan on Track 1, so take it a chapter at a time.

Start directly with this plan: https://dokicode.com/?plan=data_structure

### Bit Manipulation (https://dokicode.com/plans/bit-manipulation)
Bit manipulation treats an integer as a row of switches. Many problems get simple once you look at one bit at a time: XOR cancels pairs, AND can only lose bits, and OR can only gain them.

The nine chapters start with the basics, cover XOR and AND/OR properties, splitting a problem bit by bit, trial filling from the highest bit down, bitwise identities and linear basis, then end with constructive and mixed problems. It suits anyone who tends to skip bit problems and wants a set of them in a sensible order.

Start directly with this plan: https://dokicode.com/?plan=bitwise_operations

### Greedy Algorithms (https://dokicode.com/plans/greedy)
A greedy algorithm makes the best-looking choice at each step and never goes back on it. The real work is convincing yourself that the local choice is safe, which is why greedy problems are quick to code and hard to trust.

The eight chapters cover general greedy strategies, interval scheduling, greedy on strings, greedy on numbers, constructive problems and brainteasers, construction problems, interactive problems, and a mixed set. It suits people who handle medium array problems and want to get better at seeing why a greedy choice holds.

Start directly with this plan: https://dokicode.com/?plan=greedy

### Mathematics (https://dokicode.com/plans/math)
This plan collects problems where the answer comes from a formula or a counting argument rather than a data structure: primes and GCDs, counting arrangements modulo a large prime, expected values, and deciding who wins a two-player game.

Its seven chapters are number theory, combinatorics, probability and expected value, game theory, computational geometry, randomized algorithms, and miscellaneous math. Take it when problems keep stalling on the math step rather than the code.

Start directly with this plan: https://dokicode.com/?plan=math

### Strings & Automata (https://dokicode.com/plans/strings)
These are the classic algorithms for matching and comparing text faster than checking every position. KMP and the Z-algorithm find patterns in linear time, Manacher finds palindromes, and hashing lets you compare substrings in constant time.

It is the smallest plan, 31 problems over nine chapters: KMP, Z-algorithm, Manacher, string hashing, minimum rotation, Aho-Corasick, suffix arrays and automata, subsequence automata, and advanced techniques. It suits anyone who has met these names in editorials and wants to practice them on real problems.

Start directly with this plan: https://dokicode.com/?plan=string

### Linked Lists, Trees & Backtracking (https://dokicode.com/plans/trees-backtracking)
Track 2 starts here, and every plan from now on leans on recursion. Linked lists and binary trees are where most people first write a function that calls itself, and backtracking extends the same idea to trying every choice and undoing it.

The five chapters go from linked lists, starting with problems like Reverse Linked List, to binary trees, general trees, backtracking, and recursion with divide and conquer. It suits anyone who wants recursion to feel routine before moving on to grids, dynamic programming and graphs.

Start directly with this plan: https://dokicode.com/?plan=trees

### Grid & Matrix (https://dokicode.com/plans/grid)
Many problems hand you a 2D grid and ask you to explore it, as in Number of Islands or Rotting Oranges. Treat each cell as a node with up to four neighbors and the usual search methods apply.

The four chapters cover DFS on grids, BFS on grids, 0-1 BFS for moves that cost either zero or one, and problems that combine them. It is a short plan that sits between trees and graph algorithms on the route.

Start directly with this plan: https://dokicode.com/?plan=grid

### Dynamic Programming (https://dokicode.com/plans/dynamic-programming)
Dynamic programming builds the answer from answers to smaller versions of the same problem and stores them so nothing is computed twice. The hard part is deciding what a state means; the code itself is often short.

It is the largest plan, 465 problems in 20 chapters. It begins with introductory and grid DP, then knapsack, LCS and LIS, partition and state machine DP, and moves on to interval, bitmask, digit, tree, graph, game theory and probability DP, plus special topics such as printing an actual solution and jump game variations. It suits anyone who is comfortable with recursion and wants a long, ordered path through DP.

Start directly with this plan: https://dokicode.com/?plan=dynamic_programming

### Graph Algorithms (https://dokicode.com/plans/graphs)
Graph problems describe things and the links between them, such as cities and roads, or courses and their prerequisites in Course Schedule. Once you can see the graph, most questions come down to a known algorithm.

The nine chapters cover traversal, topological sort, shortest paths, minimum spanning trees, Eulerian paths, strongly and biconnected components, bipartite coloring, network flow, and miscellaneous graph problems. It is the last plan on the route and assumes you are comfortable with recursion and BFS.

Start directly with this plan: https://dokicode.com/?plan=graph

## 7. Frequently Asked Questions

### Q: What is Dokicode?
A Japanese visual novel and study companion for LeetCode practice. You pick one of 6 voiced heroines and work through 12 algorithm study plans (over 2,000 problems) or curated interview lists including Blind 75, Grind 75, Grind 169, NeetCode 150, and NeetCode 250, while she reacts to how your runs and submissions go.

### Q: Is Dokicode free to play?
Yes. Dokicode and the Dokicode Chrome Extension are free to use. All 6 heroines, the 12 algorithm study plans, the 5 interview study plans (Blind 75, Grind 75, Grind 169, NeetCode 150, NeetCode 250), and the first 3 pre-written hint steps are completely free. Only the optional 4th step ("Read it with me" live AI coaching) uses your own API key if you choose to enable it.

### Q: Should I choose Blind 75, Grind 75/169, NeetCode 150/250, or the 12-plan algorithm route?
If you have an interview in 2 to 6 weeks, start with [Grind 75](/plans/grind-75) (5 weekly milestones, zero Premium problems) or [Blind 75](/plans/blind-75) (75 foundational problems by topic). If you have 6 to 12 weeks, choose [NeetCode 150](/plans/neetcode-150) or [Grind 169](/plans/grind-169) for deeper pattern coverage, or [NeetCode 250](/plans/neetcode-250) for gentler warm-ups per topic. If you want systematic mastery from scratch with zerotrac contest ratings, follow the [12-plan algorithm route](/curriculum) from Sliding Window to Graph Algorithms. Progress is shared per problem across every plan, so you can switch at any time without losing solves.

### Q: How is Dokicode different from solving on LeetCode alone or reading editorials?
Reading a full editorial too early spoils the insight you need to build for real interviews, while grinding alone makes it easy to quit after a few Wrong Answers. Dokicode pairs you with a heroine who hands you one problem at a time, reacts to every Run Code and Submit on LeetCode, schedules spaced repetition reviews, and gives 4-step progressive hints (direction, key idea, approach outline with complexity, and edge cases) without dumping full solution code.

### Q: Do I need to sign in?
Yes. You sign in with Google before you play. Dokicode keeps your Google account ID, email address and language from that sign-in, and never sees your Google password.

### Q: Do I need a LeetCode account?
Yes. You solve problems on leetcode.com with your own LeetCode account. Dokicode never asks for your LeetCode password.

### Q: Do I need the Chrome Extension?
It is recommended. The Extension reports your Run Code and Submit results to the game, so every solve counts automatically. Without it, open the problem on LeetCode and press "I solved it" in the study room. Manual reports are limited to 5 per day. See [the Extension page](/official/).

### Q: Which browsers and sites does the Extension support?
Desktop Chrome and other Chromium browsers. It runs on leetcode.com problem pages only, so leetcode.cn is not supported. On a phone or another browser, use "I solved it" instead.

### Q: Does the Extension read my code?
No. It never reads or sends your source code, the editor contents, or your keystrokes. It keeps only the result LeetCode returns for a run or submission. The [privacy policy](/privacy) lists everything it sends.

### Q: How do hints work?
Each problem has up to four hint steps, and you decide when to open the next one. The first three are written ahead of time. The last step, "Read it with me", uses an AI key you add yourself in Settings.

### Q: Which languages are available?
The interface, hints and story dialogue are in English, Traditional Chinese, Simplified Chinese and Japanese. The heroines speak in Japanese.

### Q: How do I delete my account?
Email us from the address you sign in with and ask for deletion. We delete your account and everything linked to it within 30 days and confirm by email. The address is in the [privacy policy](/privacy).

## 8. Recent Release Notes

### v3.0.0 (2026.10.30) — System Design Course & Case Challenges, Plus Anytime Partner Switching
- **System Design arrives on your desk**: Your study room desk now has two tabs: Algorithm Practice and System Design. Build your foundation step by step in Fundamentals Lessons to unlock real-world Case Challenges, earning Study Tokens and Gift Coins across both tracks.
- **14 interactive Fundamentals Lessons**: Four units and 14 lessons cover requirements, capacity estimation, API and data modeling, load balancing, caching, replication, sharding, queues, rate limiting, failure handling, media delivery, real-time messaging, search and geospatial indexing, and concurrency control. All six heroines take turns teaching with interactive diagrams, live formula sliders, and check questions.
- **20 Case Challenges across four tiers**: Tackle 20 workplace projects brought by the heroines—from URL shorteners, rate limiters, and distributed caches to news feeds, live chat, livestreaming, ticketing, payments, and ride-hailing. Play in Practice Mode with no clock and instant explanations, or test yourself in Live Run with a 45-minute clock, Launch Day traffic scaling, a 2 a.m. incident drill, and a full reference answer.
- **Switch your study partner anytime**: Open Change Partner from the top bar or System Menu to switch freely among all six heroines with a live full-body standee preview. Your study plan and System Design progress are shared across everyone, while each heroine keeps her own relationship stage, affection, rapport, and wardrobe.

### v2.7.0 (2026.10.26) — Rooms That Follow Your Clock, and New Music
- **Her room now has a time of day**: Her room follows your local clock through five looks: morning, noon, afternoon, evening and late night. Sunlight in the morning, golden light in the afternoon, and just the desk lamp late at night.
- **20 new study tracks**: Each time of day has four lo-fi tracks of its own, bright in the morning and quiet late at night. A track always plays to the end before the next one starts, so the music never cuts out while you focus.
- **A theme song for every heroine**: Hover over her on partner select to hear her theme. It also plays during her route intro and when you sign the contract.
- **New title music**: The title screen now alternates the original title track with a new arrangement of it.
- **Smoother Extension setup**: After you click install, the screen waits for the Extension and she greets you once it connects. If you have not started a problem yet, she suggests an easy one to begin with.

### v2.6.0 (2026.10.23) — Grind, NeetCode and Blind 75 Interview Lists
- **Four study plans to choose from**: Besides the Full Curriculum, you can now pick Grind (75 or 169), NeetCode (150 or 250) or Blind 75. Choose one when you sign the contract, or switch any time from the top of the study plan. She follows your list in order.
- **A solved problem counts everywhere**: Progress is tracked per problem, so a problem you solve in one list is checked off in every other list. Tokens depend only on the problem's difficulty, and each problem pays once no matter which list it is in.
- **Categories at a glance**: Each list is grouped by topic (Grind by week), with a progress bar per category, and you can choose where to start. Premium problems are labeled, and she never stops on one.
- **Milestones**: Finish a category and she celebrates with you; finish a whole list for her own line and an achievement. Full Curriculum section clears now give the same achievement and reaction instead of extra tokens.

### v2.5.0 (2026.10.22) — Story CGs Match the Characters, Plus Seven New Outfits
- **Story CGs now match the characters**: About 70 event CGs across all six heroines were redrawn from their standees, so outfits, hair and eye color match the girl you see every day. Rei, for one, now wears her shoulder-length bob in every CG. During a scene, her standee wears the same outfit as the CG.
- **Seven new outfits, earned through the story**: Koharu's duffle coat, Rei's off-shoulder grey knit, Yoru's black velvet knit and long wool coat, and Karen's wine-red silk blouse, camel coat and indigo yukata. Each one comes with its own debut conversation.
- **Two outfits redesigned**: Rei's silver-grey coat now goes over a white shirt and pencil skirt. Karen's imperial cape is now a burgundy blazer worn over the shoulders, with a cream silk blouse and black trousers.
- **LeetCode difficulty and trackable feedback**: Every problem in the study plan now shows LeetCode's official Easy, Medium or Hard tag. After you send feedback, you get a link to your post on Discord.

### v2.4.1 (2026.10.21) — Staged Story Climaxes, Redrawn CGs, Rin's Long Twin Tails & In-Game Feedback
- **Six story climaxes, newly staged**: Rin's night aquarium, Koharu's "A Question Without Code", Fuuka's "The Night She Bloomed", Yoru's "The Twelfth Bell", Rei's "One Hundred and Eight Bells", and Karen's "First Night by the River" now have scene music, sound effects, ambience, and camera moves. Turn off screen shake and flashes under Story Effects in Settings.
- **Six redrawn CGs and Rin's long twin tails**: Six key-scene CGs were redrawn from the character standees, so outfits and hair match the story. Rin now wears waist-length twin tails on every outfit, in the room and in the Extension.
- **New outfit for Rei, Snowy Shrine Coat & Fitted Knit Dress**: Finish "One Hundred and Eight Bells" to unlock Rei's New Year shrine outfit and its debut conversation.
- **In-game feedback**: A Feedback button now sits in the bottom-right corner of the title screen and the study room. Pick Bug or Feature Request, paste a screenshot, and send. We follow up on every report on Discord.

### v2.4.0 (2026.10.20) — Yoru, Rei & Karen Full Route Scenario Overhaul, Standee Polish & Voice Upgrade
- **Yoru, Rei & Karen Full Scenario Overhaul**: Rewrote main chapters, side stories, dates, and daily conversations for Yoru Kurokawa, Rei Kirisaki, and Karen Saionji into character-driven scenes with unified first-meeting pacing, authentic voice registers, and seamless route continuity.
- **New Date Scenes, Standee Refinements & Soft Smile Voices**: Added new Jimbocho Revival Cinema and Nikko Fireplace Lounge date backgrounds, refined eye and expression details across outfits, and recorded dedicated soft smile voice clips for all three heroines.
- **Problem-Specific Hints for All 2,044 Problems & Story Unlock Loop**: Upgraded all 2,044 curriculum problems with bespoke 4-step hints across 4 languages, and introduced Study Token chapter unlocks with account-shared solve milestones.

### v2.3.0 (2026.10.15) — Rin, Koharu & Fuuka Scenario Overhaul and Mobile Landscape Stage
- **Full Route Scenario & Character Polish**: Rewrote Rin Ayase, Koharu Minami, and Fuuka Hoshino side stories, mini events, and main transitions into relationship-driven scenes with unified settings, first-person voice, and session milestone tracking.
- **Soft Smile Voice Cues & Standee Eye Detail Fixes**: Added dedicated soft voice clips for warm smile expressions and repaired eye sclera transparency details across multiple outfits.
- **Mobile Landscape Stage & Audio Playback Support**: Added two-column mobile landscape stage mode, hardware-decoded mobile browser voice and BGM playback, and the in-room 4-step hint ladder.

### v2.2.0 (2026.10.12) — Dokicode Extension 2.2.0: 4-Step Hint Ladder & Simplified Chinese Support
- **4-Step Curated Hint Ladder**: Added Direction, Key Idea, Algorithm Outline with Time/Space Complexity, and Edge Cases across all 2,044 problems.
- **In-Page LeetCode Companion Voice & Poke Chats**: Added interactive multi-choice poke conversations, verdict voice reactions, and live outfit sync inside the extension.
- **Simplified Chinese Locale Support**: Full 4-locale switching (English, Traditional Chinese, Simplified Chinese, and Japanese) across all stories, hints, and UI.

### v2.1.0 (2026.10.08) — New Heroine Wardrobe Expansion (Loungewear, Date Outfits & Summer Yukata/Swimsuits)
- **19 New Heroine Outfits & Debut Dialogues**: Added R3 loungewear, date-unlocked outfits, and R4 summer yukata/swimsuits with dedicated first-time outfit debut conversations.
- **Late-Night Loungewear Auto-Change**: Heroines automatically change into owned loungewear during late-night study sessions (configurable in Settings).