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
429. N-ary Tree Level Order Traversal
MediumBreadth-First SearchTree
Watch Solutions71.6% acceptance
436. Find Right Interval
MediumArrayBinary SearchSorting
Watch Solutions56.1% acceptance
438. Find All Anagrams in a String
MediumHash TableSliding WindowString
Watch Solutions54.1% acceptance
439. Ternary Expression Parser
MediumRecursionStackString
Watch Solutions62.6% acceptance
442. Find All Duplicates in an Array
MediumArrayHash Table
Watch Solutions76.8% acceptance
443. String Compression
MediumStringTwo Pointers
Watch Solutions60.3% acceptance
445. Add Two Numbers II
MediumLinked ListMathStack
Watch Solutions62.5% acceptance
449. Serialize and Deserialize BST
MediumBinary Search TreeBinary TreeBreadth-First Search
Watch Solutions59.5% acceptance
450. Delete Node in a BST
MediumBinary Search TreeBinary TreeTree
Watch Solutions55.1% acceptance
453. Minimum Moves to Equal Array Elements
MediumArrayMath
Watch Solutions58.6% acceptance
454. 4Sum II
MediumArrayHash Table
Watch Solutions57.9% acceptance
456. 132 Pattern
MediumArrayBinary SearchMonotonic Stack
Watch Solutions34.6% acceptance
462. Minimum Moves to Equal Array Elements II
MediumArrayMathSorting
Watch Solutions62.2% acceptance
467. Unique Substrings in Wraparound String
MediumDynamic ProgrammingString
Watch Solutions43.4% acceptance
468. Validate IP Address
MediumString
Watch Solutions28.2% acceptance
469. Convex Polygon
MediumArrayGeometryMath
Watch Solutions40.3% acceptance
470. Implement Rand10() Using Rand7()
MediumMathProbability and StatisticsRandomized
Watch Solutions46.4% acceptance
475. Heaters
MediumArrayBinary SearchSorting
Watch Solutions42.3% acceptance
484. Find Permutation
MediumArrayGreedyStack
Watch Solutions67.0% acceptance
486. Predict the Winner
MediumArrayDynamic ProgrammingGame Theory
Watch Solutions59.7% acceptance
487. Max Consecutive Ones II
MediumArrayDynamic ProgrammingSliding Window
Watch Solutions52.0% acceptance
490. The Maze
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions60.4% acceptance
494. Target Sum
MediumArrayBacktrackingDynamic Programming
Watch Solutions52.6% acceptance
497. Random Point in Non-overlapping Rectangles
MediumArrayBinary SearchMath
Watch Solutions40.2% acceptance
498. Diagonal Traverse
MediumArrayMatrixSimulation
Watch Solutions67.1% acceptance
503. Next Greater Element II
MediumArrayMonotonic StackStack
Watch Solutions68.7% acceptance
505. The Maze II
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions55.0% acceptance
510. Inorder Successor in BST II
MediumBinary Search TreeBinary TreeTree
Watch Solutions60.9% acceptance
513. Find Bottom Left Tree Value
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions72.2% acceptance
515. Find Largest Value in Each Tree Row
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions66.3% acceptance
518. Coin Change II
MediumArrayDynamic Programming
Watch Solutions59.7% 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.