FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
40
With Videos
0
Easy
40
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
900. RLE Iterator
MediumArrayCountingDesign
Watch Solutions59.6% acceptance
901. Online Stock Span
MediumData StreamDesignMonotonic Stack
Watch Solutions69.5% 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
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
921. Minimum Add to Make Parentheses Valid
MediumGreedyStackString
Watch Solutions74.7% acceptance
923. 3Sum With Multiplicity
MediumArrayCountingHash Table
Watch Solutions46.2% acceptance
926. Flip String to Monotone Increasing
MediumDynamic ProgrammingString
Watch Solutions61.5% 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
937. Reorder Data in Log Files
MediumArraySortingString
Watch Solutions56.6% acceptance
939. Minimum Area Rectangle
MediumArrayGeometryHash Table
Watch Solutions55.4% 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
951. Flip Equivalent Binary Trees
MediumBinary TreeDepth-First SearchTree
Watch Solutions69.8% acceptance
954. Array of Doubled Pairs
MediumArrayGreedyHash Table
Watch Solutions39.7% acceptance
955. Delete Columns to Make Sorted II
MediumArrayGreedyString
Watch Solutions49.7% acceptance
957. Prison Cells After N Days
MediumArrayBit ManipulationHash Table
Watch Solutions39.0% acceptance
958. Check Completeness of a Binary Tree
MediumBinary TreeBreadth-First SearchTree
Watch Solutions59.0% acceptance
959. Regions Cut By Slashes
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions77.8% acceptance
962. Maximum Width Ramp
MediumArrayMonotonic StackStack
Watch Solutions55.5% acceptance
963. Minimum Area Rectangle II
MediumArrayGeometryMath
Watch Solutions55.9% acceptance
966. Vowel Spellchecker
MediumArrayHash TableString
Watch Solutions61.4% acceptance
967. Numbers With Same Consecutive Differences
MediumBacktrackingBreadth-First Search
Watch Solutions59.1% acceptance
969. Pancake Sorting
MediumArrayGreedySorting
Watch Solutions71.7% acceptance
970. Powerful Integers
MediumEnumerationHash TableMath
Watch Solutions44.5% acceptance
971. Flip Binary Tree To Match Preorder Traversal
MediumBinary TreeDepth-First SearchTree
Watch Solutions51.9% acceptance
978. Longest Turbulent Subarray
MediumArrayDynamic ProgrammingSliding Window
Watch Solutions49.0% acceptance
979. Distribute Coins in Binary Tree
MediumBinary TreeDepth-First SearchTree
Watch Solutions77.2% acceptance
981. Time Based Key-Value Store
MediumBinary SearchDesignHash Table
Watch Solutions49.8% acceptance
983. Minimum Cost For Tickets
MediumArrayDynamic Programming
Watch Solutions67.4% acceptance
985. Sum of Even Numbers After Queries
MediumArraySimulation
Watch Solutions68.8% acceptance
986. Interval List Intersections
MediumArrayTwo Pointers
Watch Solutions73.0% 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.