FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
22
With Videos
5
Easy
14
Medium
3
Hard
3542. Minimum Operations to Convert All Elements to Zero
MediumArrayGreedyHash Table
Watch Solutions53.0% acceptance
3516. Find Closest Person
EasyMath
Watch Solutions88.9% acceptance
3508. Implement Router
MediumArrayBinary SearchDesign
Watch Solutions39.1% acceptance
3537. Fill a Special Grid
MediumArrayDivide and ConquerMatrix
Watch Solutions70.8% acceptance
3529. Count Cells in Overlapping Horizontal and Vertical Substrings
MediumArrayHash FunctionMatrix
Watch Solutions27.7% acceptance
3531. Count Covered Buildings
MediumArrayHash TableSorting
Watch Solutions58.8% acceptance
3492. Maximum Containers on a Ship
EasyMath
Watch Solutions75.2% acceptance
3556. Sum of Largest Prime Substrings
MediumHash TableMathNumber Theory
Watch Solutions37.9% acceptance
3466. Maximum Coin Collection
MediumArrayDynamic Programming
Watch Solutions52.8% acceptance
3499. Maximize Active Section with Trade I
MediumEnumerationString
Watch Solutions60.9% acceptance
3598. Longest Common Prefix Between Adjacent Strings After Removals
MediumArrayString
Watch Solutions32.4% acceptance
3494. Find the Minimum Amount of Time to Brew Potions
MediumArrayPrefix SumSimulation
Watch Solutions62.7% acceptance
3503. Longest Palindrome After Substring Concatenation I
MediumDynamic ProgrammingEnumerationString
Watch Solutions43.8% acceptance
3479. Fruits Into Baskets III
MediumArrayBinary SearchOrdered Set
Watch Solutions39.2% acceptance
3477. Fruits Into Baskets II
EasyArrayBinary SearchOrdered Set
Watch Solutions70.2% acceptance
3480. Maximize Subarrays After Removing One Conflicting Pair
HardArrayEnumerationPrefix Sum
Watch Solutions64.6% acceptance
3487. Maximum Unique Subarray Sum After Deletion
EasyArrayGreedyHash Table
Watch Solutions40.5% acceptance
3450. Maximum Students on a Single Bench
EasyArrayHash Table
Watch Solutions87.8% acceptance
3472. Longest Palindromic Subsequence After at Most K Operations
MediumDynamic ProgrammingString
Watch Solutions38.0% acceptance
3468. Find the Number of Copy Arrays
MediumArrayMath
Watch Solutions46.9% acceptance
3485. Longest Common Prefix of K Strings After Removal
HardArrayStringTrie
Watch Solutions24.3% acceptance
3464. Maximize the Distance Between Points on a Square
HardArrayBinary SearchGeometry
Watch Solutions51.3% 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.