FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
35
With Videos
0
Easy
35
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2. Add Two Numbers
MediumLinked ListMathRecursion
Watch Solutions49.3% acceptance
3. Longest Substring Without Repeating Characters
MediumHash TableSliding WindowString
Watch Solutions39.9% acceptance
5. Longest Palindromic Substring
MediumDynamic ProgrammingStringTwo Pointers
Watch Solutions38.7% acceptance
6. Zigzag Conversion
MediumString
Watch Solutions54.9% acceptance
7. Reverse Integer
MediumMath
Watch Solutions32.2% acceptance
8. String to Integer (atoi)
MediumString
Watch Solutions21.4% acceptance
11. Container With Most Water
MediumArrayGreedyTwo Pointers
Watch Solutions60.9% acceptance
12. Integer to Roman
MediumHash TableMathString
Watch Solutions71.2% acceptance
15. 3Sum
MediumArraySortingTwo Pointers
Watch Solutions39.5% acceptance
16. 3Sum Closest
MediumArraySortingTwo Pointers
Watch Solutions47.4% acceptance
19. Remove Nth Node From End of List
MediumLinked ListTwo Pointers
Watch Solutions52.4% acceptance
22. Generate Parentheses
MediumBacktrackingDynamic ProgrammingString
Watch Solutions79.0% acceptance
29. Divide Two Integers
MediumBit ManipulationMath
Watch Solutions20.1% acceptance
31. Next Permutation
MediumArrayTwo Pointers
Watch Solutions46.1% acceptance
39. Combination Sum
MediumArrayBacktracking
Watch Solutions76.9% acceptance
40. Combination Sum II
MediumArrayBacktracking
Watch Solutions59.7% acceptance
43. Multiply Strings
MediumMathSimulationString
Watch Solutions44.4% acceptance
45. Jump Game II
MediumArrayDynamic ProgrammingGreedy
Watch Solutions43.2% acceptance
47. Permutations II
MediumArrayBacktracking
Watch Solutions63.7% acceptance
49. Group Anagrams
MediumArrayHash TableSorting
Watch Solutions73.0% acceptance
50. Pow(x, n)
MediumMathRecursion
Watch Solutions39.0% 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
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
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.