FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
29
With Videos
0
Easy
29
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
3690. Split and Merge Array Transformation
MediumArrayBreadth-First SearchHash Table
Watch Solutions58.7% 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
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
3573. Best Time to Buy and Sell Stock V
MediumArrayDynamic Programming
Watch Solutions60.7% acceptance
3650. Minimum Cost Path with Edge Reversals
MediumGraphHeap (Priority Queue)Shortest Path
Watch Solutions61.8% acceptance
3623. Count Number of Trapezoids I
MediumArrayGeometryHash Table
Watch Solutions48.1% acceptance
3583. Count Special Triplets
MediumArrayCountingHash Table
Watch Solutions47.1% acceptance
3613. Minimize Maximum Component Cost
MediumBinary SearchGraphSorting
Watch Solutions43.5% acceptance
3540. Minimum Time to Visit All Houses
MediumArrayPrefix Sum
Watch Solutions69.3% acceptance
3664. Two-Letter Card Game
MediumArrayCountingEnumeration
Watch Solutions13.0% acceptance
3576. Transform Array to All Equal Elements
MediumArrayGreedy
Watch Solutions33.1% acceptance
3685. Subsequence Sum After Capping Elements
MediumArrayDynamic ProgrammingSorting
Watch Solutions25.2% acceptance
3588. Find Maximum Area of a Triangle
MediumArrayEnumerationGeometry
Watch Solutions29.8% acceptance
3577. Count the Number of Computer Unlocking Permutations
MediumArrayBrainteaserCombinatorics
Watch Solutions59.0% acceptance
3607. Power Grid Maintenance
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions56.3% acceptance
3557. Find Maximum Number of Non Intersecting Substrings
MediumDynamic ProgrammingGreedyHash Table
Watch Solutions31.1% acceptance
3546. Equal Sum Grid Partition I
MediumArrayEnumerationMatrix
Watch Solutions52.9% acceptance
3551. Minimum Swaps to Sort by Digit Sum
MediumArrayHash TableSorting
Watch Solutions50.5% acceptance
3566. Partition Array into Two Equal Product Subsets
MediumArrayBit ManipulationEnumeration
Watch Solutions35.1% acceptance
3532. Path Existence Queries in a Graph I
MediumArrayBinary SearchGraph
Watch Solutions70.6% acceptance
3542. Minimum Operations to Convert All Elements to Zero
MediumArrayGreedyHash Table
Watch Solutions53.0% acceptance
3508. Implement Router
MediumArrayBinary SearchDesign
Watch Solutions39.1% acceptance
3537. Fill a Special Grid
MediumArrayDivide and ConquerMatrix
Watch Solutions70.8% acceptance
3529. Count Cells in Overlapping Horizontal and Vertical Substrings
MediumArrayHash FunctionMatrix
Watch Solutions27.7% 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.