FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
28
With Videos
6
Easy
16
Medium
6
Hard
3351. Sum of Good Subsequences
HardArrayDynamic ProgrammingHash Table
Watch Solutions30.9% acceptance
3353. Minimum Total Operations
EasyArray
Watch Solutions63.8% acceptance
3354. Make Array Elements Equal to Zero
EasyArrayPrefix SumSimulation
Watch Solutions68.3% acceptance
3355. Zero Array Transformation I
MediumArrayPrefix Sum
Watch Solutions54.5% acceptance
3356. Zero Array Transformation II
MediumArrayBinary SearchPrefix Sum
Watch Solutions43.6% acceptance
3358. Books with NULL Ratings
EasyDatabase
Watch Solutions89.4% acceptance
3362. Zero Array Transformation III
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions54.9% acceptance
3363. Find the Maximum Number of Fruits Collected
HardArrayDynamic ProgrammingMatrix
Watch Solutions65.1% acceptance
3365. Rearrange K Substrings to Form Target String
MediumHash TableSortingString
Watch Solutions56.7% acceptance
3366. Minimum Array Sum
MediumArrayDynamic Programming
Watch Solutions31.7% acceptance
3368. First Letter Capitalization
HardDatabase
Watch Solutions87.7% acceptance
3370. Smallest Number With All Set Bits
EasyBit ManipulationMath
Watch Solutions80.4% acceptance
3371. Identify the Largest Outlier in an Array
MediumArrayCountingEnumeration
Watch Solutions36.2% acceptance
3372. Maximize the Number of Target Nodes After Connecting Trees I
MediumBreadth-First SearchDepth-First SearchTree
Watch Solutions69.5% acceptance
3374. First Letter Capitalization II
HardDatabase
Watch Solutions90.0% acceptance
3868. Minimum Cost to Equalize Arrays Using Swaps
MediumArrayCountingGreedy
Watch Solutions48.7% acceptance
3861. Minimum Capacity Box
EasyArray
Watch Solutions72.8% acceptance
3867. Sum of GCD of Formed Pairs
MediumArrayMathNumber Theory
Watch Solutions75.1% acceptance
3862. Find the Smallest Balanced Index
MediumArrayPrefix Sum
Watch Solutions19.2% acceptance
3855. Sum of K-Digit Numbers in a Range
HardCombinatoricsDivide and ConquerMath
Watch Solutions50.5% acceptance
3872. Longest Arithmetic Sequence After Changing At Most One Element
MediumArrayEnumeration
Watch Solutions21.4% acceptance
3856. Trim Trailing Vowels
EasyString
Watch Solutions77.2% acceptance
3848. Check Digitorial Permutation
MediumCountingMath
Watch Solutions46.5% acceptance
3878. Count Good Subarrays
HardArrayBit ManipulationMonotonic Stack
Watch Solutions25.6% acceptance
3844. Longest Almost-Palindromic Substring
MediumDynamic ProgrammingStringTwo Pointers
Watch Solutions22.8% acceptance
3863. Minimum Operations to Sort a String
MediumString
Watch Solutions19.1% acceptance
3854. Minimum Operations to Make Array Parity Alternating
MediumArrayGreedy
Watch Solutions17.1% acceptance
3843. First Element with Unique Frequency
MediumArrayCountingHash Table
Watch Solutions69.9% 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.