Loading repovive.com/roadmaps/pattern-22
Roadmaps
Pattern 22: LeetCode Interview Patterns
Linked List
Problemset
Discussion
AI Helper
Getting Started
0/5
Hash Map Patterns
0/33
Two Pointers
0/31
Sliding Window
0/33
Prefix Sum
0/32
Binary Search
0/33
Linked List
0/29
1
What is Linked List
2
Prerequisites
3
When to Use
4
When NOT to Use
5
LeetCode 206 Reverse Linked List - Problem Statement
6
LeetCode 206 Reverse Linked List - Solution
7
LeetCode 206 Reverse Linked List - Example and Complexity Analysis
8
LeetCode 206 Reverse Linked List - Implementation
9
LeetCode 141 Linked List Cycle - Problem Statement
10
Quiz: Cycle Detection Technique
11
LeetCode 141 Linked List Cycle - Solution
12
LeetCode 141 Linked List Cycle - Example and Complexity Analysis
13
LeetCode 141 Linked List Cycle - Implementation
14
LeetCode 19 Remove Nth Node From End - Problem Statement
15
Quiz: Finding Nth From End
16
LeetCode 19 Remove Nth Node From End - Solution
17
LeetCode 19 Remove Nth Node From End - Example and Complexity Analysis
18
LeetCode 19 Remove Nth Node From End - Implementation
19
LeetCode 143 Reorder List - Problem Statement
20
LeetCode 143 Reorder List - Solution
21
LeetCode 143 Reorder List - Example and Complexity Analysis
22
LeetCode 143 Reorder List - Implementation
23
LeetCode 23 Merge K Sorted Lists - Problem Statement
24
LeetCode 23 Merge K Sorted Lists - Why Naive Fails
25
LeetCode 23 Merge K Sorted Lists - Solution
26
LeetCode 23 Merge K Sorted Lists - Example and Complexity Analysis
27
LeetCode 23 Merge K Sorted Lists - Implementation
28
Common Mistakes
29
Section Recap
Stack Patterns
0/31
Monotonic Stack
0/32
Heap / Priority Queue
0/32
Trees
0/31
Trie
0/32
Backtracking
0/34
Graphs - BFS
0/32
Graphs - DFS
0/36
Topological Sort
0/32
Union Find
0/40
Dynamic Programming - 1D
0/36
Dynamic Programming - 2D
0/32
Intervals
0/31
Greedy
0/40
Bit Manipulation
0/34
Segment Tree
0/27
30-Day LeetCode Study Plan
0/8
7.1
What is Linked List
2 minutes
100%
Tasks
Read Unit