FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
23
With Videos
8
Easy
10
Medium
5
Hard
3428. Maximum and Minimum Sums of at Most Size K Subsequences
MediumArrayCombinatoricsDynamic Programming
Watch Solutions21.7% acceptance
3456. Find Special Substring of Length K
EasyString
Watch Solutions35.1% acceptance
3432. Count Partitions with Even Sum Difference
EasyArrayMathPrefix Sum
Watch Solutions85.2% acceptance
3404. Count Special Subsequences
MediumArrayEnumerationHash Table
Watch Solutions29.9% acceptance
3455. Shortest Matching Substring
HardBinary SearchStringString Matching
Watch Solutions24.5% acceptance
3382. Maximum Area Rectangle With Point Constraints II
HardArrayBinary Indexed TreeGeometry
Watch Solutions24.0% acceptance
3410. Maximize Subarray Sum After Removing All Occurrences of One Element
HardArrayDynamic ProgrammingSegment Tree
Watch Solutions23.0% acceptance
3425. Longest Special Path
HardArrayDepth-First SearchHash Table
Watch Solutions23.2% acceptance
3392. Count Subarrays of Length Three With a Condition
EasyArray
Watch Solutions61.5% acceptance
3407. Substring Matching Pattern
EasyStringString Matching
Watch Solutions29.1% acceptance
3403. Find the Lexicographically Largest String From the Box I
MediumEnumerationStringTwo Pointers
Watch Solutions41.0% acceptance
3405. Count the Number of Arrays with K Matching Adjacent Elements
HardCombinatoricsMath
Watch Solutions58.3% acceptance
3408. Design Task Manager
MediumDesignHash TableHeap (Priority Queue)
Watch Solutions49.1% acceptance
3418. Maximum Amount of Money Robot Can Earn
MediumArrayDynamic ProgrammingMatrix
Watch Solutions47.9% acceptance
3393. Count Paths With the Given XOR Value
MediumArrayBit ManipulationDynamic Programming
Watch Solutions40.6% acceptance
3394. Check if Grid can be Cut into Sections
MediumArraySorting
Watch Solutions68.3% acceptance
3396. Minimum Number of Operations to Make Elements in Array Distinct
EasyArrayHash Table
Watch Solutions71.3% acceptance
3381. Maximum Subarray Sum With Length Divisible by K
MediumArrayHash TablePrefix Sum
Watch Solutions49.6% acceptance
3379. Transformed Array
EasyArraySimulation
Watch Solutions70.5% acceptance
3376. Minimum Time to Break Locks I
MediumArrayBacktrackingBit Manipulation
Watch Solutions32.8% acceptance
3386. Button with Longest Push Time
EasyArray
Watch Solutions41.0% acceptance
3375. Minimum Operations to Make Array Values Equal to K
EasyArrayHash Table
Watch Solutions73.3% acceptance
3397. Maximum Number of Distinct Elements After Operations
MediumArrayGreedySorting
Watch Solutions52.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.