FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
34
With Videos
0
Easy
0
Medium
34
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2302. Count Subarrays With Score Less Than K
HardArrayBinary SearchPrefix Sum
Watch Solutions62.3% acceptance
2306. Naming a Company
HardArrayBit ManipulationEnumeration
Watch Solutions46.4% acceptance
2307. Check for Contradictions in Equations
HardArrayDepth-First SearchGraph
Watch Solutions43.8% acceptance
2312. Selling Pieces of Wood
HardArrayDynamic ProgrammingMemoization
Watch Solutions52.8% acceptance
2313. Minimum Flips in Binary Tree to Get Result
HardBinary TreeDepth-First SearchDynamic Programming
Watch Solutions56.9% acceptance
2318. Number of Distinct Roll Sequences
HardDynamic ProgrammingMemoization
Watch Solutions58.2% acceptance
2322. Minimum Score After Removals on a Tree
HardArrayBit ManipulationDepth-First Search
Watch Solutions76.2% acceptance
2328. Number of Increasing Paths in a Grid
HardArrayBreadth-First SearchDepth-First Search
Watch Solutions57.4% acceptance
2338. Count the Number of Ideal Arrays
HardCombinatoricsDynamic ProgrammingMath
Watch Solutions57.0% acceptance
2344. Minimum Deletions to Make Array Divisible
HardArrayHeap (Priority Queue)Math
Watch Solutions61.2% acceptance
2350. Shortest Impossible Sequence of Rolls
HardArrayGreedyHash Table
Watch Solutions69.3% acceptance
2354. Number of Excellent Pairs
HardArrayBinary SearchBit Manipulation
Watch Solutions49.1% acceptance
2362. Generate the Invoice
HardDatabase
Watch Solutions75.2% acceptance
2366. Minimum Replacements to Sort the Array
HardArrayGreedyMath
Watch Solutions53.4% acceptance
2371. Minimize Maximum Value in a Grid
HardArrayGraphMatrix
Watch Solutions70.1% acceptance
2386. Find the K-Sum of an Array
HardArrayHeap (Priority Queue)Sorting
Watch Solutions41.4% acceptance
2392. Build a Matrix With Conditions
HardArrayGraphMatrix
Watch Solutions79.5% acceptance
2398. Maximum Number of Robots Within Budget
HardArrayBinary SearchHeap (Priority Queue)
Watch Solutions38.8% acceptance
2402. Meeting Rooms III
HardArrayHash TableHeap (Priority Queue)
Watch Solutions51.6% acceptance
2407. Longest Increasing Subsequence II
HardArrayBinary Indexed TreeDivide and Conquer
Watch Solutions26.1% acceptance
2412. Minimum Money Required Before Transactions
HardArrayGreedySorting
Watch Solutions42.1% acceptance
2416. Sum of Prefix Scores of Strings
HardArrayCountingString
Watch Solutions60.6% acceptance
2426. Number of Pairs Satisfying Inequality
HardArrayBinary Indexed TreeBinary Search
Watch Solutions47.6% acceptance
2435. Paths in Matrix Whose Sum Is Divisible by K
HardArrayDynamic ProgrammingMatrix
Watch Solutions58.7% acceptance
2444. Count Subarrays With Fixed Bounds
HardArrayMonotonic QueueQueue
Watch Solutions69.2% acceptance
2448. Minimum Cost to Make Array Equal
HardArrayBinary SearchGreedy
Watch Solutions46.7% acceptance
2449. Minimum Number of Operations to Make Arrays Similar
HardArrayGreedySorting
Watch Solutions61.8% acceptance
2458. Height of Binary Tree After Subtree Removal Queries
HardArrayBinary TreeBreadth-First Search
Watch Solutions55.0% acceptance
2459. Sort Array by Moving Items to Empty Space
HardArrayGreedySorting
Watch Solutions45.7% acceptance
2463. Minimum Total Distance Traveled
HardArrayDynamic ProgrammingSorting
Watch Solutions63.2% acceptance
2468. Split Message Based on Limit
HardBinary SearchString
Watch Solutions42.1% acceptance
2474. Customers With Strictly Increasing Purchases
HardDatabase
Watch Solutions45.9% acceptance
2488. Count Subarrays With Median K
HardArrayHash TablePrefix Sum
Watch Solutions49.1% acceptance
2493. Divide Nodes Into the Maximum Number of Groups
HardBreadth-First SearchGraphUnion Find
Watch Solutions67.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.