FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
34
With Videos
0
Easy
0
Medium
34
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2494. Merge Overlapping Events in the Same Hall
HardDatabase
Watch Solutions32.9% acceptance
2499. Minimum Total Cost to Make Arrays Unequal
HardArrayCountingGreedy
Watch Solutions41.3% acceptance
2503. Maximum Number of Points From Grid Queries
HardArrayBreadth-First SearchHeap (Priority Queue)
Watch Solutions59.3% acceptance
2508. Add Edges to Make Degrees of All Nodes Even
HardGraphHash Table
Watch Solutions36.7% acceptance
2518. Number of Great Partitions
HardArrayDynamic Programming
Watch Solutions33.4% acceptance
2519. Count the Number of K-Big Indices
HardArrayBinary Indexed TreeBinary Search
Watch Solutions53.2% acceptance
2528. Maximize the Minimum Powered City
HardArrayBinary SearchGreedy
Watch Solutions61.8% acceptance
2532. Time to Cross a Bridge
HardArrayHeap (Priority Queue)Simulation
Watch Solutions44.4% acceptance
2534. Time Taken to Cross the Door
HardArrayQueueSimulation
Watch Solutions50.1% acceptance
2538. Difference Between Maximum and Minimum Price Sum
HardArrayDepth-First SearchDynamic Programming
Watch Solutions33.9% acceptance
2547. Minimum Cost to Split an Array
HardArrayCountingDynamic Programming
Watch Solutions44.8% acceptance
2551. Put Marbles in Bags
HardArrayGreedyHeap (Priority Queue)
Watch Solutions72.2% acceptance
2552. Count Increasing Quadruplets
HardArrayBinary Indexed TreeDynamic Programming
Watch Solutions34.6% acceptance
2561. Rearranging Fruits
HardArrayGreedyHash Table
Watch Solutions57.4% acceptance
2573. Find the String with LCP
HardArrayDynamic ProgrammingGreedy
Watch Solutions63.3% acceptance
2577. Minimum Time to Visit a Cell In a Grid
HardArrayBreadth-First SearchGraph
Watch Solutions56.3% acceptance
2603. Collect Coins in a Tree
HardArrayGraphTopological Sort
Watch Solutions39.6% acceptance
2604. Minimum Time to Eat All Grains
HardArrayBinary SearchSorting
Watch Solutions40.8% acceptance
2612. Minimum Reverse Operations
HardArrayBreadth-First SearchOrdered Set
Watch Solutions16.9% acceptance
2617. Minimum Number of Visited Cells in a Grid
HardArrayBreadth-First SearchDynamic Programming
Watch Solutions24.1% acceptance
2630. Memoize II
Hard
Watch Solutions31.5% acceptance
2646. Minimize the Total Price of the Trips
HardArrayDepth-First SearchDynamic Programming
Watch Solutions48.5% acceptance
2650. Design Cancellable Function
Hard
Watch Solutions49.6% acceptance
2659. Make Array Empty
HardArrayBinary Indexed TreeBinary Search
Watch Solutions26.8% acceptance
2675. Array of Objects to Matrix
Hard
Watch Solutions68.4% acceptance
2691. Immutability Helper
Hard
Watch Solutions42.1% acceptance
2699. Modify Graph Edge Weights
HardGraphHeap (Priority Queue)Shortest Path
Watch Solutions55.6% acceptance
2701. Consecutive Transactions with Increasing Amounts
HardDatabase
Watch Solutions33.0% acceptance
2702. Minimum Operations to Make Numbers Non-positive
HardArrayBinary Search
Watch Solutions44.1% acceptance
2709. Greatest Common Divisor Traversal
HardArrayMathNumber Theory
Watch Solutions41.6% acceptance
2713. Maximum Strictly Increasing Cells in a Matrix
HardArrayBinary SearchDynamic Programming
Watch Solutions31.3% acceptance
2714. Find Shortest Path with K Hops
HardGraphHeap (Priority Queue)Shortest Path
Watch Solutions68.7% acceptance
2719. Count of Integers
HardDynamic ProgrammingMathString
Watch Solutions38.9% acceptance
2720. Popularity Percentage
HardDatabase
Watch Solutions52.8% 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.