FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
40
With Videos
0
Easy
40
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2049. Count Nodes With the Highest Score
MediumArrayBinary TreeDepth-First Search
Watch Solutions52.6% acceptance
2051. The Category of Each Member in the Store
MediumDatabase
Watch Solutions70.2% acceptance
2054. Two Best Non-Overlapping Events
MediumArrayBinary SearchDynamic Programming
Watch Solutions64.0% acceptance
2055. Plates Between Candles
MediumArrayBinary SearchPrefix Sum
Watch Solutions47.4% acceptance
2061. Number of Spaces Cleaning Robot Cleaned
MediumArrayMatrixSimulation
Watch Solutions64.3% acceptance
2063. Vowels of All Substrings
MediumCombinatoricsDynamic ProgrammingMath
Watch Solutions55.3% acceptance
2064. Minimized Maximum of Products Distributed to Any Store
MediumArrayBinary SearchGreedy
Watch Solutions63.1% acceptance
2066. Account Balance
MediumDatabase
Watch Solutions82.1% acceptance
2069. Walking Robot Simulation II
MediumDesignSimulation
Watch Solutions43.2% acceptance
2070. Most Beautiful Item for Each Query
MediumArrayBinary SearchSorting
Watch Solutions62.2% acceptance
2075. Decode the Slanted Ciphertext
MediumSimulationString
Watch Solutions67.3% acceptance
2077. Paths in Maze That Lead to Same Room
MediumGraph
Watch Solutions56.7% acceptance
2079. Watering Plants
MediumArraySimulation
Watch Solutions79.9% acceptance
2083. Substrings That Begin and End With the Same Letter
MediumCountingHash TableMath
Watch Solutions74.1% acceptance
2084. Drop Type 1 Orders for Customers With Type 0 Orders
MediumDatabase
Watch Solutions86.9% acceptance
2086. Minimum Number of Food Buckets to Feed the Hamsters
MediumDynamic ProgrammingGreedyString
Watch Solutions48.1% acceptance
2087. Minimum Cost Homecoming of a Robot in a Grid
MediumArrayGreedy
Watch Solutions51.7% acceptance
2090. K Radius Subarray Averages
MediumArraySliding Window
Watch Solutions46.0% acceptance
2093. Minimum Cost to Reach City With Discounts
MediumGraphHeap (Priority Queue)Shortest Path
Watch Solutions61.0% acceptance
2095. Delete the Middle Node of a Linked List
MediumLinked ListTwo Pointers
Watch Solutions60.4% acceptance
2096. Step-By-Step Directions From a Binary Tree Node to Another
MediumBinary TreeDepth-First SearchString
Watch Solutions56.3% acceptance
2101. Detonate the Maximum Bombs
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions50.0% acceptance
2104. Sum of Subarray Ranges
MediumArrayMonotonic StackStack
Watch Solutions61.6% acceptance
2105. Watering Plants II
MediumArraySimulationTwo Pointers
Watch Solutions48.8% acceptance
2107. Number of Unique Flavors After Sharing K Candies
MediumArrayHash TableSliding Window
Watch Solutions62.4% acceptance
2109. Adding Spaces to a String
MediumArraySimulationString
Watch Solutions71.8% acceptance
2110. Number of Smooth Descent Periods of a Stock
MediumArrayDynamic ProgrammingMath
Watch Solutions67.7% acceptance
2112. The Airport With the Most Traffic
MediumDatabase
Watch Solutions70.6% acceptance
2115. Find All Possible Recipes from Given Supplies
MediumArrayGraphHash Table
Watch Solutions56.8% acceptance
2116. Check if a Parentheses String Can Be Valid
MediumGreedyStackString
Watch Solutions45.1% acceptance
2120. Execution of All Suffix Instructions Staying in a Grid
MediumSimulationString
Watch Solutions82.4% acceptance
2121. Intervals Between Identical Elements
MediumArrayHash TablePrefix Sum
Watch Solutions47.8% acceptance
2125. Number of Laser Beams in a Bank
MediumArrayMathMatrix
Watch Solutions87.0% acceptance
2126. Destroying Asteroids
MediumArrayGreedySorting
Watch Solutions59.7% acceptance
2128. Remove All Ones With Row and Column Flips
MediumArrayBit ManipulationMath
Watch Solutions76.2% acceptance
2130. Maximum Twin Sum of a Linked List
MediumLinked ListStackTwo Pointers
Watch Solutions83.2% acceptance
2131. Longest Palindrome by Concatenating Two Letter Words
MediumArrayCountingGreedy
Watch Solutions53.5% acceptance
2134. Minimum Swaps to Group All 1's Together II
MediumArraySliding Window
Watch Solutions65.5% acceptance
2135. Count Words Obtained After Adding a Letter
MediumArrayBit ManipulationHash Table
Watch Solutions44.0% acceptance
2137. Pour Water Between Buckets to Make Water Levels Equal
MediumArrayBinary Search
Watch Solutions68.4% 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.