FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
41
With Videos
0
Easy
41
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
522. Longest Uncommon Subsequence II
MediumArrayHash TableSorting
Watch Solutions45.2% acceptance
523. Continuous Subarray Sum
MediumArrayHash TableMath
Watch Solutions31.3% acceptance
524. Longest Word in Dictionary through Deleting
MediumArraySortingString
Watch Solutions52.6% acceptance
526. Beautiful Arrangement
MediumArrayBacktrackingBit Manipulation
Watch Solutions64.9% acceptance
528. Random Pick with Weight
MediumArrayBinary SearchMath
Watch Solutions49.0% acceptance
529. Minesweeper
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions68.7% acceptance
531. Lonely Pixel I
MediumArrayHash TableMatrix
Watch Solutions62.3% acceptance
533. Lonely Pixel II
MediumArrayHash TableMatrix
Watch Solutions48.7% acceptance
534. Game Play Analysis III
MediumDatabase
Watch Solutions81.0% acceptance
535. Encode and Decode TinyURL
MediumDesignHash FunctionHash Table
Watch Solutions86.5% acceptance
536. Construct Binary Tree from String
MediumBinary TreeDepth-First SearchStack
Watch Solutions58.7% acceptance
537. Complex Number Multiplication
MediumMathSimulationString
Watch Solutions73.3% acceptance
538. Convert BST to Greater Tree
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions71.5% acceptance
540. Single Element in a Sorted Array
MediumArrayBinary Search
Watch Solutions59.3% acceptance
544. Output Contest Matches
MediumRecursionSimulationString
Watch Solutions77.3% acceptance
545. Boundary of Binary Tree
MediumBinary TreeDepth-First SearchTree
Watch Solutions48.0% acceptance
547. Number of Provinces
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions70.8% acceptance
549. Binary Tree Longest Consecutive Sequence II
MediumBinary TreeDepth-First SearchTree
Watch Solutions50.1% acceptance
550. Game Play Analysis IV
MediumDatabase
Watch Solutions38.4% acceptance
554. Brick Wall
MediumArrayHash Table
Watch Solutions56.1% acceptance
555. Split Concatenated Strings
MediumArrayGreedyString
Watch Solutions43.4% acceptance
556. Next Greater Element III
MediumMathStringTwo Pointers
Watch Solutions35.2% acceptance
560. Subarray Sum Equals K
MediumArrayHash TablePrefix Sum
Watch Solutions48.2% acceptance
562. Longest Line of Consecutive One in Matrix
MediumArrayDynamic ProgrammingMatrix
Watch Solutions50.5% acceptance
565. Array Nesting
MediumArrayDepth-First Search
Watch Solutions56.6% acceptance
570. Managers with at Least 5 Direct Reports
MediumDatabase
Watch Solutions49.4% acceptance
573. Squirrel Simulation
MediumArrayMath
Watch Solutions57.1% acceptance
574. Winning Candidate
MediumDatabase
Watch Solutions61.3% acceptance
576. Out of Boundary Paths
MediumDynamic Programming
Watch Solutions48.1% acceptance
578. Get Highest Answer Rate Question
MediumDatabase
Watch Solutions40.2% acceptance
580. Count Student Number in Departments
MediumDatabase
Watch Solutions59.4% acceptance
581. Shortest Unsorted Continuous Subarray
MediumArrayGreedyMonotonic Stack
Watch Solutions38.1% acceptance
582. Kill Process
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions70.4% acceptance
583. Delete Operation for Two Strings
MediumDynamic ProgrammingString
Watch Solutions66.0% acceptance
585. Investments in 2016
MediumDatabase
Watch Solutions49.4% acceptance
602. Friend Requests II: Who Has the Most Friends
MediumDatabase
Watch Solutions59.2% acceptance
606. Construct String from Binary Tree
MediumBinary TreeDepth-First SearchString
Watch Solutions70.6% acceptance
608. Tree Node
MediumDatabase
Watch Solutions73.1% acceptance
609. Find Duplicate File in System
MediumArrayHash TableString
Watch Solutions67.6% acceptance
611. Valid Triangle Number
MediumArrayBinary SearchGreedy
Watch Solutions56.8% acceptance
612. Shortest Distance in a Plane
MediumDatabase
Watch Solutions61.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.