FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
36
With Videos
0
Easy
0
Medium
36
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1912. Design Movie Rental System
HardArrayDesignHash Table
Watch Solutions62.5% acceptance
1916. Count Ways to Build Rooms in an Ant Colony
HardCombinatoricsDynamic ProgrammingGraph
Watch Solutions51.8% acceptance
1917. Leetcodify Friends Recommendations
HardDatabase
Watch Solutions27.5% acceptance
1919. Leetcodify Similar Friends
HardDatabase
Watch Solutions42.4% acceptance
1928. Minimum Cost to Reach Destination in Time
HardArrayDynamic ProgrammingGraph
Watch Solutions42.0% acceptance
1931. Painting a Grid With Three Different Colors
HardDynamic Programming
Watch Solutions77.2% acceptance
1932. Merge BSTs to Create Single BST
HardBinary SearchBinary TreeDepth-First Search
Watch Solutions39.7% acceptance
1944. Number of Visible People in a Queue
HardArrayMonotonic StackStack
Watch Solutions73.3% acceptance
1948. Delete Duplicate Folders in System
HardArrayHash FunctionHash Table
Watch Solutions77.7% acceptance
1955. Count Number of Special Subsequences
HardArrayDynamic Programming
Watch Solutions52.8% acceptance
1964. Find the Longest Valid Obstacle Course at Each Position
HardArrayBinary Indexed TreeBinary Search
Watch Solutions62.8% acceptance
1970. Last Day Where You Can Still Cross
HardArrayBinary SearchBreadth-First Search
Watch Solutions68.7% acceptance
1972. First and Last Call On the Same Day
HardDatabase
Watch Solutions50.7% acceptance
1977. Number of Ways to Separate Numbers
HardDynamic ProgrammingStringSuffix Array
Watch Solutions21.7% acceptance
1987. Number of Unique Good Subsequences
HardDynamic ProgrammingString
Watch Solutions52.7% acceptance
2004. The Number of Seniors and Juniors to Join the Company
HardDatabase
Watch Solutions44.0% acceptance
2009. Minimum Number of Operations to Make Array Continuous
HardArrayBinary SearchHash Table
Watch Solutions52.0% acceptance
2010. The Number of Seniors and Juniors to Join the Company II
HardDatabase
Watch Solutions63.2% acceptance
2014. Longest Subsequence Repeated k Times
HardBacktrackingCountingEnumeration
Watch Solutions71.3% acceptance
2019. The Score of Students Solving Math Expression
HardArrayDynamic ProgrammingMath
Watch Solutions34.2% acceptance
2030. Smallest K-Length Subsequence With Occurrences of a Letter
HardGreedyMonotonic StackStack
Watch Solutions40.0% acceptance
2040. Kth Smallest Product of Two Sorted Arrays
HardArrayBinary Search
Watch Solutions48.8% acceptance
2045. Second Minimum Time to Reach Destination
HardBreadth-First SearchGraphShortest Path
Watch Solutions62.3% acceptance
2050. Parallel Courses III
HardArrayDynamic ProgrammingGraph
Watch Solutions67.0% acceptance
2060. Check if an Original String Exists Given Two Encoded Strings
HardDynamic ProgrammingString
Watch Solutions43.6% acceptance
2065. Maximum Path Quality of a Graph
HardArrayBacktrackingGraph
Watch Solutions62.5% acceptance
2071. Maximum Number of Tasks You Can Assign
HardArrayBinary SearchGreedy
Watch Solutions50.1% acceptance
2081. Sum of k-Mirror Numbers
HardEnumerationMath
Watch Solutions63.7% acceptance
2088. Count Fertile Pyramids in a Land
HardArrayDynamic ProgrammingMatrix
Watch Solutions66.5% acceptance
2092. Find All People With Secret
HardBreadth-First SearchDepth-First SearchGraph
Watch Solutions48.4% acceptance
2097. Valid Arrangement of Pairs
HardDepth-First SearchEulerian CircuitGraph
Watch Solutions66.5% acceptance
2102. Sequentially Ordinal Rank Tracker
HardData StreamDesignHeap (Priority Queue)
Watch Solutions61.5% acceptance
2106. Maximum Fruits Harvested After at Most K Steps
HardArrayBinary SearchPrefix Sum
Watch Solutions61.0% acceptance
2111. Minimum Operations to Make the Array K-Increasing
HardArrayBinary Search
Watch Solutions40.5% acceptance
2117. Abbreviating the Product of a Range
HardMath
Watch Solutions25.0% acceptance
2118. Build the Equation
HardDatabase
Watch Solutions55.9% 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.