FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
18
With Videos
0
Easy
0
Medium
18
Hard
Filter by Difficulty
Browse video solutions by difficulty level
3320. Count The Number of Winning Sequences
HardDynamic ProgrammingString
Watch Solutions32.4% acceptance
3321. Find X-Sum of All K-Long Subarrays II
HardArrayHash TableHeap (Priority Queue)
Watch Solutions41.1% acceptance
3327. Check if DFS Strings Are Palindromes
HardArrayDepth-First SearchHash Function
Watch Solutions20.9% acceptance
3333. Find the Original Typed String II
HardDynamic ProgrammingPrefix SumString
Watch Solutions45.6% acceptance
3336. Find the Number of Subsequences With Equal GCD
HardArrayDynamic ProgrammingMath
Watch Solutions66.7% acceptance
3337. Total Characters in String After Transformations II
HardCountingDynamic ProgrammingHash Table
Watch Solutions58.0% acceptance
3343. Count Number of Balanced Permutations
HardCombinatoricsDynamic ProgrammingMath
Watch Solutions49.1% acceptance
3347. Maximum Frequency of an Element After Performing Operations II
HardArrayBinary SearchPrefix Sum
Watch Solutions53.8% acceptance
3351. Sum of Good Subsequences
HardArrayDynamic ProgrammingHash Table
Watch Solutions30.9% acceptance
3363. Find the Maximum Number of Fruits Collected
HardArrayDynamic ProgrammingMatrix
Watch Solutions65.1% acceptance
3368. First Letter Capitalization
HardDatabase
Watch Solutions87.7% acceptance
3374. First Letter Capitalization II
HardDatabase
Watch Solutions90.0% acceptance
3855. Sum of K-Digit Numbers in a Range
HardCombinatoricsDivide and ConquerMath
Watch Solutions50.5% acceptance
3878. Count Good Subarrays
HardArrayBit ManipulationMonotonic Stack
Watch Solutions25.6% acceptance
3836. Maximum Score Using Exactly K Pairs
HardArrayDynamic Programming
Watch Solutions41.4% acceptance
3748. Count Stable Subarrays
HardArrayBinary SearchPrefix Sum
Watch Solutions33.0% acceptance
3739. Count Subarrays With Majority Element II
HardArrayDivide and ConquerHash Table
Watch Solutions65.2% acceptance
3786. Total Sum of Interaction Cost in Tree Groups
HardArrayDepth-First SearchTree
Watch Solutions54.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.