FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
36
With Videos
0
Easy
0
Medium
36
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1463. Cherry Pickup II
HardArrayDynamic ProgrammingMatrix
Watch Solutions72.4% acceptance
1473. Paint House III
HardArrayDynamic Programming
Watch Solutions60.9% acceptance
1478. Allocate Mailboxes
HardArrayDynamic ProgrammingMath
Watch Solutions56.5% acceptance
1479. Sales by Day of the Week
HardDatabase
Watch Solutions77.4% acceptance
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
HardGraphMinimum Spanning TreeSorting
Watch Solutions66.4% acceptance
1499. Max Value of Equation
HardArrayHeap (Priority Queue)Monotonic Queue
Watch Solutions45.0% acceptance
1515. Best Position for a Service Centre
HardArrayGeometryMath
Watch Solutions35.2% acceptance
1516. Move Sub-Tree of N-Ary Tree
HardDepth-First SearchTree
Watch Solutions59.7% acceptance
1526. Minimum Number of Increments on Subarrays to Form a Target Array
HardArrayDynamic ProgrammingGreedy
Watch Solutions78.2% acceptance
1531. String Compression II
HardDynamic ProgrammingString
Watch Solutions52.2% acceptance
1547. Minimum Cost to Cut a Stick
HardArrayDynamic ProgrammingSorting
Watch Solutions62.9% acceptance
1548. The Most Similar Path in a Graph
HardDynamic ProgrammingGraph
Watch Solutions59.2% acceptance
1553. Minimum Number of Days to Eat N Oranges
HardDynamic ProgrammingMemoization
Watch Solutions36.2% acceptance
1568. Minimum Number of Days to Disconnect Island
HardArrayBreadth-First SearchDepth-First Search
Watch Solutions58.8% acceptance
1569. Number of Ways to Reorder Array to Get Same BST
HardArrayBinary Search TreeBinary Tree
Watch Solutions54.0% acceptance
1575. Count All Possible Routes
HardArrayDynamic ProgrammingMemoization
Watch Solutions65.1% acceptance
1579. Remove Max Number of Edges to Keep Graph Fully Traversable
HardGraphUnion Find
Watch Solutions70.1% acceptance
1591. Strange Printer II
HardArrayGraphMatrix
Watch Solutions60.8% acceptance
1595. Minimum Cost to Connect Two Groups of Points
HardArrayBit ManipulationBitmask
Watch Solutions50.3% acceptance
1597. Build Binary Expression Tree From Infix Expression
HardBinary TreeStackString
Watch Solutions62.5% acceptance
1601. Maximum Number of Achievable Transfer Requests
HardArrayBacktrackingBit Manipulation
Watch Solutions64.5% acceptance
1606. Find Servers That Handled Most Number of Requests
HardArrayGreedyHeap (Priority Queue)
Watch Solutions45.3% acceptance
1610. Maximum Number of Visible Points
HardArrayGeometryMath
Watch Solutions38.1% acceptance
1611. Minimum One Bit Operations to Make Integers Zero
HardBit ManipulationDynamic ProgrammingMemoization
Watch Solutions78.5% acceptance
1617. Count Subtrees With Max Distance Between Cities
HardBit ManipulationBitmaskDynamic Programming
Watch Solutions67.4% acceptance
1622. Fancy Sequence
HardDesignMathSegment Tree
Watch Solutions41.3% acceptance
1632. Rank Transform of a Matrix
HardArrayGraphMatrix
Watch Solutions42.1% acceptance
1635. Hopper Company Queries I
HardDatabase
Watch Solutions47.7% acceptance
1639. Number of Ways to Form a Target String Given a Dictionary
HardArrayDynamic ProgrammingString
Watch Solutions56.6% acceptance
1643. Kth Smallest Instructions
HardArrayCombinatoricsDynamic Programming
Watch Solutions44.7% acceptance
1645. Hopper Company Queries II
HardDatabase
Watch Solutions39.1% acceptance
1649. Create Sorted Array through Instructions
HardArrayBinary Indexed TreeBinary Search
Watch Solutions42.1% acceptance
1651. Hopper Company Queries III
HardDatabase
Watch Solutions65.6% acceptance
1665. Minimum Initial Energy to Finish Tasks
HardArrayGreedySorting
Watch Solutions76.5% acceptance
1671. Minimum Number of Removals to Make Mountain Array
HardArrayBinary SearchDynamic Programming
Watch Solutions55.0% acceptance
1675. Minimize Deviation in Array
HardArrayGreedyHeap (Priority Queue)
Watch Solutions54.0% 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.