FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
42
With Videos
0
Easy
42
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2340. Minimum Adjacent Swaps to Make a Valid Array
MediumArrayGreedy
Watch Solutions72.6% acceptance
2342. Max Sum of a Pair With Equal Sum of Digits
MediumArrayHash TableHeap (Priority Queue)
Watch Solutions66.0% acceptance
2343. Query Kth Smallest Trimmed Number
MediumArrayDivide and ConquerHeap (Priority Queue)
Watch Solutions47.9% acceptance
2345. Finding the Number of Visible Mountains
MediumArrayMonotonic StackSorting
Watch Solutions37.3% acceptance
2346. Compute the Rank as a Percentage
MediumDatabase
Watch Solutions33.7% acceptance
2348. Number of Zero-Filled Subarrays
MediumArrayMath
Watch Solutions70.1% acceptance
2349. Design a Number Container System
MediumDesignHash TableHeap (Priority Queue)
Watch Solutions57.1% acceptance
2352. Equal Row and Column Pairs
MediumArrayHash TableMatrix
Watch Solutions70.9% acceptance
2353. Design a Food Rating System
MediumDesignHash TableHeap (Priority Queue)
Watch Solutions52.9% acceptance
2358. Maximum Number of Groups Entering a Competition
MediumArrayBinary SearchGreedy
Watch Solutions68.5% acceptance
2359. Find Closest Node to Given Two Nodes
MediumDepth-First SearchGraph
Watch Solutions53.0% acceptance
2364. Count Number of Bad Pairs
MediumArrayCountingHash Table
Watch Solutions54.2% acceptance
2365. Task Scheduler II
MediumArrayHash TableSimulation
Watch Solutions54.7% acceptance
2369. Check if There is a Valid Partition For The Array
MediumArrayDynamic Programming
Watch Solutions52.5% acceptance
2370. Longest Ideal Subsequence
MediumDynamic ProgrammingHash TableString
Watch Solutions47.1% acceptance
2372. Calculate the Influence of Each Salesperson
MediumDatabase
Watch Solutions83.2% acceptance
2374. Node With Highest Edge Score
MediumGraphHash Table
Watch Solutions49.3% acceptance
2375. Construct Smallest Number From DI String
MediumBacktrackingGreedyStack
Watch Solutions85.6% acceptance
2378. Choose Edges to Maximize Score in a Tree
MediumDepth-First SearchDynamic ProgrammingTree
Watch Solutions56.5% acceptance
2380. Time Needed to Rearrange a Binary String
MediumDynamic ProgrammingSimulationString
Watch Solutions53.3% acceptance
2381. Shifting Letters II
MediumArrayPrefix SumString
Watch Solutions53.6% acceptance
2384. Largest Palindromic Number
MediumCountingGreedyHash Table
Watch Solutions37.1% acceptance
2385. Amount of Time for Binary Tree to Be Infected
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions65.8% acceptance
2387. Median of a Row Wise Sorted Matrix
MediumArrayBinary SearchMatrix
Watch Solutions70.9% acceptance
2388. Change Null Values in a Table to the Previous Value
MediumDatabase
Watch Solutions51.0% acceptance
2391. Minimum Amount of Time to Collect Garbage
MediumArrayPrefix SumString
Watch Solutions85.2% acceptance
2394. Employees With Deductions
MediumDatabase
Watch Solutions41.0% acceptance
2396. Strictly Palindromic Number
MediumBrainteaserMathTwo Pointers
Watch Solutions90.3% acceptance
2400. Number of Ways to Reach a Position After Exactly k Steps
MediumCombinatoricsDynamic ProgrammingMath
Watch Solutions36.8% acceptance
2401. Longest Nice Subarray
MediumArrayBit ManipulationSliding Window
Watch Solutions64.8% acceptance
2405. Optimal Partition of String
MediumGreedyHash TableString
Watch Solutions78.0% acceptance
2406. Divide Intervals Into Minimum Number of Groups
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions63.7% acceptance
2410. Maximum Matching of Players With Trainers
MediumArrayGreedySorting
Watch Solutions75.2% acceptance
2411. Smallest Subarrays With Maximum Bitwise OR
MediumArrayBinary SearchBit Manipulation
Watch Solutions62.0% acceptance
2414. Length of the Longest Alphabetical Continuous Substring
MediumString
Watch Solutions61.0% acceptance
2415. Reverse Odd Levels of Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions86.7% acceptance
2419. Longest Subarray With Maximum Bitwise AND
MediumArrayBit ManipulationBrainteaser
Watch Solutions65.4% acceptance
2420. Find All Good Indices
MediumArrayDynamic ProgrammingPrefix Sum
Watch Solutions40.8% acceptance
2422. Merge Operations to Turn Array Into a Palindrome
MediumArrayGreedyTwo Pointers
Watch Solutions69.0% acceptance
2425. Bitwise XOR of All Pairings
MediumArrayBit ManipulationBrainteaser
Watch Solutions66.9% acceptance
2429. Minimize XOR
MediumBit ManipulationGreedy
Watch Solutions62.4% acceptance
2431. Maximize Total Tastiness of Purchased Fruits
MediumArrayDynamic Programming
Watch Solutions64.6% 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.