FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
34
With Videos
8
Easy
20
Medium
6
Hard
901. Online Stock Span
MediumData StreamDesignMonotonic Stack
Watch Solutions69.5% acceptance
903. Valid Permutations for DI Sequence
HardDynamic ProgrammingPrefix SumString
Watch Solutions56.3% acceptance
905. Sort Array By Parity
EasyArraySortingTwo Pointers
Watch Solutions76.2% acceptance
906. Super Palindromes
HardEnumerationMath
Watch Solutions39.9% acceptance
909. Snakes and Ladders
MediumArrayBreadth-First SearchMatrix
Watch Solutions48.0% acceptance
910. Smallest Range II
MediumArrayGreedyMath
Watch Solutions37.8% acceptance
911. Online Election
MediumArrayBinary SearchDesign
Watch Solutions52.8% acceptance
912. Sort an Array
MediumArrayBucket SortCounting Sort
Watch Solutions55.9% acceptance
914. X of a Kind in a Deck of Cards
EasyArrayCountingHash Table
Watch Solutions30.4% acceptance
915. Partition Array into Disjoint Intervals
MediumArray
Watch Solutions49.4% acceptance
916. Word Subsets
MediumArrayHash TableString
Watch Solutions55.9% acceptance
919. Complete Binary Tree Inserter
MediumBinary TreeBreadth-First SearchDesign
Watch Solutions65.0% acceptance
920. Number of Music Playlists
HardCombinatoricsDynamic ProgrammingMath
Watch Solutions60.3% acceptance
921. Minimum Add to Make Parentheses Valid
MediumGreedyStackString
Watch Solutions74.7% acceptance
922. Sort Array By Parity II
EasyArraySortingTwo Pointers
Watch Solutions71.4% acceptance
923. 3Sum With Multiplicity
MediumArrayCountingHash Table
Watch Solutions46.2% acceptance
924. Minimize Malware Spread
HardArrayBreadth-First SearchDepth-First Search
Watch Solutions43.0% acceptance
925. Long Pressed Name
EasyStringTwo Pointers
Watch Solutions32.8% acceptance
926. Flip String to Monotone Increasing
MediumDynamic ProgrammingString
Watch Solutions61.5% acceptance
927. Three Equal Parts
HardArrayMath
Watch Solutions41.3% acceptance
929. Unique Email Addresses
EasyArrayHash TableString
Watch Solutions67.9% acceptance
931. Minimum Falling Path Sum
MediumArrayDynamic ProgrammingMatrix
Watch Solutions60.8% acceptance
934. Shortest Bridge
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions59.3% acceptance
935. Knight Dialer
MediumDynamic Programming
Watch Solutions61.8% acceptance
936. Stamping The Sequence
HardGreedyQueueStack
Watch Solutions62.2% acceptance
937. Reorder Data in Log Files
MediumArraySortingString
Watch Solutions56.6% acceptance
938. Range Sum of BST
EasyBinary Search TreeBinary TreeDepth-First Search
Watch Solutions87.2% acceptance
939. Minimum Area Rectangle
MediumArrayGeometryHash Table
Watch Solutions55.4% acceptance
942. DI String Match
EasyArrayGreedyString
Watch Solutions81.0% acceptance
944. Delete Columns to Make Sorted
EasyArrayString
Watch Solutions78.1% acceptance
945. Minimum Increment to Make Array Unique
MediumArrayCountingGreedy
Watch Solutions60.7% acceptance
948. Bag of Tokens
MediumArrayGreedySorting
Watch Solutions59.5% acceptance
949. Largest Time for Given Digits
MediumArrayEnumerationString
Watch Solutions36.0% acceptance
950. Reveal Cards In Increasing Order
MediumArrayQueueSimulation
Watch Solutions83.6% 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.