FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
37
With Videos
12
Easy
19
Medium
6
Hard
1951. All the Pairs With the Maximum Number of Common Followers
MediumDatabase
Watch Solutions68.9% acceptance
1952. Three Divisors
EasyEnumerationMathNumber Theory
Watch Solutions64.6% acceptance
1953. Maximum Number of Weeks for Which You Can Work
MediumArrayGreedy
Watch Solutions42.4% acceptance
1954. Minimum Garden Perimeter to Collect Enough Apples
MediumBinary SearchMath
Watch Solutions55.5% acceptance
1955. Count Number of Special Subsequences
HardArrayDynamic Programming
Watch Solutions52.8% acceptance
1957. Delete Characters to Make Fancy String
EasyString
Watch Solutions74.1% 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
1961. Check If String Is a Prefix of Array
EasyArrayStringTwo Pointers
Watch Solutions52.7% acceptance
1963. Minimum Number of Swaps to Make the String Balanced
MediumGreedyStackString
Watch Solutions78.0% acceptance
1964. Find the Longest Valid Obstacle Course at Each Position
HardArrayBinary Indexed TreeBinary Search
Watch Solutions62.8% acceptance
1965. Employees With Missing Information
EasyDatabase
Watch Solutions72.6% acceptance
1967. Number of Strings That Appear as Substrings in Word
EasyArrayString
Watch Solutions86.1% 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
1970. Last Day Where You Can Still Cross
HardArrayBinary SearchBreadth-First Search
Watch Solutions68.7% acceptance
1971. Find if Path Exists in Graph
EasyBreadth-First SearchDepth-First SearchGraph
Watch Solutions55.5% acceptance
1972. First and Last Call On the Same Day
HardDatabase
Watch Solutions50.7% acceptance
1973. Count Nodes Equal to Sum of Descendants
MediumBinary TreeDepth-First SearchTree
Watch Solutions77.4% acceptance
1974. Minimum Time to Type Word Using Special Typewriter
EasyGreedyString
Watch Solutions78.5% 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
1977. Number of Ways to Separate Numbers
HardDynamic ProgrammingStringSuffix Array
Watch Solutions21.7% acceptance
1978. Employees Whose Manager Left the Company
EasyDatabase
Watch Solutions48.9% acceptance
1979. Find Greatest Common Divisor of Array
EasyArrayMathNumber Theory
Watch Solutions83.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
1984. Minimum Difference Between Highest and Lowest of K Scores
EasyArraySliding WindowSorting
Watch Solutions66.2% acceptance
1987. Number of Unique Good Subsequences
HardDynamic ProgrammingString
Watch Solutions52.7% 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
1995. Count Special Quadruplets
EasyArrayEnumerationHash Table
Watch Solutions64.5% acceptance
1997. First Day Where You Have Been in All the Rooms
MediumArrayDynamic Programming
Watch Solutions40.5% acceptance
2000. Reverse Prefix of Word
EasyStackStringTwo Pointers
Watch Solutions86.3% 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.