FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
24
With Videos
2
Easy
16
Medium
6
Hard
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
3614. Process String with Special Operations II
HardSimulationString
Watch Solutions39.9% acceptance
3665. Twisted Mirror Path Count
MediumArrayDynamic ProgrammingMatrix
Watch Solutions47.5% acceptance
3621. Number of Integers With Popcount-Depth Equal to K I
HardBit ManipulationCombinatoricsDynamic Programming
Watch Solutions23.0% 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
3615. Longest Palindromic Path in Graph
HardBit ManipulationBitmaskDynamic Programming
Watch Solutions22.6% acceptance
3690. Split and Merge Array Transformation
MediumArrayBreadth-First SearchHash Table
Watch Solutions58.7% acceptance
3620. Network Recovery Pathways
HardArrayBinary SearchDynamic Programming
Watch Solutions50.8% acceptance
3604. Minimum Time to Reach Destination in Directed Graph
MediumGraphHeap (Priority Queue)Shortest Path
Watch Solutions45.5% acceptance
3670. Maximum Product of Two Integers With No Common Bits
MediumArrayBit ManipulationDynamic Programming
Watch Solutions15.1% acceptance
3591. Check if Any Element Has Prime Frequency
EasyArrayCountingHash Table
Watch Solutions62.6% acceptance
3593. Minimum Increments to Equalize Leaf Paths
MediumArrayDepth-First SearchDynamic Programming
Watch Solutions41.2% acceptance
3608. Minimum Time for K Connected Components
MediumBinary SearchGraphSorting
Watch Solutions45.2% acceptance
3597. Partition String
MediumHash TableSimulationString
Watch Solutions59.4% acceptance
3587. Minimum Adjacent Swaps to Alternate Parity
MediumArrayGreedy
Watch Solutions42.3% acceptance
3565. Sequential Grid Path Cover
MediumArrayMatrixRecursion
Watch Solutions60.2% acceptance
3625. Count Number of Trapezoids II
HardArrayGeometryHash Table
Watch Solutions40.0% acceptance
3582. Generate Tag for Video Caption
EasySimulationString
Watch Solutions32.4% acceptance
3574. Maximize Subarray GCD Score
HardArrayEnumerationMath
Watch Solutions25.5% 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.