FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
31
With Videos
0
Easy
31
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
348. Design Tic-Tac-Toe
MediumArrayDesignHash Table
Watch Solutions58.8% acceptance
351. Android Unlock Patterns
MediumBacktrackingBit ManipulationBitmask
Watch Solutions53.8% acceptance
353. Design Snake Game
MediumArrayDesignHash Table
Watch Solutions40.0% acceptance
356. Line Reflection
MediumArrayHash TableMath
Watch Solutions36.3% acceptance
360. Sort Transformed Array
MediumArrayMathSorting
Watch Solutions58.0% acceptance
361. Bomb Enemy
MediumArrayDynamic ProgrammingMatrix
Watch Solutions52.8% acceptance
362. Design Hit Counter
MediumArrayBinary SearchData Stream
Watch Solutions69.6% acceptance
364. Nested List Weight Sum II
MediumBreadth-First SearchDepth-First SearchStack
Watch Solutions66.8% acceptance
366. Find Leaves of Binary Tree
MediumBinary TreeDepth-First SearchTree
Watch Solutions81.4% acceptance
369. Plus One Linked List
MediumLinked ListMath
Watch Solutions61.1% acceptance
370. Range Addition
MediumArrayPrefix Sum
Watch Solutions73.0% acceptance
371. Sum of Two Integers
MediumBit ManipulationMath
Watch Solutions55.9% acceptance
376. Wiggle Subsequence
MediumArrayDynamic ProgrammingGreedy
Watch Solutions49.3% acceptance
377. Combination Sum IV
MediumArrayDynamic Programming
Watch Solutions55.0% acceptance
379. Design Phone Directory
MediumArrayDesignHash Table
Watch Solutions52.7% acceptance
380. Insert Delete GetRandom O(1)
MediumArrayDesignHash Table
Watch Solutions55.3% acceptance
382. Linked List Random Node
MediumLinked ListMathRandomized
Watch Solutions64.7% acceptance
384. Shuffle an Array
MediumArrayDesignMath
Watch Solutions59.6% acceptance
386. Lexicographical Numbers
MediumDepth-First SearchTrie
Watch Solutions76.2% acceptance
395. Longest Substring with At Least K Repeating Characters
MediumDivide and ConquerHash TableSliding Window
Watch Solutions46.2% acceptance
396. Rotate Function
MediumArrayDynamic ProgrammingMath
Watch Solutions54.0% acceptance
398. Random Pick Index
MediumHash TableMathRandomized
Watch Solutions65.0% acceptance
399. Evaluate Division
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions64.1% acceptance
406. Queue Reconstruction by Height
MediumArrayBinary Indexed TreeSegment Tree
Watch Solutions74.6% acceptance
413. Arithmetic Slices
MediumArrayDynamic ProgrammingSliding Window
Watch Solutions65.0% acceptance
416. Partition Equal Subset Sum
MediumArrayDynamic Programming
Watch Solutions49.9% acceptance
418. Sentence Screen Fitting
MediumArrayDynamic ProgrammingString
Watch Solutions36.3% acceptance
419. Battleships in a Board
MediumArrayDepth-First SearchMatrix
Watch Solutions77.4% acceptance
423. Reconstruct Original Digits from English
MediumHash TableMathString
Watch Solutions52.8% acceptance
426. Convert Binary Search Tree to Sorted Doubly Linked List
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions65.2% acceptance
427. Construct Quad Tree
MediumArrayDivide and ConquerMatrix
Watch Solutions78.2% 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.