LeetCode Top 100 Liked is a free, official study plan on leetcode.com that LeetCode describes as the “100 most liked problems by LeetCoders,” grouped into 15 topic sections. The mix is 20 easy, 68 medium and 12 hard, and 73 of the 100 problems also appear in NeetCode 150. It is worth doing if you want a medium-heavy set of well-known problems with no Premium paywall, but it is thin on graphs, intervals and bit manipulation, so budget another 15 to 20 problems in those areas before a big-tech loop.
We pulled the plan's problem list from LeetCode in October 2026 and compared it with the original Blind 75 post, NeetCode's published NeetCode 150 list, and LeetCode's own LeetCode 75 and Top Interview 150 plans. Every count below comes from that comparison. LeetCode can revise its plans, so check the plan page before you rely on a specific problem being there.
What the Top 100 Liked plan is
Top 100 Liked lives at leetcode.com/studyplan/top-100-liked, alongside LeetCode's other official plans such as LeetCode 75 and Top Interview 150. A few things are worth knowing before you start:
- It is free. The plan is not marked Premium-only, and none of its 100 problems is flagged as paid-only. Blind 75, by contrast, includes six problems that the original post marks as Premium.
- Treat it as a fixed list. The name describes how the problems were picked; LeetCode does not say whether or how often it refreshes the selection. What you actually work through is the list of 100 shown on the plan page, with LeetCode's progress tracking and a badge when you finish.
- It is grouped by topic. Fifteen sections, ranging from a single problem (Trie) to fifteen (Dynamic Programming).
- The section labels have quirks. “Misc” holds ten problems that are mostly array techniques, including Maximum Subarray, Merge Intervals and Product of Array Except Self. Binary Tree Maximum Path Sum (#124) sits in the Binary Search section even though it is a tree recursion problem.
The 15 sections at a glance
| Section | Problems | Easy / Med / Hard | Examples |
|---|---|---|---|
| Hashing | 4 | 1 / 3 / 0 | Two Sum, Group Anagrams, Longest Consecutive Sequence, Subarray Sum Equals K |
| Two Pointers | 4 | 1 / 2 / 1 | Move Zeroes, 3Sum, Container With Most Water, Trapping Rain Water |
| Sliding Window | 4 | 0 / 2 / 2 | Longest Substring Without Repeating Characters, Minimum Window Substring |
| Misc | 10 | 2 / 7 / 1 | Maximum Subarray, Merge Intervals, Next Permutation, First Missing Positive |
| Matrix | 4 | 0 / 4 / 0 | Rotate Image, Spiral Matrix, Set Matrix Zeroes |
| Stack | 5 | 1 / 3 / 1 | Valid Parentheses, Daily Temperatures, Largest Rectangle in Histogram |
| Linked Lists | 14 | 5 / 7 / 2 | Reverse Linked List, LRU Cache, Merge k Sorted Lists, Reverse Nodes in k-Group |
| Binary Search | 7 | 1 / 4 / 2 | Search in Rotated Sorted Array, Median of Two Sorted Arrays |
| Binary Tree | 14 | 6 / 8 / 0 | Validate Binary Search Tree, Lowest Common Ancestor of a Binary Tree, Path Sum III |
| Trie | 1 | 0 / 1 / 0 | Implement Trie (Prefix Tree) |
| Graph | 3 | 0 / 3 / 0 | Number of Islands, Course Schedule, Rotting Oranges |
| Heap | 3 | 0 / 2 / 1 | Kth Largest Element in an Array, Top K Frequent Elements, Find Median from Data Stream |
| Greedy | 4 | 1 / 3 / 0 | Best Time to Buy and Sell Stock, Jump Game, Partition Labels |
| Backtracking | 8 | 0 / 7 / 1 | Subsets, Permutations, Word Search, N-Queens |
| Dynamic Programming | 15 | 2 / 12 / 1 | Coin Change, Word Break, Edit Distance, Longest Common Subsequence |
Two things stand out. Linked lists and binary trees account for 28 problems, more than a quarter of the plan. Graphs, tries and heaps together get seven. If the companies on your list like graph questions, this plan alone will not get you there.
Difficulty mix compared with other lists
| List | Size | Easy | Medium | Hard |
|---|---|---|---|---|
| Top 100 Liked | 100 | 20 | 68 | 12 |
| Blind 75 (NeetCode's version) | 75 | 19 | 49 | 7 |
| NeetCode 150 | 150 | 28 | 101 | 21 |
| LeetCode 75 | 75 | 22 | 53 | 0 |
| Top Interview 150 | 150 | 39 | 93 | 18 |
Difficulty labels are LeetCode's; for the two NeetCode lists we used NeetCode's tags, which matched LeetCode's on every problem we cross-checked. In proportion, Top 100 Liked is about as demanding as NeetCode 150 (68% vs. 67% medium, 12% vs. 14% hard) and clearly harder than LeetCode 75, which has no hard problems at all. Ten of its 12 hards also appear in NeetCode 150, including Trapping Rain Water, Median of Two Sorted Arrays, Merge k Sorted Lists and Largest Rectangle in Histogram. The other two, Longest Valid Parentheses and First Missing Positive, are in neither NeetCode 150 nor Blind 75.
How much it overlaps with Blind 75 and NeetCode 150
| Other list | Shared with Top 100 Liked | New to you if you finished that list |
|---|---|---|
| NeetCode 150 | 73 | 27 |
| Top Interview 150 | 67 | 33 |
| Blind 75 (original post) | 45 | 55 |
| LeetCode 75 | 19 | 81 |
The Blind 75 figure is 46 if you use NeetCode's version of that list, which swaps the original post's Combination Sum IV link for Combination Sum.
The practical read: if you have already finished NeetCode 150, do not start Top 100 Liked from the top. Pick out the 27 problems you have not seen and do only those. If you finished Blind 75, more than half of the plan is new to you, so the full run is a reasonable next step. LeetCode 75 and Top 100 Liked share so little that they work as a natural sequence.
What only Top 100 Liked gives you
Fourteen problems in the plan appear in none of the four lists above:
- Arrays and hashing: Subarray Sum Equals K, Next Permutation, Sort Colors, First Missing Positive, Search a 2D Matrix II
- Sliding window: Find All Anagrams in a String
- Linked lists: Swap Nodes in Pairs, Linked List Cycle II, Intersection of Two Linked Lists, Palindrome Linked List
- Trees: Binary Tree Inorder Traversal
- Dynamic programming: Pascal's Triangle, Perfect Squares, Longest Valid Parentheses
Several of these teach a technique the other lists only brush past. Subarray Sum Equals K is the standard prefix-sum-plus-hash-map problem for arrays with negative numbers. First Missing Positive uses the array itself as a hash table. Sort Colors is the three-pointer Dutch national flag partition, and Linked List Cycle II extends Floyd's cycle detection to find where the cycle begins.
Where the plan is thin
Measured against NeetCode 150's topic groups, the gaps are concentrated in a handful of areas:
| Topic | NeetCode 150 problems covered | Notable missing problems |
|---|---|---|
| Graphs (incl. advanced) | 3 of 19 | Clone Graph, Pacific Atlantic Water Flow, Course Schedule II, Word Ladder, Network Delay Time |
| Intervals | 1 of 6 | Insert Interval, Non-overlapping Intervals, Meeting Rooms II |
| Bit manipulation | 1 of 7 | Number of 1 Bits, Counting Bits, Missing Number |
| 2-D dynamic programming | 3 of 11 | Coin Change II, Target Sum, Longest Increasing Path in a Matrix |
| Heap / priority queue | 2 of 7 | K Closest Points to Origin, Task Scheduler |
Because the plan has no Premium problems, it also skips the Premium classics in Blind 75, such as Meeting Rooms, Alien Dictionary and Graph Valid Tree. That keeps it free, but those problems cover ideas (interval scheduling, ordering with dependencies, connectivity checks) that the free list barely touches.
A four-week plan to work it
At about four new problems a day, six days a week, the plan takes four weeks, with the seventh day kept for re-solving anything you failed. The order below groups related skills and saves the two recursion-heavy sections for last:
| Week | Sections | New problems |
|---|---|---|
| Week 1 | Hashing (4), Two Pointers (4), Sliding Window (4), Misc (10), Matrix (4) | 26 |
| Week 2 | Stack (5), Linked Lists (14), Binary Search without #124 (6) | 25 |
| Week 3 | Binary Tree (14) plus #124, Trie (1), Graph (3), Heap (3), Greedy (4) | 26 |
| Week 4 | Backtracking (8), Dynamic Programming (15) | 23 |
Misc goes in week 1 because it is mostly array technique, and Binary Tree Maximum Path Sum moves to week 3 so you solve it with the other tree problems. If you only have two weeks, do the 45 problems shared with Blind 75 first, then as many of the remaining mediums as time allows.
Time-box every attempt. Give a new medium 25 to 30 minutes. If you are stuck, read the editorial, close it, write the solution from memory, and put the problem on tomorrow's re-solve list. A problem only counts as done when you can solve it from a blank editor a week later.
What to add after you finish
Close the gaps with a patch set of about 17 problems, one to two weeks of work:
- Graphs (6): Clone Graph, Pacific Atlantic Water Flow, Course Schedule II, Redundant Connection, Word Ladder, Network Delay Time. Our graph algorithms guide covers the BFS, DFS, topological sort and union-find templates most of these rely on.
- Intervals (3): Insert Interval, Non-overlapping Intervals, Meeting Rooms II (a Premium problem).
- Bit manipulation (3): Number of 1 Bits, Counting Bits, Missing Number.
- 2-D dynamic programming (3): Coin Change II, Target Sum, Longest Increasing Path in a Matrix.
- Heap (2): K Closest Points to Origin, Task Scheduler.
After that, switch to company-tagged problems for the companies you are actually interviewing with rather than starting another general list.
When to choose it over other lists
| Your situation | Best fit | Why |
|---|---|---|
| New to data structures | LeetCode 75 | Official plan with no hard problems |
| Less than three weeks | Blind 75 or Grind 75 | Short lists with broad coverage; Grind 75 is a customizable list by the author of Blind 75 |
| Four to six weeks, comfortable with easies | Top 100 Liked plus the patch set | Free, official, medium-heavy |
| Want every topic covered, with videos | NeetCode 150 | 19 graph problems, and NeetCode publishes a video walkthrough for each of the 150 |
| Want broad official coverage | Top Interview 150 | 23 sections, including Intervals, Bit Manipulation and Math |
| Already finished NeetCode 150 | Top 100 Liked, new problems only | 27 problems you have not seen |
If you are deciding between Top 100 Liked and LeetCode's larger Top Interview 150 plan, our Top Interview 150 guide covers that one in detail. The short version: Top 100 Liked is a good list, not a complete one. It is free, official and full of problems people found worth solving. But it was picked by popularity rather than coverage, so it leans heavily on linked lists and trees and goes light on graphs.
How to get the most out of it
- Batch by section. Doing all four sliding-window problems in one sitting teaches the pattern faster than spreading them across a week.
- Keep a one-line pattern log. For each problem, write the trigger and the technique: “subarray sum equals target, negatives allowed → prefix sum plus a hash map of counts.”
- Re-solve on a schedule. Day 1, day 3, day 10. Anything you fail goes back to the front of the queue.
- State the complexity before you code. Say the time and space cost out loud first; interviewers commonly ask for it, and saying it early catches a slow approach before you build it.
- Practice talking while you solve. Solving in silence and explaining while you solve are different skills. In your last week, run a few timed sessions out loud. A free AI mock interview in CoPilot Interview can read coding and technical questions aloud, listen to your spoken answer, and score it with what worked and what to improve.
Practice explaining your solutions out loud
Paste a job description and your résumé, pick a coding and technical mix, and an AI interviewer builds questions from your résumé, reads them aloud and scores each spoken answer with what worked and what to improve. The free plan gives you 15 minutes a day with no credit card.
Try a free AI mock interviewFAQ
What is LeetCode Top 100 Liked?
It is an official, free study plan on leetcode.com that LeetCode describes as the 100 most liked problems by its users. The problems are grouped into 15 topic sections, with 20 easy, 68 medium and 12 hard problems.
Is LeetCode Top 100 Liked free?
Yes. As of October 2026 the plan is not Premium-only and none of its 100 problems is marked as paid-only, so you can complete it on a free account.
How much does Top 100 Liked overlap with Blind 75 and NeetCode 150?
45 of its 100 problems appear in the original Blind 75 list and 73 appear in NeetCode 150. If you have already finished NeetCode 150, only 27 problems in Top 100 Liked will be new to you.
Should I do Top 100 Liked or NeetCode 150?
Pick NeetCode 150 if you want full topic coverage, especially graphs, intervals and bit manipulation. Pick Top 100 Liked if you want a free official plan with progress tracking on LeetCode, then add about 17 graph, interval, bit manipulation, DP and heap problems to close its gaps.
How long does Top 100 Liked take?
At about four new problems a day, six days a week, with one day for re-solves, the plan takes about four weeks. Add one to two weeks if you also do a patch set for graphs, intervals and bit manipulation.
Is Top 100 Liked enough for a FAANG interview?
On its own it is light on graphs, intervals and bit manipulation, which big-tech coding rounds can cover. Pair it with a short patch set in those topics and company-tagged practice for the companies you are interviewing with.