FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
36
With Videos
9
Easy
20
Medium
7
Hard
2051. The Category of Each Member in the Store
MediumDatabase
Watch Solutions70.2% acceptance
2053. Kth Distinct String in an Array
EasyArrayCountingHash Table
Watch Solutions82.1% acceptance
2054. Two Best Non-Overlapping Events
MediumArrayBinary SearchDynamic Programming
Watch Solutions64.0% acceptance
2055. Plates Between Candles
MediumArrayBinary SearchPrefix Sum
Watch Solutions47.4% acceptance
2060. Check if an Original String Exists Given Two Encoded Strings
HardDynamic ProgrammingString
Watch Solutions43.6% acceptance
2061. Number of Spaces Cleaning Robot Cleaned
MediumArrayMatrixSimulation
Watch Solutions64.3% acceptance
2063. Vowels of All Substrings
MediumCombinatoricsDynamic ProgrammingMath
Watch Solutions55.3% acceptance
2064. Minimized Maximum of Products Distributed to Any Store
MediumArrayBinary SearchGreedy
Watch Solutions63.1% acceptance
2065. Maximum Path Quality of a Graph
HardArrayBacktrackingGraph
Watch Solutions62.5% acceptance
2066. Account Balance
MediumDatabase
Watch Solutions82.1% acceptance
2069. Walking Robot Simulation II
MediumDesignSimulation
Watch Solutions43.2% acceptance
2070. Most Beautiful Item for Each Query
MediumArrayBinary SearchSorting
Watch Solutions62.2% acceptance
2071. Maximum Number of Tasks You Can Assign
HardArrayBinary SearchGreedy
Watch Solutions50.1% acceptance
2072. The Winner University
EasyDatabase
Watch Solutions74.5% acceptance
2073. Time Needed to Buy Tickets
EasyArrayQueueSimulation
Watch Solutions72.9% acceptance
2075. Decode the Slanted Ciphertext
MediumSimulationString
Watch Solutions67.3% acceptance
2077. Paths in Maze That Lead to Same Room
MediumGraph
Watch Solutions56.7% acceptance
2078. Two Furthest Houses With Different Colors
EasyArrayGreedy
Watch Solutions71.8% acceptance
2079. Watering Plants
MediumArraySimulation
Watch Solutions79.9% acceptance
2081. Sum of k-Mirror Numbers
HardEnumerationMath
Watch Solutions63.7% acceptance
2082. The Number of Rich Customers
EasyDatabase
Watch Solutions77.3% acceptance
2083. Substrings That Begin and End With the Same Letter
MediumCountingHash TableMath
Watch Solutions74.1% acceptance
2084. Drop Type 1 Orders for Customers With Type 0 Orders
MediumDatabase
Watch Solutions86.9% acceptance
2085. Count Common Words With One Occurrence
EasyArrayCountingHash Table
Watch Solutions73.3% acceptance
2086. Minimum Number of Food Buckets to Feed the Hamsters
MediumDynamic ProgrammingGreedyString
Watch Solutions48.1% acceptance
2087. Minimum Cost Homecoming of a Robot in a Grid
MediumArrayGreedy
Watch Solutions51.7% acceptance
2088. Count Fertile Pyramids in a Land
HardArrayDynamic ProgrammingMatrix
Watch Solutions66.5% acceptance
2089. Find Target Indices After Sorting Array
EasyArrayBinary SearchSorting
Watch Solutions77.9% acceptance
2090. K Radius Subarray Averages
MediumArraySliding Window
Watch Solutions46.0% acceptance
2092. Find All People With Secret
HardBreadth-First SearchDepth-First SearchGraph
Watch Solutions48.4% acceptance
2093. Minimum Cost to Reach City With Discounts
MediumGraphHeap (Priority Queue)Shortest Path
Watch Solutions61.0% acceptance
2094. Finding 3-Digit Even Numbers
EasyArrayEnumerationHash Table
Watch Solutions78.8% acceptance
2095. Delete the Middle Node of a Linked List
MediumLinked ListTwo Pointers
Watch Solutions60.4% acceptance
2096. Step-By-Step Directions From a Binary Tree Node to Another
MediumBinary TreeDepth-First SearchString
Watch Solutions56.3% acceptance
2097. Valid Arrangement of Pairs
HardDepth-First SearchEulerian CircuitGraph
Watch Solutions66.5% acceptance
2099. Find Subsequence of Length K With the Largest Sum
EasyArrayHash TableHeap (Priority Queue)
Watch Solutions57.4% 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.