FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
30
With Videos
7
Easy
20
Medium
3
Hard
52. N-Queens II
HardBacktracking
Watch Solutions78.9% acceptance
53. Maximum Subarray
MediumArrayDivide and ConquerDynamic Programming
Watch Solutions53.7% acceptance
55. Jump Game
MediumArrayDynamic ProgrammingGreedy
Watch Solutions41.2% acceptance
56. Merge Intervals
MediumArraySorting
Watch Solutions52.6% acceptance
57. Insert Interval
MediumArray
Watch Solutions45.5% acceptance
59. Spiral Matrix II
MediumArrayMatrixSimulation
Watch Solutions75.4% acceptance
64. Minimum Path Sum
MediumArrayDynamic ProgrammingMatrix
Watch Solutions68.6% acceptance
65. Valid Number
HardString
Watch Solutions23.3% acceptance
66. Plus One
EasyArrayMath
Watch Solutions50.3% acceptance
69. Sqrt(x)
EasyBinary SearchMath
Watch Solutions42.2% acceptance
70. Climbing Stairs
EasyDynamic ProgrammingMathMemoization
Watch Solutions54.0% acceptance
71. Simplify Path
MediumStackString
Watch Solutions51.4% acceptance
72. Edit Distance
MediumDynamic ProgrammingString
Watch Solutions60.9% acceptance
73. Set Matrix Zeroes
MediumArrayHash TableMatrix
Watch Solutions63.2% acceptance
74. Search a 2D Matrix
MediumArrayBinary SearchMatrix
Watch Solutions54.4% acceptance
75. Sort Colors
MediumArraySortingTwo Pointers
Watch Solutions69.9% acceptance
77. Combinations
MediumBacktracking
Watch Solutions74.9% acceptance
78. Subsets
MediumArrayBacktrackingBit Manipulation
Watch Solutions82.7% acceptance
80. Remove Duplicates from Sorted Array II
MediumArrayTwo Pointers
Watch Solutions65.0% acceptance
82. Remove Duplicates from Sorted List II
MediumLinked ListTwo Pointers
Watch Solutions52.2% acceptance
83. Remove Duplicates from Sorted List
EasyLinked List
Watch Solutions57.6% acceptance
84. Largest Rectangle in Histogram
HardArrayMonotonic StackStack
Watch Solutions50.7% acceptance
88. Merge Sorted Array
EasyArraySortingTwo Pointers
Watch Solutions55.7% 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
94. Binary Tree Inorder Traversal
EasyBinary TreeDepth-First SearchStack
Watch Solutions80.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
100. Same Tree
EasyBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions68.0% 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.