FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
26
With Videos
4
Easy
16
Medium
6
Hard
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
3549. Multiply Two Polynomials
HardArrayMath
Watch Solutions58.6% acceptance
3630. Partition Array for Maximum XOR and AND
HardArrayBit ManipulationEnumeration
Watch Solutions17.6% 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
3560. Find Minimum Log Transportation Cost
EasyMath
Watch Solutions42.2% acceptance
3569. Maximize Count of Distinct Primes After Split
HardArrayMathNumber Theory
Watch Solutions19.0% 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
3541. Find Most Frequent Vowel and Consonant
EasyCountingHash TableString
Watch Solutions89.4% 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
3534. Path Existence Queries in a Graph II
HardArrayBinary SearchBit Manipulation
Watch Solutions64.2% acceptance
3539. Find Sum of Array Product of Magical Sequences
HardArrayBit ManipulationBitmask
Watch Solutions61.9% acceptance
3548. Equal Sum Grid Partition II
HardArrayEnumerationHash Table
Watch Solutions39.5% 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
3512. Minimum Operations to Make Array Sum Divisible by K
EasyArrayMath
Watch Solutions92.4% 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
3491. Phone Number Prefix
EasyArraySortingString
Watch Solutions69.9% 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.