Skip to main content
FleetCode

Video Solutions

Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.

34
With Videos
9
Easy
21
Medium
4
Hard

Filter by Difficulty

Browse video solutions by difficulty level

1. Two Sum

EasyArrayHash Table
Watch Solutions57.8% acceptance

2. Add Two Numbers

MediumLinked ListMathRecursion
Watch Solutions49.3% acceptance

3. Longest Substring Without Repeating Characters

MediumHash TableSliding WindowString
Watch Solutions39.9% acceptance

4. Median of Two Sorted Arrays

HardArrayBinary SearchDivide and Conquer
Watch Solutions47.3% 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

9. Palindrome Number

EasyMath
Watch Solutions61.0% acceptance

11. Container With Most Water

MediumArrayGreedyTwo Pointers
Watch Solutions60.9% acceptance

12. Integer to Roman

MediumHash TableMathString
Watch Solutions71.2% acceptance

13. Roman to Integer

EasyHash TableMathString
Watch Solutions67.0% acceptance

14. Longest Common Prefix

EasyStringTrie
Watch Solutions48.0% 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

20. Valid Parentheses

EasyStackString
Watch Solutions44.5% acceptance

21. Merge Two Sorted Lists

EasyLinked ListRecursion
Watch Solutions68.7% acceptance

22. Generate Parentheses

MediumBacktrackingDynamic ProgrammingString
Watch Solutions79.0% acceptance

23. Merge k Sorted Lists

HardDivide and ConquerHeap (Priority Queue)Linked List
Watch Solutions60.3% acceptance

27. Remove Element

EasyArrayTwo Pointers
Watch Solutions62.2% acceptance

28. Find the Index of the First Occurrence in a String

EasyStringString MatchingTwo Pointers
Watch Solutions47.0% acceptance

29. Divide Two Integers

MediumBit ManipulationMath
Watch Solutions20.1% acceptance

30. Substring with Concatenation of All Words

HardHash TableSliding WindowString
Watch Solutions34.8% acceptance

31. Next Permutation

MediumArrayTwo Pointers
Watch Solutions46.1% acceptance

35. Search Insert Position

EasyArrayBinary Search
Watch Solutions52.1% acceptance

37. Sudoku Solver

HardArrayBacktrackingHash Table
Watch Solutions65.4% 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
Page 1 of 81

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.