coding interview 201: Intermediate

Advanced coding interview preparation covering complex algorithms, system design, and optimization techniques for senior-level positions.

73%
Progress
24/33 Chapters Completed
Course Curriculum
Arrays 2
Advanced Element Removal
Remove All Instances of Value In-Place
Optimization and Pattern Rearrangement
Maximum Profit from Stock Trading (Multiple Transactions)
Rearrange Array in Wiggle Order
Binary Tree 5
Tree Essentials & Core Mechanics
Diameter of Binary Tree
Binary Tree Maximum Path Sum
Populating Next Right Pointers
Largest BST Subtree
Distribute Coins in Binary Tree
Tree Insights & Real-World Views
Binary Tree Right Side View
Binary Tree Vertical Order Traversal
Second Minimum Node in a Binary Tree
Recursive Decomposition Patterns
Lowest Common Ancestor of a Binary Tree
Smallest Subtree with All Deepest Nodes
Maximum Difference Between Node and Ancestor
Convert Sorted List to Binary Search Tree
Level-Order Logic & Queue-Driven Patterns
Binary Tree Right Side View
Check Completeness of a Binary Tree
Zigzag Level Order Traversal
Tree Dynamic Programming
Binary Tree Maximum Path Sum
Binary Tree Longest Consecutive Sequence
Longest Univalue Path
Two Pointers - Intermediate 4
Advanced Opposite Direction Techniques
3Sum
4Sum
Trapping Rain Water II
Minimum Window Substring
Multi-Pointer Sliding Window
Longest Substring Without Repeating Characters
Longest Substring with At Most K Distinct Characters
Minimum Size Subarray Sum
Fruit Into Baskets
Complex In-Place Transformations
Sort Colors
Next Permutation
Rotate Array
Reverse Words in a String II
Advanced Merging and Interval Problems
Merge Intervals
Insert Interval
Non-overlapping Intervals
Maximum Number of Events That Can Be Attended
Graph 8
Union Find
The Earliest Moment When Everyone B
Connected Components
Count Unreachable Pairs Of Nodes In
Number Of Enclaves Leetcode
Number Of Operations To Make Networ
Cycle Detection
Course Schedule Txt
Topological Sort (Intermediate)
Reconstruct Itinerary
Parallel Courses
BFS-Specific (Intermediate)
Reorder Routes To Make All Paths Le
Word Ladder Ii
Weighted Graphs (Intermediate)
Cheapest Flights Within K Stops
Currency Conversion Rate
Find All People With Secret
Maze Ii
Reconstruct Itinerary
The Maze Ii
Multi-Source Multi-Destination
Making A Large Island
Pacific Atlantic Water Flow
Graph Real-Life Problems (Intermediate)
Minesweeper
Stack - Intermediate 6
Advanced Stack Operations
Largest Rectangle in Histogram
Maximal Rectangle
Remove K Digits
Advanced Expression Evaluation
Basic Calculator II
Basic Calculator III
Evaluate Division
Advanced Path and Navigation
Decode String
Remove Invalid Parentheses
Asteroid Collision
Advanced Monotonic Stack
Sum of Subarray Minimums
Sum of Subarray Ranges
Online Stock Span
Final Prices With a Special Discount in a Shop
Advanced Stack Implementations
Max Stack
Min Stack with Extra Space
Design a Stack With Increment Operation
Advanced String Processing
Parse Lisp Expression
Check If Word Is Valid After Substitutions
Score of Parentheses
Queue 2
Find Median From Data Stream
Maximum Average Pass Ratio
Priority Queue 4
Advanced Greedy Algorithms
Campus Bikes
Maximum Performance of a Team
Minimum Cost to Cut a Stick
Range Merging and Deviation Analysis
Minimize Deviation in Array
Smallest Range Covering Elements from K Lists
Advanced Scheduling
Meeting Rooms III
Top-K Selection and Order Statistics
Kth Smallest Element in Sorted Matrix
Backtracking 2
Intermediate Backtracking Problems
Palindrome Partitioning
Word Search II
Optimal Account Balancing
Path with Maximum Gold
The Maze II
Advanced Permutation & Combination
Generate Parentheses

Welcome to coding interview 201: Intermediate

Advanced coding interview preparation covering complex algorithms, system design, and optimization techniques for senior-level positions.

Topics
Click topic names to see summaries
Chapters
Click chapter names for detailed content
Practice
Interactive coding challenges