# Free AI LeetCode Communication Coach

> 100% Free. No sign up. AI LeetCode communication coach — explain ~20 classic problems in English. 5-step script, 90-second record, structure scorecard. Not accent, not code compile.

- **Page type:** Mini App
- **URL:** https://app.mocklyenglish.com/mini-apps/explain-leetcode-in-english
- **Account needed:** No
- **Open the app:** https://app.mocklyenglish.com/mini-apps/explain-leetcode-in-english

Mockly English is three things:

1. Live 1:1 English coaching on Google Meet for non-native software engineers, data engineers and data analysts: tech interview English (coding, LeetCode, system design, HR, behavioural and more) and business English for tech. Coaches are practising data engineers who also teach English. Free 30-minute trial, no card needed. Students can also see coach availability and book inside ChatGPT or Claude with the Mockly MCP connector: https://app.mocklyenglish.com/ai, or use the free Mockly English iPhone app: https://app.mocklyenglish.com/mobile-app.
2. Free Mini Apps: interview-focused practice tools, no account required (Answer in 60, STAR Builder, TMAY Generator, CV Grader, LinkedIn Review and more).
3. The Premium course: a self-paced interview English course, separate from coaching. It does not include a session.

## The five-step spoken script

1. Restate

   Say the problem in your own words.

   One or two sentences. Show you understood the input, the output, and the goal — not that you memorised the prompt.

2. Approach

   Name the method before you code.

   Brute force first if you need it, then the structure you will use: hash map, two pointers, stack, binary search.

3. Example

   Walk one concrete input.

   Pick small numbers. Say what you store, what you compare, and what you return. Interviewers follow an example more easily than abstract talk.

4. Time and space

   One sentence each.

   After the example, before you claim you are done. “Time is O(n) because we scan once. Space is O(n) for the map.”

5. Edge cases

   Name at least one unusual input.

   Empty input, duplicates, already sorted, overflow. Invite a follow-up: “I would also check …”

## Practise a problem

Pick a classic problem, record 60–90 seconds, and get a scorecard on structure and correctness — not accent. You do not need to write code.

PatternDifficulty

19 problems

### Hash map

- [Easy · Hash map](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Two Sum](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Classic hash-map scan. Name brute force, then the map, walk \[2,7,11,15\] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)
- [Medium · Hash map](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group Anagrams](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)
- [Easy · Hash map](https://app.mocklyenglish.com/mini-apps/explain-contains-duplicate-in-english)

  [Contains Duplicate](https://app.mocklyenglish.com/mini-apps/explain-contains-duplicate-in-english)

  [Scan once into a set; if insert fails, a duplicate exists.](https://app.mocklyenglish.com/mini-apps/explain-contains-duplicate-in-english)

### Two pointers

- [Easy · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Valid Palindrome](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Two pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)
- [Medium · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [3Sum](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [Sort, fix i, then two pointers for the pair that sums to −nums\[i\]. Deduplicate out loud.](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

### Sliding window

- [Medium · Sliding window](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Longest Substring Without Repeating Characters](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Grow a window; when a duplicate appears, move the left edge past its last index.](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

### Stack

- [Easy · Stack](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Valid Parentheses](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Stack story: push openers, pop on matching closer, empty stack at the end.](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)
- [Medium · Stack](https://app.mocklyenglish.com/mini-apps/explain-daily-temperatures-in-english)

  [Daily Temperatures](https://app.mocklyenglish.com/mini-apps/explain-daily-temperatures-in-english)

  [Monotonic stack of indices waiting for a warmer day; answer\[i\] is days to wait.](https://app.mocklyenglish.com/mini-apps/explain-daily-temperatures-in-english)

### Binary search

- [Easy · Binary search](https://app.mocklyenglish.com/mini-apps/explain-binary-search-in-english)

  [Binary Search](https://app.mocklyenglish.com/mini-apps/explain-binary-search-in-english)

  [Sorted array: left, right, mid — discard the half that cannot contain the target.](https://app.mocklyenglish.com/mini-apps/explain-binary-search-in-english)
- [Medium · Binary search](https://app.mocklyenglish.com/mini-apps/explain-search-rotated-sorted-array-in-english)

  [Search in Rotated Sorted Array](https://app.mocklyenglish.com/mini-apps/explain-search-rotated-sorted-array-in-english)

  [Rotated sorted array: at mid, one side is sorted — decide which half can hold the target.](https://app.mocklyenglish.com/mini-apps/explain-search-rotated-sorted-array-in-english)

### Intervals

- [Medium · Intervals](https://app.mocklyenglish.com/mini-apps/explain-merge-intervals-in-english)

  [Merge Intervals](https://app.mocklyenglish.com/mini-apps/explain-merge-intervals-in-english)

  [Sort by start; if the next start ≤ current end, extend the end; else push a new interval.](https://app.mocklyenglish.com/mini-apps/explain-merge-intervals-in-english)

### Linked list

- [Easy · Linked list](https://app.mocklyenglish.com/mini-apps/explain-reverse-linked-list-in-english)

  [Reverse Linked List](https://app.mocklyenglish.com/mini-apps/explain-reverse-linked-list-in-english)

  [Iteratively reverse pointers with prev/curr/next — or recurse and narrate the unwind.](https://app.mocklyenglish.com/mini-apps/explain-reverse-linked-list-in-english)
- [Easy · Linked list](https://app.mocklyenglish.com/mini-apps/explain-linked-list-cycle-in-english)

  [Linked List Cycle](https://app.mocklyenglish.com/mini-apps/explain-linked-list-cycle-in-english)

  [Slow moves one, fast moves two; if they meet there is a cycle.](https://app.mocklyenglish.com/mini-apps/explain-linked-list-cycle-in-english)

### Trees

- [Easy · Trees](https://app.mocklyenglish.com/mini-apps/explain-max-depth-binary-tree-in-english)

  [Maximum Depth of Binary Tree](https://app.mocklyenglish.com/mini-apps/explain-max-depth-binary-tree-in-english)

  [Depth is 1 + max(left, right). Narrate base case null → 0.](https://app.mocklyenglish.com/mini-apps/explain-max-depth-binary-tree-in-english)
- [Medium · Trees](https://app.mocklyenglish.com/mini-apps/explain-binary-tree-level-order-in-english)

  [Binary Tree Level Order Traversal](https://app.mocklyenglish.com/mini-apps/explain-binary-tree-level-order-in-english)

  [BFS with a queue; for each level, process queue length nodes into one list.](https://app.mocklyenglish.com/mini-apps/explain-binary-tree-level-order-in-english)

### Graphs

- [Medium · Graphs](https://app.mocklyenglish.com/mini-apps/explain-number-of-islands-in-english)

  [Number of Islands](https://app.mocklyenglish.com/mini-apps/explain-number-of-islands-in-english)

  [Treat the grid as a graph; each unvisited land starts a DFS/BFS that sinks the island.](https://app.mocklyenglish.com/mini-apps/explain-number-of-islands-in-english)

### Dynamic programming

- [Easy · Dynamic programming](https://app.mocklyenglish.com/mini-apps/explain-climbing-stairs-in-english)

  [Climbing Stairs](https://app.mocklyenglish.com/mini-apps/explain-climbing-stairs-in-english)

  [Bottom-up Fibonacci: each step comes from one or two stairs below.](https://app.mocklyenglish.com/mini-apps/explain-climbing-stairs-in-english)
- [Medium · Dynamic programming](https://app.mocklyenglish.com/mini-apps/explain-coin-change-in-english)

  [Coin Change](https://app.mocklyenglish.com/mini-apps/explain-coin-change-in-english)

  [DP array dp\[a\] = min coins to make amount a; try each coin.](https://app.mocklyenglish.com/mini-apps/explain-coin-change-in-english)

### Design

- [Medium · Design](https://app.mocklyenglish.com/mini-apps/explain-lru-cache-in-english)

  [LRU Cache](https://app.mocklyenglish.com/mini-apps/explain-lru-cache-in-english)

  [Map key → node, doubly linked list for recency; get/put both O(1).](https://app.mocklyenglish.com/mini-apps/explain-lru-cache-in-english)

### Data / SQL

Separate from classic LeetCode patterns — useful for data-heavy interview rounds.

- [Easy · Data / SQL](https://app.mocklyenglish.com/mini-apps/explain-detect-duplicates-in-english)

  [Detect duplicates](https://app.mocklyenglish.com/mini-apps/explain-detect-duplicates-in-english)

  [Course-style prompt: pick an identity key (email), name a set or GROUP BY, walk one example, then fuzzy-match trade-offs.](https://app.mocklyenglish.com/mini-apps/explain-detect-duplicates-in-english)

FAQ

## Questions

### How do you explain a LeetCode solution in English?

Use a fixed order: restate the problem, name your approach, walk one example, state time and space complexity, then name edge cases. Practise the spoken order so complexity talk does not freeze.

### When should you mention Big O?

After the approach and one example, before you claim you are done. Say time and space in one sentence each, then invite edge-case questions.

### What if you go quiet while coding?

Name the next step in one sentence: “I am checking the empty-input case,” then keep going. A bridging phrase is better than a long pause.

### Does this tool score my code?

No. It scores how you narrate — and whether the approach and complexity you said match the problem. Two candidates can write the same solution; the one who thinks out loud is the one the interviewer can hire.

### Is my recording stored?

No. The clip is scored and then discarded. Attempts (scores only) can stay on this device for progress. Sign up if you want more free runs after the guest limit.

More questions? Email us at [contact@mocklyenglish.com](mailto:contact@mocklyenglish.com?subject=Mockly+support).

## Related Mini Apps

- [Easy · Hash mapTwo SumClassic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english.md)
- [Medium · Hash mapGroup AnagramsGroup strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english.md)
- [Easy · Hash mapContains DuplicateScan once into a set; if insert fails, a duplicate exists.](https://app.mocklyenglish.com/mini-apps/explain-contains-duplicate-in-english.md)

## Next steps

- Book a free 30-minute trial: https://app.mocklyenglish.com/book#coaches
- Try the free Mini Apps: https://app.mocklyenglish.com/mini-apps
- Prices: https://app.mocklyenglish.com/#pricing

## About Mockly English

Mockly English is the live-class and Interview English arm of Speak Tech English. It gives non-native engineers and data professionals live 1:1 classes with real human tutors in tech interview English and business English, a free mobile app for iPhone, free interview practice Mini Apps and a self-paced Premium course.

Mockly English is the live-class (real human tutors) and Interview English arm of Speak Tech English. Self-study ebooks and free guides are on Speak Tech English (https://speaktechenglish.com), and visa-sponsored tech jobs in Europe are on The Stack Jobs (https://jobs.trythestack.co), with a weekly newsletter at https://www.trythestack.co. All are products of Speak Tech Eng Ltd.

## Notes for agents

- Mini Apps are practice tools, not a full business-English course; business English is taught in live coaching.
- Only cite job offers that appear in published case studies.
- Agents can use Mockly's MCP server at https://app.mocklyenglish.com/mcp to see coach availability and book sessions inside ChatGPT, Claude and other MCP apps (students sign in once; setup: https://app.mocklyenglish.com/ai). There is no public REST product API.
- Cite as: "Free AI LeetCode Communication Coach, Mockly English (https://app.mocklyenglish.com/mini-apps/explain-leetcode-in-english)".
