FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
29
With Videos
0
Easy
0
Medium
29
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1687. Delivering Boxes from Storage to Ports
HardArrayDynamic ProgrammingHeap (Priority Queue)
Watch Solutions40.1% acceptance
1697. Checking Existence of Edge Length Limited Paths
HardArrayGraphSorting
Watch Solutions63.2% acceptance
1713. Minimum Operations to Make a Subsequence
HardArrayBinary SearchGreedy
Watch Solutions49.7% acceptance
1714. Sum Of Special Evenly-Spaced Elements In Array
HardArrayDynamic Programming
Watch Solutions49.9% acceptance
1728. Cat and Mouse II
HardArrayDynamic ProgrammingGame Theory
Watch Solutions40.4% acceptance
1739. Building Boxes
HardBinary SearchGreedyMath
Watch Solutions52.5% acceptance
1745. Palindrome Partitioning IV
HardDynamic ProgrammingString
Watch Solutions45.2% acceptance
1751. Maximum Number of Events That Can Be Attended II
HardArrayBinary SearchDynamic Programming
Watch Solutions63.6% acceptance
1767. Find the Subtasks That Did Not Execute
HardDatabase
Watch Solutions78.0% acceptance
1770. Maximum Score from Performing Multiplication Operations
HardArrayDynamic Programming
Watch Solutions43.2% acceptance
1771. Maximize Palindrome Length From Subsequences
HardDynamic ProgrammingString
Watch Solutions38.4% acceptance
1787. Make the XOR of All Segments Equal to Zero
HardArrayBit ManipulationDynamic Programming
Watch Solutions41.1% acceptance
1788. Maximize the Beauty of the Garden
HardArrayGreedyHash Table
Watch Solutions64.7% acceptance
1793. Maximum Score of a Good Subarray
HardArrayBinary SearchMonotonic Stack
Watch Solutions64.3% acceptance
1799. Maximize Score After N Operations
HardArrayBacktrackingBit Manipulation
Watch Solutions57.8% acceptance
1803. Count Pairs With XOR in a Range
HardArrayBit ManipulationTrie
Watch Solutions46.3% acceptance
1808. Maximize Number of Nice Divisors
HardMathNumber TheoryRecursion
Watch Solutions36.7% acceptance
1815. Maximum Number of Groups Getting Fresh Donuts
HardArrayBit ManipulationBitmask
Watch Solutions41.7% acceptance
1825. Finding MK Average
HardData StreamDesignHeap (Priority Queue)
Watch Solutions38.7% acceptance
1830. Minimum Number of Operations to Make String Sorted
HardCombinatoricsMathString
Watch Solutions50.4% acceptance
1835. Find XOR Sum of All Pairs Bitwise AND
HardArrayBit ManipulationMath
Watch Solutions62.6% acceptance
1840. Maximum Building Height
HardArrayMathSorting
Watch Solutions67.1% acceptance
1842. Next Palindrome Using Same Digits
HardStringTwo Pointers
Watch Solutions54.2% acceptance
1857. Largest Color Value in a Directed Graph
HardCountingDynamic ProgrammingGraph
Watch Solutions57.3% acceptance
1883. Minimum Skips to Arrive at Meeting On Time
HardArrayDynamic Programming
Watch Solutions38.9% acceptance
1889. Minimum Space Wasted From Packaging
HardArrayBinary SearchPrefix Sum
Watch Solutions33.6% acceptance
1892. Page Recommendations II
HardDatabase
Watch Solutions44.4% acceptance
1896. Minimum Cost to Change the Final Value of Expression
HardDynamic ProgrammingMathStack
Watch Solutions50.0% acceptance
1900. The Earliest and Latest Rounds Where Players Compete
HardDynamic ProgrammingMemoization
Watch Solutions72.1% 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.