FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
39
With Videos
11
Easy
22
Medium
6
Hard
1852. Distinct Numbers in Each Subarray
MediumArrayHash TableSliding Window
Watch Solutions77.3% acceptance
1853. Convert Date Format
EasyDatabase
Watch Solutions85.6% acceptance
1854. Maximum Population Year
EasyArrayCountingPrefix Sum
Watch Solutions64.4% acceptance
1855. Maximum Distance Between a Pair of Values
MediumArrayBinary SearchTwo Pointers
Watch Solutions61.3% acceptance
1857. Largest Color Value in a Directed Graph
HardCountingDynamic ProgrammingGraph
Watch Solutions57.3% acceptance
1859. Sorting the Sentence
EasySortingString
Watch Solutions84.1% acceptance
1860. Incremental Memory Leak
MediumMathSimulation
Watch Solutions73.0% acceptance
1861. Rotating the Box
MediumArrayMatrixTwo Pointers
Watch Solutions82.4% acceptance
1863. Sum of All Subset XOR Totals
EasyArrayBacktrackingBit Manipulation
Watch Solutions90.1% acceptance
1865. Finding Pairs With a Certain Sum
MediumArrayDesignHash Table
Watch Solutions61.6% acceptance
1867. Orders With Maximum Quantity Above Average
MediumDatabase
Watch Solutions70.8% acceptance
1868. Product of Two Run-Length Encoded Arrays
MediumArrayTwo Pointers
Watch Solutions59.6% acceptance
1869. Longer Contiguous Segments of Ones than Zeros
EasyString
Watch Solutions62.4% acceptance
1870. Minimum Speed to Arrive on Time
MediumArrayBinary Search
Watch Solutions47.7% acceptance
1871. Jump Game VII
MediumDynamic ProgrammingPrefix SumSliding Window
Watch Solutions35.4% acceptance
1873. Calculate Special Bonus
EasyDatabase
Watch Solutions57.5% acceptance
1874. Minimize Product Sum of Two Arrays
MediumArrayGreedySorting
Watch Solutions89.5% acceptance
1875. Group Employees of the Same Salary
MediumDatabase
Watch Solutions66.9% acceptance
1876. Substrings of Size Three with Distinct Characters
EasyCountingHash TableSliding Window
Watch Solutions76.7% acceptance
1877. Minimize Maximum Pair Sum in Array
MediumArrayGreedySorting
Watch Solutions83.3% acceptance
1878. Get Biggest Three Rhombus Sums in a Grid
MediumArrayHeap (Priority Queue)Math
Watch Solutions71.4% acceptance
1880. Check if Word Equals Summation of Two Words
EasyString
Watch Solutions75.2% acceptance
1881. Maximum Value after Insertion
MediumGreedyString
Watch Solutions39.3% acceptance
1882. Process Tasks Using Servers
MediumArrayHeap (Priority Queue)
Watch Solutions42.0% acceptance
1883. Minimum Skips to Arrive at Meeting On Time
HardArrayDynamic Programming
Watch Solutions38.9% acceptance
1884. Egg Drop With 2 Eggs and N Floors
MediumDynamic ProgrammingMath
Watch Solutions74.6% acceptance
1885. Count Pairs in Two Arrays
MediumArrayBinary SearchSorting
Watch Solutions60.5% acceptance
1886. Determine Whether Matrix Can Be Obtained By Rotation
EasyArrayMatrix
Watch Solutions68.2% acceptance
1887. Reduction Operations to Make the Array Elements Equal
MediumArraySorting
Watch Solutions72.7% acceptance
1888. Minimum Number of Flips to Make the Binary String Alternating
MediumDynamic ProgrammingGreedySliding Window
Watch Solutions53.5% acceptance
1889. Minimum Space Wasted From Packaging
HardArrayBinary SearchPrefix Sum
Watch Solutions33.6% acceptance
1890. The Latest Login in 2020
EasyDatabase
Watch Solutions77.4% acceptance
1891. Cutting Ribbons
MediumArrayBinary Search
Watch Solutions53.0% acceptance
1892. Page Recommendations II
HardDatabase
Watch Solutions44.4% acceptance
1894. Find the Student that Will Replace the Chalk
MediumArrayBinary SearchPrefix Sum
Watch Solutions53.2% acceptance
1895. Largest Magic Square
MediumArrayMatrixPrefix Sum
Watch Solutions75.3% acceptance
1896. Minimum Cost to Change the Final Value of Expression
HardDynamic ProgrammingMathStack
Watch Solutions50.0% acceptance
1897. Redistribute Characters to Make All Strings Equal
EasyCountingHash TableString
Watch Solutions67.0% acceptance
1900. The Earliest and Latest Rounds Where Players Compete
HardDynamic ProgrammingMemoization
Watch Solutions72.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.