FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
38
With Videos
14
Easy
18
Medium
6
Hard
1651. Hopper Company Queries III
HardDatabase
Watch Solutions65.6% acceptance
1652. Defuse the Bomb
EasyArraySliding Window
Watch Solutions79.2% 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
1656. Design an Ordered Stream
EasyArrayData StreamDesign
Watch Solutions82.6% acceptance
1657. Determine if Two Strings Are Close
MediumCountingHash TableSorting
Watch Solutions54.2% acceptance
1660. Correct a Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions74.3% acceptance
1661. Average Time of Process per Machine
EasyDatabase
Watch Solutions68.7% acceptance
1663. Smallest String With A Given Numeric Value
MediumGreedyString
Watch Solutions67.5% acceptance
1664. Ways to Make a Fair Array
MediumArrayPrefix Sum
Watch Solutions67.2% acceptance
1665. Minimum Initial Energy to Finish Tasks
HardArrayGreedySorting
Watch Solutions76.5% acceptance
1667. Fix Names in a Table
EasyDatabase
Watch Solutions61.3% acceptance
1668. Maximum Repeating Substring
EasyDynamic ProgrammingStringString Matching
Watch Solutions41.9% acceptance
1669. Merge In Between Linked Lists
MediumLinked List
Watch Solutions82.9% acceptance
1671. Minimum Number of Removals to Make Mountain Array
HardArrayBinary SearchDynamic Programming
Watch Solutions55.0% acceptance
1672. Richest Customer Wealth
EasyArrayMatrix
Watch Solutions88.9% acceptance
1674. Minimum Moves to Make Array Complementary
MediumArrayHash TablePrefix Sum
Watch Solutions65.2% acceptance
1675. Minimize Deviation in Array
HardArrayGreedyHeap (Priority Queue)
Watch Solutions54.0% acceptance
1676. Lowest Common Ancestor of a Binary Tree IV
MediumBinary TreeDepth-First SearchHash Table
Watch Solutions79.6% acceptance
1677. Product's Worth Over Invoices
EasyDatabase
Watch Solutions38.2% acceptance
1678. Goal Parser Interpretation
EasyString
Watch Solutions88.0% acceptance
1679. Max Number of K-Sum Pairs
MediumArrayHash TableSorting
Watch Solutions56.9% acceptance
1680. Concatenation of Consecutive Binary Numbers
MediumBit ManipulationMathSimulation
Watch Solutions66.6% acceptance
1682. Longest Palindromic Subsequence II
MediumDynamic ProgrammingString
Watch Solutions50.1% acceptance
1683. Invalid Tweets
EasyDatabase
Watch Solutions85.6% acceptance
1684. Count the Number of Consistent Strings
EasyArrayBit ManipulationCounting
Watch Solutions88.1% acceptance
1685. Sum of Absolute Differences in a Sorted Array
MediumArrayMathPrefix Sum
Watch Solutions68.2% acceptance
1687. Delivering Boxes from Storage to Ports
HardArrayDynamic ProgrammingHeap (Priority Queue)
Watch Solutions40.1% acceptance
1688. Count of Matches in Tournament
EasyMathSimulation
Watch Solutions86.4% acceptance
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
MediumGreedyString
Watch Solutions90.5% acceptance
1693. Daily Leads and Partners
EasyDatabase
Watch Solutions86.6% acceptance
1694. Reformat Phone Number
EasyString
Watch Solutions67.7% acceptance
1695. Maximum Erasure Value
MediumArrayHash TableSliding Window
Watch Solutions64.2% acceptance
1696. Jump Game VI
MediumArrayDynamic ProgrammingHeap (Priority Queue)
Watch Solutions46.4% acceptance
1697. Checking Existence of Edge Length Limited Paths
HardArrayGraphSorting
Watch Solutions63.2% acceptance
1698. Number of Distinct Substrings in a String
MediumHash FunctionRolling HashString
Watch Solutions64.4% acceptance
1699. Number of Calls Between Two Persons
MediumDatabase
Watch Solutions81.1% acceptance
1700. Number of Students Unable to Eat Lunch
EasyArrayQueueSimulation
Watch Solutions79.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.