FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
38
With Videos
12
Easy
20
Medium
6
Hard
1452. People Whose List of Favorite Companies Is Not a Subset of Another List
MediumArrayHash TableString
Watch Solutions60.6% acceptance
1454. Active Users
MediumDatabase
Watch Solutions36.7% acceptance
1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence
EasyStringString MatchingTwo Pointers
Watch Solutions68.8% acceptance
1457. Pseudo-Palindromic Paths in a Binary Tree
MediumBinary TreeBit ManipulationBreadth-First Search
Watch Solutions68.3% acceptance
1458. Max Dot Product of Two Subsequences
HardArrayDynamic Programming
Watch Solutions69.4% acceptance
1459. Rectangles Area
MediumDatabase
Watch Solutions68.5% acceptance
1460. Make Two Arrays Equal by Reversing Subarrays
EasyArrayHash TableSorting
Watch Solutions75.9% acceptance
1461. Check If a String Contains All Binary Codes of Size K
MediumBit ManipulationHash FunctionHash Table
Watch Solutions61.5% acceptance
1463. Cherry Pickup II
HardArrayDynamic ProgrammingMatrix
Watch Solutions72.4% acceptance
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
MediumArrayGreedySorting
Watch Solutions41.1% acceptance
1466. Reorder Routes to Make All Paths Lead to the City Zero
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions65.7% acceptance
1468. Calculate Salaries
MediumDatabase
Watch Solutions78.4% acceptance
1469. Find All The Lonely Nodes
EasyBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions83.8% acceptance
1470. Shuffle the Array
EasyArray
Watch Solutions88.7% acceptance
1471. The k Strongest Values in an Array
MediumArraySortingTwo Pointers
Watch Solutions62.6% acceptance
1472. Design Browser History
MediumArrayData StreamDesign
Watch Solutions78.3% acceptance
1473. Paint House III
HardArrayDynamic Programming
Watch Solutions60.9% acceptance
1474. Delete N Nodes After M Nodes of a Linked List
EasyLinked List
Watch Solutions74.4% acceptance
1475. Final Prices With a Special Discount in a Shop
EasyArrayMonotonic StackStack
Watch Solutions84.1% acceptance
1476. Subrectangle Queries
MediumArrayDesignMatrix
Watch Solutions86.3% acceptance
1479. Sales by Day of the Week
HardDatabase
Watch Solutions77.4% acceptance
1480. Running Sum of 1d Array
EasyArrayPrefix Sum
Watch Solutions86.9% acceptance
1481. Least Number of Unique Integers after K Removals
MediumArrayCountingGreedy
Watch Solutions63.8% acceptance
1482. Minimum Number of Days to Make m Bouquets
MediumArrayBinary Search
Watch Solutions56.9% acceptance
1484. Group Sold Products By The Date
EasyDatabase
Watch Solutions77.5% acceptance
1485. Clone Binary Tree With Random Pointer
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions81.2% acceptance
1486. XOR Operation in an Array
EasyBit ManipulationMath
Watch Solutions87.5% acceptance
1487. Making File Names Unique
MediumArrayHash TableString
Watch Solutions38.5% acceptance
1488. Avoid Flood in The City
MediumArrayBinary SearchGreedy
Watch Solutions39.0% acceptance
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
HardGraphMinimum Spanning TreeSorting
Watch Solutions66.4% acceptance
1490. Clone N-ary Tree
MediumBreadth-First SearchDepth-First SearchHash Table
Watch Solutions83.2% acceptance
1491. Average Salary Excluding the Minimum and Maximum Salary
EasyArraySorting
Watch Solutions63.5% acceptance
1493. Longest Subarray of 1's After Deleting One Element
MediumArrayDynamic ProgrammingSliding Window
Watch Solutions71.1% acceptance
1495. Friendly Movies Streamed Last Month
EasyDatabase
Watch Solutions49.0% acceptance
1496. Path Crossing
EasyHash TableString
Watch Solutions62.5% acceptance
1497. Check If Array Pairs Are Divisible by k
MediumArrayCountingHash Table
Watch Solutions46.2% acceptance
1498. Number of Subsequences That Satisfy the Given Sum Condition
MediumArrayBinary SearchSorting
Watch Solutions49.2% acceptance
1499. Max Value of Equation
HardArrayHeap (Priority Queue)Monotonic Queue
Watch Solutions45.0% 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.