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
975. Odd Even Jump
HardArrayDynamic ProgrammingMonotonic Stack
Watch Solutions41.1% acceptance
980. Unique Paths III
HardArrayBacktrackingBit Manipulation
Watch Solutions82.8% acceptance
982. Triples with Bitwise AND Equal To Zero
HardArrayBit ManipulationHash Table
Watch Solutions60.1% acceptance
987. Vertical Order Traversal of a Binary Tree
HardBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions54.6% acceptance
995. Minimum Number of K Consecutive Bit Flips
HardArrayBit ManipulationPrefix Sum
Watch Solutions62.7% acceptance
1001. Grid Illumination
HardArrayHash Table
Watch Solutions39.7% acceptance
1028. Recover a Tree From Preorder Traversal
HardBinary TreeDepth-First SearchString
Watch Solutions83.2% acceptance
1044. Longest Duplicate Substring
HardBinary SearchHash FunctionRolling Hash
Watch Solutions31.1% acceptance
1063. Number of Valid Subarrays
HardArrayMonotonic StackStack
Watch Solutions79.9% acceptance
1067. Digit Count in Range
HardDynamic ProgrammingMath
Watch Solutions46.4% acceptance
1074. Number of Submatrices That Sum to Target
HardArrayHash TableMatrix
Watch Solutions74.4% acceptance
1088. Confusing Number II
HardBacktrackingMath
Watch Solutions47.1% acceptance
1092. Shortest Common Supersequence
HardDynamic ProgrammingString
Watch Solutions61.8% acceptance
1095. Find in Mountain Array
HardArrayBinary SearchInteractive
Watch Solutions41.9% acceptance
1096. Brace Expansion II
HardBacktrackingBreadth-First SearchStack
Watch Solutions64.0% acceptance
1097. Game Play Analysis V
HardDatabase
Watch Solutions50.8% acceptance
1106. Parsing A Boolean Expression
HardRecursionStackString
Watch Solutions69.8% acceptance
1121. Divide Array Into Increasing Sequences
HardArrayCounting
Watch Solutions65.4% acceptance
1125. Smallest Sufficient Team
HardArrayBit ManipulationBitmask
Watch Solutions55.5% acceptance
1127. User Purchase Platform
HardDatabase
Watch Solutions46.9% acceptance
1147. Longest Chunked Palindrome Decomposition
HardDynamic ProgrammingGreedyHash Function
Watch Solutions58.6% acceptance
1153. String Transforms Into Another String
HardHash TableString
Watch Solutions34.9% acceptance
1159. Market Analysis II
HardDatabase
Watch Solutions57.4% acceptance
1163. Last Substring in Lexicographical Order
HardStringTwo Pointers
Watch Solutions35.1% acceptance
1168. Optimize Water Distribution in a Village
HardGraphHeap (Priority Queue)Minimum Spanning Tree
Watch Solutions65.5% acceptance
1172. Dinner Plate Stacks
HardDesignHash TableHeap (Priority Queue)
Watch Solutions33.6% acceptance
1178. Number of Valid Words for Each Puzzle
HardArrayBit ManipulationHash Table
Watch Solutions47.8% acceptance
1183. Maximum Number of Ones
HardGreedyHeap (Priority Queue)
Watch Solutions70.6% acceptance
1187. Make Array Strictly Increasing
HardArrayBinary SearchDynamic Programming
Watch Solutions58.0% acceptance
1194. Tournament Winners
HardDatabase
Watch Solutions49.3% acceptance
1203. Sort Items by Groups Respecting Dependencies
HardBreadth-First SearchDepth-First SearchGraph
Watch Solutions66.0% acceptance
1206. Design Skiplist
HardDesignLinked List
Watch Solutions59.7% acceptance
1216. Valid Palindrome III
HardDynamic ProgrammingString
Watch Solutions49.2% acceptance
1220. Count Vowels Permutation
HardDynamic Programming
Watch Solutions61.7% acceptance
1224. Maximum Equal Frequency
HardArrayHash Table
Watch Solutions38.2% acceptance
1225. Report Contiguous Dates
HardDatabase
Watch Solutions56.9% acceptance
1231. Divide Chocolate
HardArrayBinary Search
Watch Solutions60.5% acceptance
1235. Maximum Profit in Job Scheduling
HardArrayBinary SearchDynamic Programming
Watch Solutions54.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.