FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
25
With Videos
0
Easy
25
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
82. Remove Duplicates from Sorted List II
MediumLinked ListTwo Pointers
Watch Solutions52.2% acceptance
90. Subsets II
MediumArrayBacktrackingBit Manipulation
Watch Solutions61.7% acceptance
91. Decode Ways
MediumDynamic ProgrammingString
Watch Solutions38.3% acceptance
92. Reverse Linked List II
MediumLinked List
Watch Solutions52.4% acceptance
97. Interleaving String
MediumDynamic ProgrammingString
Watch Solutions44.4% acceptance
98. Validate Binary Search Tree
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions36.1% acceptance
105. Construct Binary Tree from Preorder and Inorder Traversal
MediumArrayBinary TreeDivide and Conquer
Watch Solutions69.1% acceptance
113. Path Sum II
MediumBacktrackingBinary TreeDepth-First Search
Watch Solutions62.6% acceptance
114. Flatten Binary Tree to Linked List
MediumBinary TreeDepth-First SearchLinked List
Watch Solutions71.0% acceptance
117. Populating Next Right Pointers in Each Node II
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions57.9% acceptance
120. Triangle
MediumArrayDynamic Programming
Watch Solutions59.9% acceptance
122. Best Time to Buy and Sell Stock II
MediumArrayDynamic ProgrammingGreedy
Watch Solutions71.4% acceptance
128. Longest Consecutive Sequence
MediumArrayHash TableUnion Find
Watch Solutions47.0% acceptance
131. Palindrome Partitioning
MediumBacktrackingDynamic ProgrammingString
Watch Solutions74.4% acceptance
134. Gas Station
MediumArrayGreedy
Watch Solutions48.4% acceptance
137. Single Number II
MediumArrayBit Manipulation
Watch Solutions67.4% acceptance
138. Copy List with Random Pointer
MediumHash TableLinked List
Watch Solutions63.2% acceptance
139. Word Break
MediumArrayDynamic ProgrammingHash Table
Watch Solutions49.8% acceptance
146. LRU Cache
MediumDesignDoubly-Linked ListHash Table
Watch Solutions47.6% acceptance
147. Insertion Sort List
MediumLinked ListSorting
Watch Solutions59.9% acceptance
152. Maximum Product Subarray
MediumArrayDynamic Programming
Watch Solutions36.7% acceptance
156. Binary Tree Upside Down
MediumBinary TreeDepth-First SearchTree
Watch Solutions65.4% acceptance
159. Longest Substring with At Most Two Distinct Characters
MediumHash TableSliding WindowString
Watch Solutions57.0% acceptance
161. One Edit Distance
MediumStringTwo Pointers
Watch Solutions34.4% acceptance
162. Find Peak Element
MediumArrayBinary Search
Watch Solutions46.8% acceptance
Learn DSA with Video Solutions
Video solutions provide a visual, step-by-step approach to understanding Data Structures and Algorithms problems. Watching an expert walk through the thought process, from brute force to optimal solution, helps build the intuition needed for coding interviews.
How to Use Video Solutions Effectively
- Try the problem first: Spend at least 20-30 minutes attempting the problem before watching the video
- Pause and think: When the video mentions a key insight, pause and try to work through it yourself
- Code along: After understanding the approach, implement the solution on your own
- Review text solutions: Combine video walkthroughs with detailed text explanations for deeper understanding
Video Solutions by Difficulty
Start with Easy problems to build confidence and learn fundamental patterns. Progress to Medium problems where most interview questions fall. Hard problems help you prepare for the toughest interview rounds at top tech companies.