FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
37
With Videos
0
Easy
37
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
260. Single Number III
MediumArrayBit Manipulation
Watch Solutions70.2% acceptance
261. Graph Valid Tree
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions49.9% acceptance
264. Ugly Number II
MediumDynamic ProgrammingHash TableHeap (Priority Queue)
Watch Solutions49.7% acceptance
267. Palindrome Permutation II
MediumBacktrackingHash TableString
Watch Solutions41.9% acceptance
276. Paint Fence
MediumDynamic Programming
Watch Solutions48.3% acceptance
277. Find the Celebrity
MediumGraphInteractiveTwo Pointers
Watch Solutions48.9% acceptance
279. Perfect Squares
MediumBreadth-First SearchDynamic ProgrammingMath
Watch Solutions56.4% acceptance
280. Wiggle Sort
MediumArrayGreedySorting
Watch Solutions68.5% acceptance
281. Zigzag Iterator
MediumArrayDesignIterator
Watch Solutions67.1% acceptance
285. Inorder Successor in BST
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions51.2% acceptance
286. Walls and Gates
MediumArrayBreadth-First SearchMatrix
Watch Solutions63.9% acceptance
288. Unique Word Abbreviation
MediumArrayDesignHash Table
Watch Solutions27.5% acceptance
289. Game of Life
MediumArrayMatrixSimulation
Watch Solutions73.0% acceptance
291. Word Pattern II
MediumBacktrackingHash TableString
Watch Solutions49.1% acceptance
294. Flip Game II
MediumBacktrackingDynamic ProgrammingGame Theory
Watch Solutions52.2% acceptance
298. Binary Tree Longest Consecutive Sequence
MediumBinary TreeDepth-First SearchTree
Watch Solutions54.7% acceptance
304. Range Sum Query 2D - Immutable
MediumArrayDesignMatrix
Watch Solutions58.6% acceptance
307. Range Sum Query - Mutable
MediumArrayBinary Indexed TreeDesign
Watch Solutions43.3% acceptance
309. Best Time to Buy and Sell Stock with Cooldown
MediumArrayDynamic Programming
Watch Solutions62.4% acceptance
310. Minimum Height Trees
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions42.4% acceptance
311. Sparse Matrix Multiplication
MediumArrayHash TableMatrix
Watch Solutions69.3% acceptance
314. Binary Tree Vertical Order Traversal
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions57.8% acceptance
316. Remove Duplicate Letters
MediumGreedyMonotonic StackStack
Watch Solutions54.1% acceptance
318. Maximum Product of Word Lengths
MediumArrayBit ManipulationString
Watch Solutions61.1% acceptance
319. Bulb Switcher
MediumBrainteaserMath
Watch Solutions56.2% acceptance
320. Generalized Abbreviation
MediumBacktrackingBit ManipulationString
Watch Solutions60.4% acceptance
322. Coin Change
MediumArrayBreadth-First SearchDynamic Programming
Watch Solutions48.7% acceptance
323. Number of Connected Components in an Undirected Graph
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions64.9% acceptance
324. Wiggle Sort II
MediumArrayDivide and ConquerGreedy
Watch Solutions37.8% acceptance
325. Maximum Size Subarray Sum Equals k
MediumArrayHash TablePrefix Sum
Watch Solutions50.8% acceptance
328. Odd Even Linked List
MediumLinked List
Watch Solutions62.4% acceptance
333. Largest BST Subtree
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions45.8% acceptance
334. Increasing Triplet Subsequence
MediumArrayGreedy
Watch Solutions39.3% acceptance
339. Nested List Weight Sum
MediumBreadth-First SearchDepth-First Search
Watch Solutions85.9% acceptance
340. Longest Substring with At Most K Distinct Characters
MediumHash TableSliding WindowString
Watch Solutions49.9% acceptance
341. Flatten Nested List Iterator
MediumDepth-First SearchDesignIterator
Watch Solutions65.6% acceptance
347. Top K Frequent Elements
MediumArrayBucket SortCounting
Watch Solutions67.3% 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.