FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
31
With Videos
0
Easy
0
Medium
31
Hard
Filter by Difficulty
Browse video solutions by difficulty level
772. Basic Calculator III
HardMathRecursionStack
Watch Solutions53.2% acceptance
773. Sliding Puzzle
HardArrayBacktrackingBreadth-First Search
Watch Solutions74.3% acceptance
774. Minimize Max Distance to Gas Station
HardArrayBinary Search
Watch Solutions53.9% acceptance
780. Reaching Points
HardMath
Watch Solutions34.3% acceptance
782. Transform to Chessboard
HardArrayBit ManipulationMath
Watch Solutions51.3% acceptance
798. Smallest Rotation with Highest Score
HardArrayPrefix Sum
Watch Solutions54.2% acceptance
810. Chalkboard XOR Game
HardArrayBit ManipulationBrainteaser
Watch Solutions66.7% acceptance
815. Bus Routes
HardArrayBreadth-First SearchHash Table
Watch Solutions47.3% acceptance
818. Race Car
HardDynamic Programming
Watch Solutions44.7% acceptance
827. Making A Large Island
HardArrayBreadth-First SearchDepth-First Search
Watch Solutions57.0% acceptance
828. Count Unique Characters of All Substrings of a Given String
HardDynamic ProgrammingHash TableString
Watch Solutions53.5% acceptance
829. Consecutive Numbers Sum
HardEnumerationMath
Watch Solutions42.6% acceptance
839. Similar String Groups
HardArrayBreadth-First SearchDepth-First Search
Watch Solutions56.1% acceptance
843. Guess the Word
HardArrayGame TheoryInteractive
Watch Solutions36.9% acceptance
847. Shortest Path Visiting All Nodes
HardBit ManipulationBitmaskBreadth-First Search
Watch Solutions65.9% acceptance
857. Minimum Cost to Hire K Workers
HardArrayGreedyHeap (Priority Queue)
Watch Solutions63.5% acceptance
862. Shortest Subarray with Sum at Least K
HardArrayBinary SearchHeap (Priority Queue)
Watch Solutions32.7% acceptance
879. Profitable Schemes
HardArrayDynamic Programming
Watch Solutions48.1% acceptance
882. Reachable Nodes In Subdivided Graph
HardGraphHeap (Priority Queue)Shortest Path
Watch Solutions52.5% acceptance
887. Super Egg Drop
HardBinary SearchDynamic ProgrammingMath
Watch Solutions30.6% acceptance
899. Orderly Queue
HardMathSortingString
Watch Solutions66.8% acceptance
903. Valid Permutations for DI Sequence
HardDynamic ProgrammingPrefix SumString
Watch Solutions56.3% acceptance
906. Super Palindromes
HardEnumerationMath
Watch Solutions39.9% acceptance
920. Number of Music Playlists
HardCombinatoricsDynamic ProgrammingMath
Watch Solutions60.3% acceptance
924. Minimize Malware Spread
HardArrayBreadth-First SearchDepth-First Search
Watch Solutions43.0% acceptance
927. Three Equal Parts
HardArrayMath
Watch Solutions41.3% acceptance
936. Stamping The Sequence
HardGreedyQueueStack
Watch Solutions62.2% acceptance
956. Tallest Billboard
HardArrayDynamic Programming
Watch Solutions52.0% acceptance
960. Delete Columns to Make Sorted III
HardArrayDynamic ProgrammingString
Watch Solutions72.7% acceptance
964. Least Operators to Express Number
HardDynamic ProgrammingMathMemoization
Watch Solutions48.3% acceptance
968. Binary Tree Cameras
HardBinary TreeDepth-First SearchDynamic Programming
Watch Solutions47.7% 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.