FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
40
With Videos
0
Easy
40
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
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
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
1874. Minimize Product Sum of Two Arrays
MediumArrayGreedySorting
Watch Solutions89.5% acceptance
1875. Group Employees of the Same Salary
MediumDatabase
Watch Solutions66.9% 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
1881. Maximum Value after Insertion
MediumGreedyString
Watch Solutions39.3% acceptance
1882. Process Tasks Using Servers
MediumArrayHeap (Priority Queue)
Watch Solutions42.0% 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
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
1891. Cutting Ribbons
MediumArrayBinary Search
Watch Solutions53.0% 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
1902. Depth of BST Given Insertion Order
MediumArrayBinary Search TreeBinary Tree
Watch Solutions42.5% acceptance
1904. The Number of Full Rounds You Have Played
MediumMathString
Watch Solutions43.9% acceptance
1905. Count Sub Islands
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions72.8% acceptance
1906. Minimum Absolute Difference Queries
MediumArrayHash Table
Watch Solutions45.8% acceptance
1907. Count Salary Categories
MediumDatabase
Watch Solutions62.5% acceptance
1910. Remove All Occurrences of a Substring
MediumSimulationStackString
Watch Solutions78.2% acceptance
1911. Maximum Alternating Subsequence Sum
MediumArrayDynamic Programming
Watch Solutions58.8% acceptance
1914. Cyclically Rotating a Grid
MediumArrayMatrixSimulation
Watch Solutions74.2% acceptance
1915. Number of Wonderful Substrings
MediumBit ManipulationHash TablePrefix Sum
Watch Solutions66.8% acceptance
1918. Kth Smallest Subarray Sum
MediumArrayBinary SearchSliding Window
Watch Solutions53.4% acceptance
1921. Eliminate Maximum Number of Monsters
MediumArrayGreedySorting
Watch Solutions50.9% acceptance
1930. Unique Length-3 Palindromic Subsequences
MediumBit ManipulationHash TablePrefix Sum
Watch Solutions73.8% acceptance
1934. Confirmation Rate
MediumDatabase
Watch Solutions60.1% acceptance
1936. Add Minimum Number of Rungs
MediumArrayGreedy
Watch Solutions43.8% acceptance
1937. Maximum Number of Points with Cost
MediumArrayDynamic ProgrammingMatrix
Watch Solutions41.8% acceptance
1940. Longest Common Subsequence Between Sorted Arrays
MediumArrayCountingHash Table
Watch Solutions81.3% acceptance
1942. The Number of the Smallest Unoccupied Chair
MediumArrayHash TableHeap (Priority Queue)
Watch Solutions60.3% acceptance
1943. Describe the Painting
MediumArrayHash TablePrefix Sum
Watch Solutions52.7% acceptance
1946. Largest Number After Mutating Substring
MediumArrayGreedyString
Watch Solutions37.9% acceptance
1949. Strong Friendship
MediumDatabase
Watch Solutions54.6% acceptance
1951. All the Pairs With the Maximum Number of Common Followers
MediumDatabase
Watch Solutions68.9% acceptance
1953. Maximum Number of Weeks for Which You Can Work
MediumArrayGreedy
Watch Solutions42.4% 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.