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
1954. Minimum Garden Perimeter to Collect Enough Apples
MediumBinary SearchMath
Watch Solutions55.5% acceptance
1958. Check if Move is Legal
MediumArrayEnumerationMatrix
Watch Solutions50.0% acceptance
1959. Minimum Total Space Wasted With K Resizing Operations
MediumArrayDynamic Programming
Watch Solutions44.0% acceptance
1963. Minimum Number of Swaps to Make the String Balanced
MediumGreedyStackString
Watch Solutions78.0% acceptance
1968. Array With Elements Not Equal to Average of Neighbors
MediumArrayGreedySorting
Watch Solutions50.9% acceptance
1969. Minimum Non-Zero Product of the Array Elements
MediumGreedyMathRecursion
Watch Solutions37.5% acceptance
1973. Count Nodes Equal to Sum of Descendants
MediumBinary TreeDepth-First SearchTree
Watch Solutions77.4% acceptance
1975. Maximum Matrix Sum
MediumArrayGreedyMatrix
Watch Solutions67.6% acceptance
1976. Number of Ways to Arrive at Destination
MediumDynamic ProgrammingGraphShortest Path
Watch Solutions37.4% acceptance
1980. Find Unique Binary String
MediumArrayBacktrackingHash Table
Watch Solutions81.2% acceptance
1981. Minimize the Difference Between Target and Chosen Elements
MediumArrayDynamic ProgrammingMatrix
Watch Solutions36.8% acceptance
1983. Widest Pair of Indices With Equal Range Sum
MediumArrayHash TablePrefix Sum
Watch Solutions54.0% acceptance
1988. Find Cutoff Score for Each School
MediumDatabase
Watch Solutions66.8% acceptance
1989. Maximum Number of People That Can Be Caught in Tag
MediumArrayGreedy
Watch Solutions49.4% acceptance
1990. Count the Number of Experiments
MediumDatabase
Watch Solutions49.1% acceptance
1992. Find All Groups of Farmland
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions75.6% acceptance
1997. First Day Where You Have Been in All the Rooms
MediumArrayDynamic Programming
Watch Solutions40.5% acceptance
2002. Maximum Product of the Length of Two Palindromic Subsequences
MediumBacktrackingBit ManipulationBitmask
Watch Solutions62.4% acceptance
2007. Find Original Array From Doubled Array
MediumArrayGreedyHash Table
Watch Solutions40.5% acceptance
2017. Grid Game
MediumArrayMatrixPrefix Sum
Watch Solutions60.9% acceptance
2018. Check if Word Can Be Placed In Crossword
MediumArrayEnumerationMatrix
Watch Solutions50.7% acceptance
2020. Number of Accounts That Did Not Stream
MediumDatabase
Watch Solutions72.0% acceptance
2021. Brightest Position on Street
MediumArrayOrdered SetPrefix Sum
Watch Solutions60.5% acceptance
2023. Number of Pairs of Strings With Concatenation Equal to Target
MediumArrayCountingHash Table
Watch Solutions75.1% acceptance
2028. Find Missing Observations
MediumArrayMathSimulation
Watch Solutions57.5% acceptance
2031. Count Subarrays With More Ones Than Zeros
MediumArrayBinary Indexed TreeBinary Search
Watch Solutions49.7% acceptance
2033. Minimum Operations to Make a Uni-Value Grid
MediumArrayMathMatrix
Watch Solutions70.7% acceptance
2034. Stock Price Fluctuation
MediumData StreamDesignHash Table
Watch Solutions49.1% acceptance
2036. Maximum Alternating Subarray Sum
MediumArrayDynamic Programming
Watch Solutions40.0% acceptance
2038. Remove Colored Pieces if Both Neighbors are the Same Color
MediumGame TheoryGreedyMath
Watch Solutions62.8% acceptance
2041. Accepted Candidates From the Interviews
MediumDatabase
Watch Solutions78.5% acceptance
2043. Simple Bank System
MediumArrayDesignHash Table
Watch Solutions69.7% acceptance
2044. Count Number of Maximum Bitwise-OR Subsets
MediumArrayBacktrackingBit Manipulation
Watch Solutions89.5% acceptance
2046. Sort Linked List Already Sorted Using Absolute Values
MediumLinked ListSortingTwo Pointers
Watch Solutions67.1% acceptance
2048. Next Greater Numerically Balanced Number
MediumBacktrackingEnumerationMath
Watch Solutions63.1% 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.