FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
34
With Videos
10
Easy
18
Medium
6
Hard
852. Peak Index in a Mountain Array
MediumArrayBinary Search
Watch Solutions66.9% acceptance
855. Exam Room
MediumDesignHeap (Priority Queue)Ordered Set
Watch Solutions43.6% acceptance
856. Score of Parentheses
MediumStackString
Watch Solutions63.9% acceptance
857. Minimum Cost to Hire K Workers
HardArrayGreedyHeap (Priority Queue)
Watch Solutions63.5% acceptance
858. Mirror Reflection
MediumGeometryMathNumber Theory
Watch Solutions62.3% acceptance
859. Buddy Strings
EasyHash TableString
Watch Solutions34.0% acceptance
860. Lemonade Change
EasyArrayGreedy
Watch Solutions59.0% acceptance
861. Score After Flipping Matrix
MediumArrayBit ManipulationGreedy
Watch Solutions80.3% acceptance
862. Shortest Subarray with Sum at Least K
HardArrayBinary SearchHeap (Priority Queue)
Watch Solutions32.7% acceptance
865. Smallest Subtree with all the Deepest Nodes
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions77.5% acceptance
867. Transpose Matrix
EasyArrayMatrixSimulation
Watch Solutions76.8% acceptance
868. Binary Gap
EasyBit Manipulation
Watch Solutions74.2% acceptance
869. Reordered Power of 2
MediumCountingEnumerationHash Table
Watch Solutions66.0% acceptance
872. Leaf-Similar Trees
EasyBinary TreeDepth-First SearchTree
Watch Solutions70.0% acceptance
873. Length of Longest Fibonacci Subsequence
MediumArrayDynamic ProgrammingHash Table
Watch Solutions57.5% acceptance
874. Walking Robot Simulation
MediumArrayHash TableSimulation
Watch Solutions64.5% acceptance
876. Middle of the Linked List
EasyLinked ListTwo Pointers
Watch Solutions82.3% acceptance
879. Profitable Schemes
HardArrayDynamic Programming
Watch Solutions48.1% acceptance
880. Decoded String at Index
MediumStackString
Watch Solutions37.3% acceptance
881. Boats to Save People
MediumArrayGreedySorting
Watch Solutions62.1% acceptance
882. Reachable Nodes In Subdivided Graph
HardGraphHeap (Priority Queue)Shortest Path
Watch Solutions52.5% acceptance
883. Projection Area of 3D Shapes
EasyArrayGeometryMath
Watch Solutions76.3% acceptance
884. Uncommon Words from Two Sentences
EasyCountingHash TableString
Watch Solutions75.8% acceptance
885. Spiral Matrix III
MediumArrayMatrixSimulation
Watch Solutions84.6% acceptance
887. Super Egg Drop
HardBinary SearchDynamic ProgrammingMath
Watch Solutions30.6% acceptance
888. Fair Candy Swap
EasyArrayBinary SearchHash Table
Watch Solutions65.3% acceptance
889. Construct Binary Tree from Preorder and Postorder Traversal
MediumArrayBinary TreeDivide and Conquer
Watch Solutions78.0% acceptance
890. Find and Replace Pattern
MediumArrayHash TableString
Watch Solutions76.8% acceptance
893. Groups of Special-Equivalent Strings
MediumArrayHash TableSorting
Watch Solutions73.5% acceptance
894. All Possible Full Binary Trees
MediumBinary TreeDynamic ProgrammingMemoization
Watch Solutions82.8% acceptance
896. Monotonic Array
EasyArray
Watch Solutions62.3% acceptance
898. Bitwise ORs of Subarrays
MediumArrayBit ManipulationDynamic Programming
Watch Solutions56.8% acceptance
899. Orderly Queue
HardMathSortingString
Watch Solutions66.8% acceptance
900. RLE Iterator
MediumArrayCountingDesign
Watch Solutions59.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.