FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
37
With Videos
14
Easy
15
Medium
8
Hard
1751. Maximum Number of Events That Can Be Attended II
HardArrayBinary SearchDynamic Programming
Watch Solutions63.6% acceptance
1752. Check if Array Is Sorted and Rotated
EasyArray
Watch Solutions57.3% acceptance
1753. Maximum Score From Removing Stones
MediumGreedyHeap (Priority Queue)Math
Watch Solutions68.6% acceptance
1754. Largest Merge Of Two Strings
MediumGreedyStringTwo Pointers
Watch Solutions54.2% acceptance
1756. Design Most Recently Used Queue
MediumArrayBinary Indexed TreeDesign
Watch Solutions78.0% acceptance
1757. Recyclable and Low Fat Products
EasyDatabase
Watch Solutions89.3% acceptance
1758. Minimum Changes To Make Alternating Binary String
EasyString
Watch Solutions67.8% acceptance
1759. Count Number of Homogenous Substrings
MediumMathString
Watch Solutions57.6% acceptance
1762. Buildings With an Ocean View
MediumArrayMonotonic StackStack
Watch Solutions80.9% acceptance
1763. Longest Nice Substring
EasyBit ManipulationDivide and ConquerHash Table
Watch Solutions64.4% acceptance
1764. Form Array by Concatenating Subarrays of Another Array
MediumArrayGreedyString Matching
Watch Solutions54.7% acceptance
1767. Find the Subtasks That Did Not Execute
HardDatabase
Watch Solutions78.0% acceptance
1768. Merge Strings Alternately
EasyStringTwo Pointers
Watch Solutions82.1% acceptance
1769. Minimum Number of Operations to Move All Balls to Each Box
MediumArrayPrefix SumString
Watch Solutions90.1% acceptance
1770. Maximum Score from Performing Multiplication Operations
HardArrayDynamic Programming
Watch Solutions43.2% acceptance
1771. Maximize Palindrome Length From Subsequences
HardDynamic ProgrammingString
Watch Solutions38.4% acceptance
1772. Sort Features by Popularity
MediumArrayHash TableSorting
Watch Solutions66.4% acceptance
1773. Count Items Matching a Rule
EasyArrayString
Watch Solutions85.3% acceptance
1775. Equal Sum Arrays With Minimum Number of Operations
MediumArrayCountingGreedy
Watch Solutions54.6% acceptance
1777. Product's Price for Each Store
EasyDatabase
Watch Solutions82.3% acceptance
1778. Shortest Path in a Hidden Grid
MediumBreadth-First SearchDepth-First SearchGraph
Watch Solutions44.5% acceptance
1779. Find Nearest Point That Has the Same X or Y Coordinate
EasyArray
Watch Solutions69.9% acceptance
1780. Check if Number is a Sum of Powers of Three
MediumMath
Watch Solutions79.4% acceptance
1783. Grand Slam Titles
MediumDatabase
Watch Solutions83.2% acceptance
1784. Check if Binary String Has at Most One Segment of Ones
EasyString
Watch Solutions49.0% acceptance
1785. Minimum Elements to Add to Form a Given Sum
MediumArrayGreedy
Watch Solutions45.0% acceptance
1787. Make the XOR of All Segments Equal to Zero
HardArrayBit ManipulationDynamic Programming
Watch Solutions41.1% acceptance
1788. Maximize the Beauty of the Garden
HardArrayGreedyHash Table
Watch Solutions64.7% acceptance
1789. Primary Department for Each Employee
EasyDatabase
Watch Solutions68.1% acceptance
1790. Check if One String Swap Can Make Strings Equal
EasyCountingHash TableString
Watch Solutions49.5% acceptance
1791. Find Center of Star Graph
EasyGraph
Watch Solutions86.6% acceptance
1792. Maximum Average Pass Ratio
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions74.1% acceptance
1793. Maximum Score of a Good Subarray
HardArrayBinary SearchMonotonic Stack
Watch Solutions64.3% acceptance
1795. Rearrange Products Table
EasyDatabase
Watch Solutions85.4% acceptance
1797. Design Authentication Manager
MediumDesignDoubly-Linked ListHash Table
Watch Solutions58.5% acceptance
1799. Maximize Score After N Operations
HardArrayBacktrackingBit Manipulation
Watch Solutions57.8% acceptance
1800. Maximum Ascending Subarray Sum
EasyArray
Watch Solutions66.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.