Interactive LeetCode Problems: All 21, With Python Solutions
Every problem in this library that LeetCode tags Interactive — 21 in total, 4 of them with a complete Python solution, a worked example and the time and space complexity of the approach.
- 21 problems
- 4 Easy
- 12 Medium
- 5 Hard
Interactive problems by difficulty
Problems with a complete Python solution are listed first, then by ascending problem number.
Easy (4)
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 278 | First Bad Version | Easy | Binary Search, Interactive |
| 374 | Guess Number Higher or Lower | Easy | Binary Search, Interactive |
| 157 | Read N Characters Given Read4Premium | Easy | Array, Interactive, Simulation |
| 2728 | Count Houses in a Circular StreetPremium | Easy | Array, Interactive |
Medium (12)
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1237 | Find Positive Integer Solution for a Given Equation | Medium | Math, Two Pointers, Binary Search +1 |
| 277 | Find the CelebrityPremium | Medium | Graph, Two Pointers, Interactive |
| 702 | Search in a Sorted Array of Unknown SizePremium | Medium | Array, Binary Search, Interactive |
| 1236 | Web CrawlerPremium | Medium | Depth-First Search, Breadth-First Search, String +1 |
| 1428 | Leftmost Column with at Least a OnePremium | Medium | Array, Binary Search, Interactive +1 |
| 1533 | Find the Index of the Large IntegerPremium | Medium | Array, Binary Search, Interactive |
| 1538 | Guess the Majority in a Hidden ArrayPremium | Medium | Array, Math, Interactive |
| 1618 | Maximum Font to Fit a Sentence in a ScreenPremium | Medium | Array, String, Binary Search +1 |
| 1778 | Shortest Path in a Hidden GridPremium | Medium | Depth-First Search, Breadth-First Search, Array +2 |
| 1810 | Minimum Path Cost in a Hidden GridPremium | Medium | Depth-First Search, Breadth-First Search, Graph +5 |
| 2782 | Number of Unique CategoriesPremium | Medium | Union Find, Counting, Interactive |
| 2936 | Number of Equal Numbers BlocksPremium | Medium | Array, Binary Search, Interactive |
Hard (5)
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1095 | Find in Mountain Array | Hard | Array, Binary Search, Interactive |
| 158 | Read N Characters Given read4 II - Call Multiple TimesPremium | Hard | Array, Interactive, Simulation |
| 489 | Robot Room CleanerPremium | Hard | Backtracking, Interactive |
| 843 | Guess the Word | Hard | Array, Math, String +2 |
| 1274 | Number of Ships in a RectanglePremium | Hard | Array, Divide and Conquer, Interactive |
Keep exploring
All LeetCode topicsEvery tag with a page of its own, with the number of problems behind each.LeetCode patternsThe techniques themselves, with a Python template and complexity for each.Curated study listsBlind 75, NeetCode 150 and three more, grouped by pattern.Easy problemsStart here when the data structure is new rather than the problem.
Other topics
- Array1,569
- String672
- Hash Table588
- Math485
- Dynamic Programming481
- Sorting392
- Greedy346
- Depth-First Search289
- Binary Search253
- Database249
- Tree225
- Breadth-First Search223
- Matrix216
- Two Pointers201
- Bit Manipulation194
- Binary Tree174
- Heap (Priority Queue)163
- Prefix Sum157
- Stack157
- Simulation144
- Graph138
- Counting126
- Design122
- Sliding Window116
When the Interactive problem arrives live
Stealth Interview is a desktop app for macOS and Windows. It reads the coding problem off your screen, returns a working solution with a step-by-step explanation and its time and space complexity, and transcribes what the interviewer is saying — while staying invisible to screen sharing.