FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
38
With Videos
0
Easy
38
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1562. Find Latest Group of Size M
MediumArrayBinary SearchHash Table
Watch Solutions43.8% acceptance
1567. Maximum Length of Subarray With Positive Product
MediumArrayDynamic ProgrammingGreedy
Watch Solutions44.3% acceptance
1570. Dot Product of Two Sparse Vectors
MediumArrayDesignHash Table
Watch Solutions89.9% acceptance
1573. Number of Ways to Split a String
MediumMathString
Watch Solutions34.6% acceptance
1574. Shortest Subarray to be Removed to Make Array Sorted
MediumArrayBinary SearchMonotonic Stack
Watch Solutions51.2% acceptance
1578. Minimum Time to Make Rope Colorful
MediumArrayDynamic ProgrammingGreedy
Watch Solutions65.2% acceptance
1583. Count Unhappy Friends
MediumArraySimulation
Watch Solutions62.6% acceptance
1586. Binary Search Tree Iterator II
MediumBinary Search TreeBinary TreeDesign
Watch Solutions63.4% acceptance
1589. Maximum Sum Obtained of Any Permutation
MediumArrayGreedyPrefix Sum
Watch Solutions41.1% acceptance
1590. Make Sum Divisible by P
MediumArrayHash TablePrefix Sum
Watch Solutions42.6% acceptance
1594. Maximum Non Negative Product in a Matrix
MediumArrayDynamic ProgrammingMatrix
Watch Solutions51.5% acceptance
1596. The Most Frequently Ordered Products for Each Customer
MediumDatabase
Watch Solutions78.3% acceptance
1599. Maximum Profit of Operating a Centennial Wheel
MediumArraySimulation
Watch Solutions44.6% acceptance
1602. Find Nearest Right Node in Binary Tree
MediumBinary TreeBreadth-First SearchTree
Watch Solutions75.2% acceptance
1604. Alert Using Same Key-Card Three or More Times in a One Hour Period
MediumArrayHash TableSorting
Watch Solutions46.0% acceptance
1605. Find Valid Matrix Given Row and Column Sums
MediumArrayGreedyMatrix
Watch Solutions83.0% acceptance
1609. Even Odd Tree
MediumBinary TreeBreadth-First SearchTree
Watch Solutions67.1% acceptance
1612. Check If Two Expression Trees are Equivalent
MediumBinary TreeCountingDepth-First Search
Watch Solutions71.8% acceptance
1613. Find the Missing IDs
MediumDatabase
Watch Solutions73.0% acceptance
1615. Maximal Network Rank
MediumGraph
Watch Solutions65.9% acceptance
1618. Maximum Font to Fit a Sentence in a Screen
MediumArrayBinary SearchInteractive
Watch Solutions62.0% acceptance
1625. Lexicographically Smallest String After Applying Operations
MediumBreadth-First SearchDepth-First SearchEnumeration
Watch Solutions79.4% acceptance
1628. Design an Expression Tree With Evaluate Function
MediumArrayBinary TreeDesign
Watch Solutions82.4% acceptance
1630. Arithmetic Subarrays
MediumArrayHash TableSorting
Watch Solutions83.7% acceptance
1634. Add Two Polynomials Represented as Linked Lists
MediumLinked ListMathTwo Pointers
Watch Solutions61.1% acceptance
1638. Count Substrings That Differ by One Character
MediumDynamic ProgrammingEnumerationHash Table
Watch Solutions72.4% acceptance
1641. Count Sorted Vowel Strings
MediumCombinatoricsDynamic ProgrammingMath
Watch Solutions79.2% acceptance
1642. Furthest Building You Can Reach
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions50.8% acceptance
1644. Lowest Common Ancestor of a Binary Tree II
MediumBinary TreeDepth-First SearchTree
Watch Solutions69.6% acceptance
1647. Minimum Deletions to Make Character Frequencies Unique
MediumGreedyHash TableSorting
Watch Solutions61.3% acceptance
1648. Sell Diminishing-Valued Colored Balls
MediumArrayBinary SearchGreedy
Watch Solutions29.9% acceptance
1650. Lowest Common Ancestor of a Binary Tree III
MediumBinary TreeHash TableTree
Watch Solutions83.0% acceptance
1653. Minimum Deletions to Make String Balanced
MediumDynamic ProgrammingStackString
Watch Solutions68.2% acceptance
1654. Minimum Jumps to Reach Home
MediumArrayBreadth-First SearchDynamic Programming
Watch Solutions30.7% acceptance
1657. Determine if Two Strings Are Close
MediumCountingHash TableSorting
Watch Solutions54.2% acceptance
1658. Minimum Operations to Reduce X to Zero
MediumArrayBinary SearchHash Table
Watch Solutions40.5% acceptance
1660. Correct a Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions74.3% acceptance
1663. Smallest String With A Given Numeric Value
MediumGreedyString
Watch Solutions67.5% 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.