FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
34
With Videos
8
Easy
18
Medium
8
Hard
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
704. Binary Search
EasyArrayBinary Search
Watch Solutions61.2% acceptance
705. Design HashSet
EasyArrayDesignHash Function
Watch Solutions67.9% acceptance
706. Design HashMap
EasyArrayDesignHash Function
Watch Solutions66.5% acceptance
708. Insert into a Sorted Circular Linked List
MediumLinked List
Watch Solutions38.5% acceptance
709. To Lower Case
EasyString
Watch Solutions84.8% acceptance
711. Number of Distinct Islands II
HardBreadth-First SearchDepth-First SearchHash Function
Watch Solutions55.3% acceptance
712. Minimum ASCII Delete Sum for Two Strings
MediumDynamic ProgrammingString
Watch Solutions70.9% acceptance
713. Subarray Product Less Than K
MediumArrayBinary SearchPrefix Sum
Watch Solutions54.8% acceptance
716. Max Stack
HardDesignDoubly-Linked ListLinked List
Watch Solutions45.9% acceptance
717. 1-bit and 2-bit Characters
EasyArray
Watch Solutions49.5% acceptance
718. Maximum Length of Repeated Subarray
MediumArrayBinary SearchDynamic Programming
Watch Solutions51.5% acceptance
719. Find K-th Smallest Pair Distance
HardArrayBinary SearchSorting
Watch Solutions46.4% acceptance
720. Longest Word in Dictionary
MediumArrayHash TableSorting
Watch Solutions55.2% acceptance
721. Accounts Merge
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions61.6% acceptance
722. Remove Comments
MediumArrayString
Watch Solutions40.1% acceptance
723. Candy Crush
MediumArrayMatrixSimulation
Watch Solutions77.6% acceptance
725. Split Linked List in Parts
MediumLinked List
Watch Solutions70.6% acceptance
726. Number of Atoms
HardHash TableSortingStack
Watch Solutions65.1% acceptance
727. Minimum Window Subsequence
HardDynamic ProgrammingSliding WindowString
Watch Solutions43.5% acceptance
729. My Calendar I
MediumArrayBinary SearchDesign
Watch Solutions58.4% acceptance
731. My Calendar II
MediumArrayBinary SearchDesign
Watch Solutions63.3% acceptance
732. My Calendar III
HardBinary SearchDesignOrdered Set
Watch Solutions71.9% acceptance
733. Flood Fill
EasyArrayBreadth-First SearchDepth-First Search
Watch Solutions68.6% acceptance
734. Sentence Similarity
EasyArrayHash TableString
Watch Solutions44.5% acceptance
736. Parse Lisp Expression
HardHash TableRecursionStack
Watch Solutions53.5% acceptance
737. Sentence Similarity II
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions51.2% acceptance
740. Delete and Earn
MediumArrayDynamic ProgrammingHash Table
Watch Solutions57.1% acceptance
742. Closest Leaf in a Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions47.4% acceptance
743. Network Delay Time
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions61.1% acceptance
745. Prefix and Suffix Search
HardArrayDesignHash Table
Watch Solutions41.2% acceptance
747. Largest Number At Least Twice of Others
EasyArraySorting
Watch Solutions52.8% acceptance
750. Number Of Corner Rectangles
MediumArrayDynamic ProgrammingMath
Watch Solutions67.8% 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.