FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
28
With Videos
0
Easy
28
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
3719. Longest Balanced Subarray I
MediumArrayDivide and ConquerHash Table
Watch Solutions65.6% acceptance
3825. Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND
MediumArrayBinary SearchBit Manipulation
Watch Solutions50.6% acceptance
3857. Minimum Cost to Split into Ones
MediumDynamic ProgrammingMath
Watch Solutions82.6% acceptance
3694. Distinct Points Reachable After Substring Removal
MediumHash TablePrefix SumSliding Window
Watch Solutions53.9% acceptance
3776. Minimum Moves to Balance Circular Array
MediumArrayGreedySorting
Watch Solutions40.2% acceptance
3698. Split Array With Minimum Difference
MediumArrayPrefix Sum
Watch Solutions33.6% acceptance
3853. Merge Close Characters
MediumHash TableString
Watch Solutions54.8% acceptance
3689. Maximum Total Subarray Value I
MediumArrayGreedy
Watch Solutions71.9% acceptance
3675. Minimum Operations to Transform String
MediumGreedyString
Watch Solutions61.9% acceptance
3742. Maximum Path Score in a Grid
MediumArrayDynamic ProgrammingMatrix
Watch Solutions53.7% acceptance
3660. Jump Game IX
MediumArrayDynamic Programming
Watch Solutions46.1% acceptance
3652. Best Time to Buy and Sell Stock using Strategy
MediumArrayPrefix SumSliding Window
Watch Solutions59.8% acceptance
3659. Partition Array Into K-Distinct Groups
MediumArrayCountingHash Table
Watch Solutions47.1% acceptance
3653. XOR After Range Multiplication Queries I
MediumArrayDivide and ConquerSimulation
Watch Solutions73.3% acceptance
3635. Earliest Finish Time for Land and Water Rides II
MediumArrayBinary SearchGreedy
Watch Solutions64.2% acceptance
3649. Number of Perfect Pairs
MediumArrayMathSorting
Watch Solutions34.2% acceptance
3616. Number of Student Replacements
MediumArraySimulation
Watch Solutions86.0% acceptance
3634. Minimum Removals to Balance Array
MediumArrayBinary SearchSliding Window
Watch Solutions47.9% acceptance
3638. Maximum Balanced Shipments
MediumArrayDynamic ProgrammingGreedy
Watch Solutions61.4% acceptance
3679. Minimum Discards to Balance Inventory
MediumArrayCountingHash Table
Watch Solutions34.9% acceptance
3644. Maximum K to Sort a Permutation
MediumArrayBit Manipulation
Watch Solutions37.3% acceptance
3610. Minimum Number of Primes to Sum to Target
MediumArrayDynamic ProgrammingMath
Watch Solutions59.8% acceptance
3669. Balanced K-Factor Decomposition
MediumBacktrackingMathNumber Theory
Watch Solutions40.2% acceptance
3755. Find Maximum Balanced XOR Subarray Length
MediumArrayBit ManipulationHash Table
Watch Solutions50.8% acceptance
3665. Twisted Mirror Path Count
MediumArrayDynamic ProgrammingMatrix
Watch Solutions47.5% acceptance
3618. Split Array by Prime Indices
MediumArrayMathNumber Theory
Watch Solutions49.3% acceptance
3629. Minimum Jumps to Reach End via Prime Teleportation
MediumArrayBreadth-First SearchHash Table
Watch Solutions44.6% acceptance
3612. Process String with Special Operations I
MediumSimulationString
Watch Solutions71.4% 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.