FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
43
With Videos
12
Easy
19
Medium
12
Hard
1601. Maximum Number of Achievable Transfer Requests
HardArrayBacktrackingBit Manipulation
Watch Solutions64.5% acceptance
1602. Find Nearest Right Node in Binary Tree
MediumBinary TreeBreadth-First SearchTree
Watch Solutions75.2% acceptance
1603. Design Parking System
EasyCountingDesignSimulation
Watch Solutions87.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
1606. Find Servers That Handled Most Number of Requests
HardArrayGreedyHeap (Priority Queue)
Watch Solutions45.3% acceptance
1607. Sellers With No Sales
EasyDatabase
Watch Solutions54.4% acceptance
1608. Special Array With X Elements Greater Than or Equal X
EasyArrayBinary SearchSorting
Watch Solutions66.8% acceptance
1609. Even Odd Tree
MediumBinary TreeBreadth-First SearchTree
Watch Solutions67.1% 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
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
1614. Maximum Nesting Depth of the Parentheses
EasyStackString
Watch Solutions84.8% acceptance
1615. Maximal Network Rank
MediumGraph
Watch Solutions65.9% acceptance
1617. Count Subtrees With Max Distance Between Cities
HardBit ManipulationBitmaskDynamic Programming
Watch Solutions67.4% acceptance
1618. Maximum Font to Fit a Sentence in a Screen
MediumArrayBinary SearchInteractive
Watch Solutions62.0% acceptance
1622. Fancy Sequence
HardDesignMathSegment Tree
Watch Solutions41.3% acceptance
1623. All Valid Triplets That Can Represent a Country
EasyDatabase
Watch Solutions81.8% acceptance
1624. Largest Substring Between Two Equal Characters
EasyHash TableString
Watch Solutions68.5% 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
1629. Slowest Key
EasyArrayString
Watch Solutions59.7% acceptance
1630. Arithmetic Subarrays
MediumArrayHash TableSorting
Watch Solutions83.7% acceptance
1632. Rank Transform of a Matrix
HardArrayGraphMatrix
Watch Solutions42.1% acceptance
1633. Percentage of Users Attended a Contest
EasyDatabase
Watch Solutions58.6% acceptance
1634. Add Two Polynomials Represented as Linked Lists
MediumLinked ListMathTwo Pointers
Watch Solutions61.1% acceptance
1635. Hopper Company Queries I
HardDatabase
Watch Solutions47.7% acceptance
1636. Sort Array by Increasing Frequency
EasyArrayHash TableSorting
Watch Solutions80.8% acceptance
1637. Widest Vertical Area Between Two Points Containing No Points
EasyArraySorting
Watch Solutions87.3% acceptance
1638. Count Substrings That Differ by One Character
MediumDynamic ProgrammingEnumerationHash Table
Watch Solutions72.4% acceptance
1639. Number of Ways to Form a Target String Given a Dictionary
HardArrayDynamic ProgrammingString
Watch Solutions56.6% acceptance
1640. Check Array Formation Through Concatenation
EasyArrayHash Table
Watch Solutions57.3% 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
1643. Kth Smallest Instructions
HardArrayCombinatoricsDynamic Programming
Watch Solutions44.7% acceptance
1644. Lowest Common Ancestor of a Binary Tree II
MediumBinary TreeDepth-First SearchTree
Watch Solutions69.6% acceptance
1645. Hopper Company Queries II
HardDatabase
Watch Solutions39.1% acceptance
1646. Get Maximum in Generated Array
EasyArraySimulation
Watch Solutions51.4% 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
1649. Create Sorted Array through Instructions
HardArrayBinary Indexed TreeBinary Search
Watch Solutions42.1% acceptance
1650. Lowest Common Ancestor of a Binary Tree III
MediumBinary TreeHash TableTree
Watch Solutions83.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.