FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
36
With Videos
8
Easy
19
Medium
9
Hard
2002. Maximum Product of the Length of Two Palindromic Subsequences
MediumBacktrackingBit ManipulationBitmask
Watch Solutions62.4% acceptance
2004. The Number of Seniors and Juniors to Join the Company
HardDatabase
Watch Solutions44.0% acceptance
2006. Count Number of Pairs With Absolute Difference K
EasyArrayCountingHash Table
Watch Solutions85.4% acceptance
2007. Find Original Array From Doubled Array
MediumArrayGreedyHash Table
Watch Solutions40.5% 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
2011. Final Value of Variable After Performing Operations
EasyArraySimulationString
Watch Solutions90.6% acceptance
2014. Longest Subsequence Repeated k Times
HardBacktrackingCountingEnumeration
Watch Solutions71.3% acceptance
2016. Maximum Difference Between Increasing Elements
EasyArray
Watch Solutions66.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
2019. The Score of Students Solving Math Expression
HardArrayDynamic ProgrammingMath
Watch Solutions34.2% 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
2022. Convert 1D Array Into 2D Array
EasyArrayMatrixSimulation
Watch Solutions72.2% acceptance
2023. Number of Pairs of Strings With Concatenation Equal to Target
MediumArrayCountingHash Table
Watch Solutions75.1% acceptance
2026. Low-Quality Problems
EasyDatabase
Watch Solutions84.3% acceptance
2028. Find Missing Observations
MediumArrayMathSimulation
Watch Solutions57.5% acceptance
2030. Smallest K-Length Subsequence With Occurrences of a Letter
HardGreedyMonotonic StackStack
Watch Solutions40.0% acceptance
2031. Count Subarrays With More Ones Than Zeros
MediumArrayBinary Indexed TreeBinary Search
Watch Solutions49.7% acceptance
2032. Two Out of Three
EasyArrayBit ManipulationHash Table
Watch Solutions77.5% 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
2037. Minimum Number of Moves to Seat Everyone
EasyArrayCounting SortGreedy
Watch Solutions87.4% acceptance
2038. Remove Colored Pieces if Both Neighbors are the Same Color
MediumGame TheoryGreedyMath
Watch Solutions62.8% acceptance
2040. Kth Smallest Product of Two Sorted Arrays
HardArrayBinary Search
Watch Solutions48.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
2045. Second Minimum Time to Reach Destination
HardBreadth-First SearchGraphShortest Path
Watch Solutions62.3% acceptance
2046. Sort Linked List Already Sorted Using Absolute Values
MediumLinked ListSortingTwo Pointers
Watch Solutions67.1% acceptance
2047. Number of Valid Words in a Sentence
EasyString
Watch Solutions31.0% acceptance
2048. Next Greater Numerically Balanced Number
MediumBacktrackingEnumerationMath
Watch Solutions63.1% acceptance
2049. Count Nodes With the Highest Score
MediumArrayBinary TreeDepth-First Search
Watch Solutions52.6% acceptance
2050. Parallel Courses III
HardArrayDynamic ProgrammingGraph
Watch Solutions67.0% 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.