FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
40
With Videos
0
Easy
40
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1077. Project Employees III
MediumDatabase
Watch Solutions76.8% acceptance
1079. Letter Tile Possibilities
MediumBacktrackingCountingHash Table
Watch Solutions83.5% acceptance
1081. Smallest Subsequence of Distinct Characters
MediumGreedyMonotonic StackStack
Watch Solutions70.6% acceptance
1087. Brace Expansion
MediumBacktrackingBreadth-First SearchString
Watch Solutions66.5% acceptance
1091. Shortest Path in Binary Matrix
MediumArrayBreadth-First SearchMatrix
Watch Solutions51.8% acceptance
1098. Unpopular Books
MediumDatabase
Watch Solutions43.3% acceptance
1100. Find K-Length Substrings With No Repeated Characters
MediumHash TableSliding WindowString
Watch Solutions76.5% acceptance
1101. The Earliest Moment When Everyone Become Friends
MediumArraySortingUnion Find
Watch Solutions66.0% acceptance
1102. Path With Maximum Minimum Value
MediumArrayBinary SearchBreadth-First Search
Watch Solutions54.6% acceptance
1105. Filling Bookcase Shelves
MediumArrayDynamic Programming
Watch Solutions68.7% acceptance
1107. New Users Daily Count
MediumDatabase
Watch Solutions44.7% acceptance
1110. Delete Nodes And Return Forest
MediumArrayBinary TreeDepth-First Search
Watch Solutions72.4% acceptance
1111. Maximum Nesting Depth of Two Valid Parentheses Strings
MediumStackString
Watch Solutions72.1% acceptance
1112. Highest Grade For Each Student
MediumDatabase
Watch Solutions70.8% acceptance
1115. Print FooBar Alternately
MediumConcurrency
Watch Solutions67.7% acceptance
1116. Print Zero Even Odd
MediumConcurrency
Watch Solutions62.0% acceptance
1117. Building H2O
MediumConcurrency
Watch Solutions57.1% acceptance
1120. Maximum Average Subtree
MediumBinary TreeDepth-First SearchTree
Watch Solutions66.7% acceptance
1123. Lowest Common Ancestor of Deepest Leaves
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions79.5% acceptance
1124. Longest Well-Performing Interval
MediumArrayHash TableMonotonic Stack
Watch Solutions37.9% acceptance
1126. Active Businesses
MediumDatabase
Watch Solutions65.8% acceptance
1129. Shortest Path with Alternating Colors
MediumBreadth-First SearchGraph
Watch Solutions47.8% acceptance
1130. Minimum Cost Tree From Leaf Values
MediumArrayDynamic ProgrammingGreedy
Watch Solutions67.7% acceptance
1131. Maximum of Absolute Value Expression
MediumArrayMath
Watch Solutions48.4% acceptance
1132. Reported Posts II
MediumDatabase
Watch Solutions32.3% acceptance
1135. Connecting Cities With Minimum Cost
MediumGraphHeap (Priority Queue)Minimum Spanning Tree
Watch Solutions63.5% acceptance
1136. Parallel Courses
MediumGraphTopological Sort
Watch Solutions62.1% acceptance
1138. Alphabet Board Path
MediumHash TableString
Watch Solutions51.5% acceptance
1139. Largest 1-Bordered Square
MediumArrayDynamic ProgrammingMatrix
Watch Solutions52.1% acceptance
1145. Binary Tree Coloring Game
MediumBinary TreeDepth-First SearchTree
Watch Solutions52.9% acceptance
1146. Snapshot Array
MediumArrayBinary SearchDesign
Watch Solutions36.8% acceptance
1149. Article Views II
MediumDatabase
Watch Solutions47.1% acceptance
1151. Minimum Swaps to Group All 1's Together
MediumArraySliding Window
Watch Solutions61.2% acceptance
1152. Analyze User Website Visit Pattern
MediumArrayHash TableSorting
Watch Solutions44.3% acceptance
1155. Number of Dice Rolls With Target Sum
MediumDynamic Programming
Watch Solutions62.2% acceptance
1158. Market Analysis I
MediumDatabase
Watch Solutions57.2% acceptance
1161. Maximum Level Sum of a Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions70.0% acceptance
1162. As Far from Land as Possible
MediumArrayBreadth-First SearchDynamic Programming
Watch Solutions52.2% acceptance
1164. Product Price at a Given Date
MediumDatabase
Watch Solutions57.0% acceptance
1166. Design File System
MediumDesignHash TableString
Watch Solutions65.1% 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.