FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
21
With Videos
0
Easy
0
Medium
21
Hard
Filter by Difficulty
Browse video solutions by difficulty level
3785. Minimum Swaps to Avoid Forbidden Values
HardArrayCountingGreedy
Watch Solutions31.0% acceptance
3721. Longest Balanced Subarray II
HardArrayDivide and ConquerHash Table
Watch Solutions33.7% acceptance
3686. Number of Stable Subsequences
HardArrayDynamic Programming
Watch Solutions60.2% acceptance
3691. Maximum Total Subarray Value II
HardArrayGreedyHeap (Priority Queue)
Watch Solutions41.6% acceptance
3671. Sum of Beautiful Subsequences
HardArrayBinary Indexed TreeMath
Watch Solutions31.5% acceptance
3666. Minimum Operations to Equalize Binary String
HardBreadth-First SearchMathOrdered Set
Watch Solutions45.2% acceptance
3661. Maximum Walls Destroyed by Robots
HardArrayBinary SearchDynamic Programming
Watch Solutions48.0% acceptance
3655. XOR After Range Multiplication Queries II
HardArrayDivide and Conquer
Watch Solutions47.8% acceptance
3700. Number of ZigZag Arrays II
HardDynamic ProgrammingMath
Watch Solutions67.7% acceptance
3640. Trionic Array II
HardArrayDynamic Programming
Watch Solutions47.3% acceptance
3636. Threshold Majority Queries
HardArrayBinary SearchCounting
Watch Solutions22.5% acceptance
3646. Next Special Palindrome Number
HardBacktrackingBit Manipulation
Watch Solutions28.0% acceptance
3614. Process String with Special Operations II
HardSimulationString
Watch Solutions39.9% acceptance
3621. Number of Integers With Popcount-Depth Equal to K I
HardBit ManipulationCombinatoricsDynamic Programming
Watch Solutions23.0% acceptance
3615. Longest Palindromic Path in Graph
HardBit ManipulationBitmaskDynamic Programming
Watch Solutions22.6% acceptance
3620. Network Recovery Pathways
HardArrayBinary SearchDynamic Programming
Watch Solutions50.8% acceptance
3625. Count Number of Trapezoids II
HardArrayGeometryHash Table
Watch Solutions40.0% acceptance
3574. Maximize Subarray GCD Score
HardArrayEnumerationMath
Watch Solutions25.5% acceptance
3549. Multiply Two Polynomials
HardArrayMath
Watch Solutions58.6% acceptance
3630. Partition Array for Maximum XOR and AND
HardArrayBit ManipulationEnumeration
Watch Solutions17.6% acceptance
3569. Maximize Count of Distinct Primes After Split
HardArrayMathNumber Theory
Watch Solutions19.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.