FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
38
With Videos
0
Easy
0
Medium
38
Hard
Filter by Difficulty
Browse video solutions by difficulty level
564. Find the Closest Palindrome
HardMathString
Watch Solutions31.6% acceptance
568. Maximum Vacation Days
HardArrayDynamic ProgrammingMatrix
Watch Solutions46.7% acceptance
569. Median Employee Salary
HardDatabase
Watch Solutions65.9% acceptance
571. Find Median Given Frequency of Numbers
HardDatabase
Watch Solutions42.4% acceptance
579. Find Cumulative Salary of an Employee
HardDatabase
Watch Solutions47.8% acceptance
588. Design In-Memory File System
HardDesignHash TableSorting
Watch Solutions48.0% acceptance
601. Human Traffic of Stadium
HardDatabase
Watch Solutions49.1% acceptance
615. Average Salary: Departments VS Company
HardDatabase
Watch Solutions56.2% acceptance
618. Students Report By Geography
HardDatabase
Watch Solutions63.5% acceptance
629. K Inverse Pairs Array
HardDynamic Programming
Watch Solutions49.2% acceptance
631. Design Excel Sum Formula
HardArrayDesignGraph
Watch Solutions39.9% acceptance
632. Smallest Range Covering Elements from K Lists
HardArrayGreedyHash Table
Watch Solutions70.3% acceptance
639. Decode Ways II
HardDynamic ProgrammingString
Watch Solutions31.8% acceptance
642. Design Search Autocomplete System
HardData StreamDepth-First SearchDesign
Watch Solutions49.9% acceptance
644. Maximum Average Subarray II
HardArrayBinary SearchPrefix Sum
Watch Solutions37.7% acceptance
656. Coin Path
HardArrayDynamic Programming
Watch Solutions34.2% acceptance
660. Remove 9
HardMath
Watch Solutions57.3% acceptance
664. Strange Printer
HardDynamic ProgrammingString
Watch Solutions61.0% acceptance
668. Kth Smallest Number in Multiplication Table
HardBinary SearchMath
Watch Solutions54.5% acceptance
679. 24 Game
HardArrayBacktrackingMath
Watch Solutions59.4% acceptance
683. K Empty Slots
HardArrayBinary Indexed TreeHeap (Priority Queue)
Watch Solutions38.0% acceptance
689. Maximum Sum of 3 Non-Overlapping Subarrays
HardArrayDynamic Programming
Watch Solutions59.8% acceptance
691. Stickers to Spell Word
HardArrayBacktrackingBit Manipulation
Watch Solutions50.7% acceptance
699. Falling Squares
HardArrayOrdered SetSegment Tree
Watch Solutions48.3% acceptance
711. Number of Distinct Islands II
HardBreadth-First SearchDepth-First SearchHash Function
Watch Solutions55.3% acceptance
716. Max Stack
HardDesignDoubly-Linked ListLinked List
Watch Solutions45.9% acceptance
719. Find K-th Smallest Pair Distance
HardArrayBinary SearchSorting
Watch Solutions46.4% acceptance
726. Number of Atoms
HardHash TableSortingStack
Watch Solutions65.1% acceptance
727. Minimum Window Subsequence
HardDynamic ProgrammingSliding WindowString
Watch Solutions43.5% acceptance
732. My Calendar III
HardBinary SearchDesignOrdered Set
Watch Solutions71.9% acceptance
736. Parse Lisp Expression
HardHash TableRecursionStack
Watch Solutions53.5% acceptance
745. Prefix and Suffix Search
HardArrayDesignHash Table
Watch Solutions41.2% acceptance
753. Cracking the Safe
HardDepth-First SearchEulerian CircuitGraph
Watch Solutions58.5% acceptance
757. Set Intersection Size At Least Two
HardArrayGreedySorting
Watch Solutions58.0% acceptance
759. Employee Free Time
HardArrayHeap (Priority Queue)Sorting
Watch Solutions72.9% acceptance
761. Special Binary String
HardRecursionString
Watch Solutions79.4% acceptance
768. Max Chunks To Make Sorted II
HardArrayGreedyMonotonic Stack
Watch Solutions54.7% acceptance
770. Basic Calculator IV
HardHash TableMathRecursion
Watch Solutions49.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.