FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
23
With Videos
0
Easy
23
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
3404. Count Special Subsequences
MediumArrayEnumerationHash Table
Watch Solutions29.9% acceptance
3403. Find the Lexicographically Largest String From the Box I
MediumEnumerationStringTwo Pointers
Watch Solutions41.0% 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
3381. Maximum Subarray Sum With Length Divisible by K
MediumArrayHash TablePrefix Sum
Watch Solutions49.6% acceptance
3376. Minimum Time to Break Locks I
MediumArrayBacktrackingBit Manipulation
Watch Solutions32.8% acceptance
3397. Maximum Number of Distinct Elements After Operations
MediumArrayGreedySorting
Watch Solutions52.2% acceptance
3882. Minimum XOR Path in a Grid
MediumArrayBit ManipulationDynamic Programming
Watch Solutions39.5% acceptance
3889. Mirror Frequency Distance
MediumCountingHash TableString
Watch Solutions60.7% acceptance
3891. Minimum Increase to Maximize Special Indices
MediumArrayDynamic ProgrammingGreedy
Watch Solutions19.8% acceptance
3896. Minimum Operations to Transform Array into Alternating Prime
MediumArrayBinary SearchMath
Watch Solutions53.2% acceptance
3907. Count Smaller Elements With Opposite Parity
Medium
Watch Solutions72.7% acceptance
3905. Multi Source Flood Fill
MediumArrayBreadth-First SearchMatrix
Watch Solutions56.3% acceptance
3927. Minimize Array Sum Using Divisible Replacements
MediumArrayGreedyHash Table
Watch Solutions32.2% acceptance
3926. Count Valid Word Occurrences
MediumArrayCountingHash Table
Watch Solutions48.1% acceptance
3922. Minimum Flips to Make Binary String Coherent
MediumString
Watch Solutions19.9% acceptance
3932. Count K-th Roots in a Range
MediumBinary SearchMath
Watch Solutions24.6% acceptance
3933. Largest Local Values in a Matrix II
MediumArrayMatrixPrefix Sum
Watch Solutions18.5% acceptance
3937. Minimum Operations to Make Array Modulo Alternating I
MediumArrayEnumeration
Watch Solutions46.5% acceptance
3938. Maximum Path Intersection Sum in a Grid
MediumArrayDynamic ProgrammingMatrix
Watch Solutions25.6% acceptance
3946. Maximum Number of Items From Sale I
MediumArrayDynamic ProgrammingGreedy
Watch Solutions37.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.