FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
35
With Videos
0
Easy
35
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
614. Second Degree Follower
MediumDatabase
Watch Solutions39.3% acceptance
616. Add Bold Tag in String
MediumArrayHash TableString
Watch Solutions51.4% acceptance
621. Task Scheduler
MediumArrayCountingGreedy
Watch Solutions63.4% acceptance
623. Add One Row to Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions64.1% acceptance
624. Maximum Distance in Arrays
MediumArrayGreedy
Watch Solutions45.7% acceptance
625. Minimum Factorization
MediumGreedyMath
Watch Solutions34.2% acceptance
626. Exchange Seats
MediumDatabase
Watch Solutions71.6% acceptance
634. Find the Derangement of An Array
MediumDynamic ProgrammingMath
Watch Solutions41.9% acceptance
635. Design Log Storage System
MediumDesignHash TableOrdered Set
Watch Solutions59.2% acceptance
636. Exclusive Time of Functions
MediumArrayStack
Watch Solutions66.2% acceptance
638. Shopping Offers
MediumArrayBacktrackingBit Manipulation
Watch Solutions52.3% acceptance
641. Design Circular Deque
MediumArrayDesignLinked List
Watch Solutions64.6% acceptance
648. Replace Words
MediumArrayHash TableString
Watch Solutions68.7% acceptance
650. 2 Keys Keyboard
MediumDynamic ProgrammingMath
Watch Solutions59.6% acceptance
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
659. Split Array into Consecutive Subsequences
MediumArrayGreedyHash Table
Watch Solutions52.1% acceptance
663. Equal Tree Partition
MediumBinary TreeDepth-First SearchTree
Watch Solutions42.3% 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
673. Number of Longest Increasing Subsequence
MediumArrayBinary Indexed TreeDynamic Programming
Watch Solutions52.2% acceptance
676. Implement Magic Dictionary
MediumDepth-First SearchDesignHash Table
Watch Solutions57.8% acceptance
681. Next Closest Time
MediumBacktrackingEnumerationHash Table
Watch Solutions46.8% acceptance
688. Knight Probability in Chessboard
MediumDynamic Programming
Watch Solutions57.0% acceptance
690. Employee Importance
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions69.4% 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
698. Partition to K Equal Sum Subsets
MediumArrayBacktrackingBit Manipulation
Watch Solutions38.6% acceptance
701. Insert into a Binary Search Tree
MediumBinary Search TreeBinary TreeTree
Watch Solutions73.6% acceptance
702. Search in a Sorted Array of Unknown Size
MediumArrayBinary SearchInteractive
Watch Solutions73.1% 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.