FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
39
With Videos
0
Easy
39
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1167. Minimum Cost to Connect Sticks
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions71.8% acceptance
1169. Invalid Transactions
MediumArrayHash TableSorting
Watch Solutions32.1% acceptance
1170. Compare Strings by Frequency of the Smallest Character
MediumArrayBinary SearchHash Table
Watch Solutions63.3% acceptance
1174. Immediate Food Delivery II
MediumDatabase
Watch Solutions53.1% acceptance
1181. Before and After Puzzle
MediumArrayHash TableSorting
Watch Solutions51.8% acceptance
1182. Shortest Distance to Target Color
MediumArrayBinary SearchDynamic Programming
Watch Solutions56.5% acceptance
1188. Design Bounded Blocking Queue
MediumConcurrency
Watch Solutions72.6% acceptance
1190. Reverse Substrings Between Each Pair of Parentheses
MediumStackString
Watch Solutions71.8% acceptance
1191. K-Concatenation Maximum Sum
MediumArrayDynamic Programming
Watch Solutions25.9% acceptance
1193. Monthly Transactions I
MediumDatabase
Watch Solutions58.3% acceptance
1195. Fizz Buzz Multithreaded
MediumConcurrency
Watch Solutions73.2% acceptance
1197. Minimum Knight Moves
MediumBreadth-First Search
Watch Solutions41.8% acceptance
1198. Find Smallest Common Element in All Rows
MediumArrayBinary SearchCounting
Watch Solutions76.5% acceptance
1204. Last Person to Fit in the Bus
MediumDatabase
Watch Solutions68.0% acceptance
1205. Monthly Transactions II
MediumDatabase
Watch Solutions41.8% acceptance
1212. Team Scores in Football Tournament
MediumDatabase
Watch Solutions55.6% acceptance
1214. Two Sum BSTs
MediumBinary SearchBinary Search TreeBinary Tree
Watch Solutions68.2% acceptance
1215. Stepping Numbers
MediumBacktrackingBreadth-First SearchMath
Watch Solutions48.2% acceptance
1218. Longest Arithmetic Subsequence of Given Difference
MediumArrayDynamic ProgrammingHash Table
Watch Solutions54.5% acceptance
1222. Queens That Can Attack the King
MediumArrayMatrixSimulation
Watch Solutions72.6% acceptance
1226. The Dining Philosophers
MediumConcurrency
Watch Solutions54.5% acceptance
1227. Airplane Seat Assignment Probability
MediumBrainteaserDynamic ProgrammingMath
Watch Solutions67.3% acceptance
1229. Meeting Scheduler
MediumArraySortingTwo Pointers
Watch Solutions55.3% acceptance
1230. Toss Strange Coins
MediumArrayDynamic ProgrammingMath
Watch Solutions58.1% acceptance
1233. Remove Sub-Folders from the Filesystem
MediumArrayDepth-First SearchString
Watch Solutions78.6% acceptance
1236. Web Crawler
MediumBreadth-First SearchDepth-First SearchInteractive
Watch Solutions68.8% acceptance
1237. Find Positive Integer Solution for a Given Equation
MediumBinary SearchInteractiveMath
Watch Solutions69.7% acceptance
1238. Circular Permutation in Binary Representation
MediumBacktrackingBit ManipulationMath
Watch Solutions72.6% acceptance
1239. Maximum Length of a Concatenated String with Unique Characters
MediumArrayBacktrackingBit Manipulation
Watch Solutions54.7% acceptance
1242. Web Crawler Multithreaded
MediumBreadth-First SearchConcurrencyDepth-First Search
Watch Solutions49.5% acceptance
1244. Design A Leaderboard
MediumDesignHash TableSorting
Watch Solutions67.9% acceptance
1245. Tree Diameter
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions61.1% acceptance
1247. Minimum Swaps to Make Strings Equal
MediumGreedyMathString
Watch Solutions65.3% acceptance
1248. Count Number of Nice Subarrays
MediumArrayHash TableMath
Watch Solutions75.5% acceptance
1249. Minimum Remove to Make Valid Parentheses
MediumStackString
Watch Solutions71.3% acceptance
1254. Number of Closed Islands
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions67.1% acceptance
1256. Encode Number
MediumBit ManipulationMathString
Watch Solutions70.0% acceptance
1258. Synonymous Sentences
MediumArrayBacktrackingHash Table
Watch Solutions57.2% acceptance
1261. Find Elements in a Contaminated Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions84.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.