FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
37
With Videos
10
Easy
16
Medium
11
Hard
3001. Minimum Moves to Capture The Queen
MediumArrayEnumeration
Watch Solutions22.3% acceptance
3003. Maximize the Number of Partitions After Operations
HardBit ManipulationBitmaskDynamic Programming
Watch Solutions53.5% acceptance
3005. Count Elements With Maximum Frequency
EasyArrayCountingHash Table
Watch Solutions79.8% acceptance
3008. Find Beautiful Indices in the Given Array II
HardBinary SearchHash FunctionRolling Hash
Watch Solutions28.3% acceptance
3009. Maximum Number of Intersections on the Chart
HardArrayBinary Indexed TreeGeometry
Watch Solutions45.5% acceptance
3010. Divide an Array Into Subarrays With Minimum Cost I
EasyArrayEnumerationSorting
Watch Solutions80.5% acceptance
3011. Find if Array Can Be Sorted
MediumArrayBit ManipulationSorting
Watch Solutions66.4% acceptance
3012. Minimize Length of Array Using Operations
MediumArrayGreedyMath
Watch Solutions35.7% acceptance
3013. Divide an Array Into Subarrays With Minimum Cost II
HardArrayHash TableHeap (Priority Queue)
Watch Solutions54.7% acceptance
3015. Count the Number of Houses at a Certain Distance I
MediumBreadth-First SearchGraphPrefix Sum
Watch Solutions58.2% acceptance
3017. Count the Number of Houses at a Certain Distance II
HardGraphPrefix Sum
Watch Solutions23.7% acceptance
3018. Maximum Number of Removal Queries That Can Be Processed I
HardArrayDynamic Programming
Watch Solutions44.8% acceptance
3019. Number of Changing Keys
EasyString
Watch Solutions80.6% acceptance
3020. Find the Maximum Number of Elements in Subset
MediumArrayEnumerationHash Table
Watch Solutions42.2% acceptance
3021. Alice and Bob Playing Flower Game
MediumMath
Watch Solutions60.2% acceptance
3023. Find Pattern in Infinite Stream I
MediumArrayHash FunctionRolling Hash
Watch Solutions57.5% acceptance
3024. Type of Triangle
EasyArrayMathSorting
Watch Solutions44.1% acceptance
3025. Find the Number of Ways to Place People I
MediumArrayEnumerationGeometry
Watch Solutions64.0% acceptance
3026. Maximum Good Subarray Sum
MediumArrayHash TablePrefix Sum
Watch Solutions22.1% acceptance
3027. Find the Number of Ways to Place People II
HardArrayEnumerationGeometry
Watch Solutions64.4% acceptance
3028. Ant on the Boundary
EasyArrayPrefix SumSimulation
Watch Solutions74.6% acceptance
3029. Minimum Time to Revert Word to Initial State I
MediumHash FunctionRolling HashString
Watch Solutions42.4% acceptance
3032. Count Numbers With Unique Digits II
EasyDynamic ProgrammingHash TableMath
Watch Solutions87.4% acceptance
3033. Modify the Matrix
EasyArrayMatrix
Watch Solutions69.1% acceptance
3035. Maximum Palindromes After Operations
MediumArrayCountingGreedy
Watch Solutions47.2% acceptance
3036. Number of Subarrays That Match a Pattern II
HardArrayHash FunctionRolling Hash
Watch Solutions34.1% acceptance
3037. Find Pattern in Infinite Stream II
HardArrayHash FunctionRolling Hash
Watch Solutions67.5% acceptance
3038. Maximum Number of Operations With the Same Score I
EasyArraySimulation
Watch Solutions52.8% acceptance
3039. Apply Operations to Make String Empty
MediumArrayCountingHash Table
Watch Solutions57.5% acceptance
3040. Maximum Number of Operations With the Same Score II
MediumArrayDynamic ProgrammingMemoization
Watch Solutions34.1% acceptance
3042. Count Prefix and Suffix Pairs I
EasyArrayHash FunctionRolling Hash
Watch Solutions77.8% acceptance
3043. Find the Length of the Longest Common Prefix
MediumArrayHash TableString
Watch Solutions62.1% acceptance
3045. Count Prefix and Suffix Pairs II
HardArrayHash FunctionRolling Hash
Watch Solutions28.2% acceptance
3046. Split the Array
EasyArrayCountingHash Table
Watch Solutions61.7% acceptance
3047. Find the Largest Area of Square Inside Two Rectangles
MediumArrayGeometryMath
Watch Solutions66.9% acceptance
3049. Earliest Second to Mark Indices II
HardArrayBinary SearchGreedy
Watch Solutions22.6% acceptance
3050. Pizza Toppings Cost Analysis
MediumDatabase
Watch Solutions66.2% 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.