FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
32
With Videos
6
Easy
18
Medium
8
Hard
651. 4 Keys Keyboard
MediumDynamic ProgrammingMath
Watch Solutions56.5% acceptance
652. Find Duplicate Subtrees
MediumBinary TreeDepth-First SearchHash Table
Watch Solutions60.6% acceptance
654. Maximum Binary Tree
MediumArrayBinary TreeDivide and Conquer
Watch Solutions86.3% acceptance
655. Print Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions66.5% acceptance
656. Coin Path
HardArrayDynamic Programming
Watch Solutions34.2% acceptance
657. Robot Return to Origin
EasySimulationString
Watch Solutions78.0% acceptance
659. Split Array into Consecutive Subsequences
MediumArrayGreedyHash Table
Watch Solutions52.1% acceptance
660. Remove 9
HardMath
Watch Solutions57.3% acceptance
663. Equal Tree Partition
MediumBinary TreeDepth-First SearchTree
Watch Solutions42.3% acceptance
664. Strange Printer
HardDynamic ProgrammingString
Watch Solutions61.0% acceptance
665. Non-decreasing Array
MediumArray
Watch Solutions25.5% acceptance
666. Path Sum IV
MediumArrayBinary TreeDepth-First Search
Watch Solutions62.5% acceptance
667. Beautiful Arrangement II
MediumArrayMath
Watch Solutions61.1% acceptance
669. Trim a Binary Search Tree
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions66.9% acceptance
670. Maximum Swap
MediumGreedyMath
Watch Solutions51.6% acceptance
671. Second Minimum Node In a Binary Tree
EasyBinary TreeDepth-First SearchTree
Watch Solutions46.0% acceptance
676. Implement Magic Dictionary
MediumDepth-First SearchDesignHash Table
Watch Solutions57.8% acceptance
679. 24 Game
HardArrayBacktrackingMath
Watch Solutions59.4% acceptance
681. Next Closest Time
MediumBacktrackingEnumerationHash Table
Watch Solutions46.8% acceptance
682. Baseball Game
EasyArraySimulationStack
Watch Solutions80.8% acceptance
683. K Empty Slots
HardArrayBinary Indexed TreeHeap (Priority Queue)
Watch Solutions38.0% acceptance
688. Knight Probability in Chessboard
MediumDynamic Programming
Watch Solutions57.0% acceptance
689. Maximum Sum of 3 Non-Overlapping Subarrays
HardArrayDynamic Programming
Watch Solutions59.8% acceptance
690. Employee Importance
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions69.4% acceptance
691. Stickers to Spell Word
HardArrayBacktrackingBit Manipulation
Watch Solutions50.7% acceptance
693. Binary Number with Alternating Bits
EasyBit Manipulation
Watch Solutions69.8% acceptance
694. Number of Distinct Islands
MediumBreadth-First SearchDepth-First SearchHash Function
Watch Solutions62.8% acceptance
695. Max Area of Island
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions73.9% acceptance
696. Count Binary Substrings
EasyStringTwo Pointers
Watch Solutions70.3% acceptance
697. Degree of an Array
EasyArrayHash Table
Watch Solutions58.2% acceptance
698. Partition to K Equal Sum Subsets
MediumArrayBacktrackingBit Manipulation
Watch Solutions38.6% acceptance
699. Falling Squares
HardArrayOrdered SetSegment Tree
Watch Solutions48.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.