FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
37
With Videos
9
Easy
19
Medium
9
Hard
1902. Depth of BST Given Insertion Order
MediumArrayBinary Search TreeBinary Tree
Watch Solutions42.5% acceptance
1903. Largest Odd Number in String
EasyGreedyMathString
Watch Solutions67.7% 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
1912. Design Movie Rental System
HardArrayDesignHash Table
Watch Solutions62.5% acceptance
1913. Maximum Product Difference Between Two Pairs
EasyArraySorting
Watch Solutions82.9% acceptance
1914. Cyclically Rotating a Grid
MediumArrayMatrixSimulation
Watch Solutions74.2% acceptance
1915. Number of Wonderful Substrings
MediumBit ManipulationHash TablePrefix Sum
Watch Solutions66.8% acceptance
1916. Count Ways to Build Rooms in an Ant Colony
HardCombinatoricsDynamic ProgrammingGraph
Watch Solutions51.8% acceptance
1917. Leetcodify Friends Recommendations
HardDatabase
Watch Solutions27.5% acceptance
1918. Kth Smallest Subarray Sum
MediumArrayBinary SearchSliding Window
Watch Solutions53.4% acceptance
1919. Leetcodify Similar Friends
HardDatabase
Watch Solutions42.4% acceptance
1920. Build Array from Permutation
EasyArraySimulation
Watch Solutions91.1% acceptance
1921. Eliminate Maximum Number of Monsters
MediumArrayGreedySorting
Watch Solutions50.9% acceptance
1925. Count Square Sum Triples
EasyEnumerationMath
Watch Solutions77.2% acceptance
1928. Minimum Cost to Reach Destination in Time
HardArrayDynamic ProgrammingGraph
Watch Solutions42.0% acceptance
1929. Concatenation of Array
EasyArraySimulation
Watch Solutions90.2% acceptance
1930. Unique Length-3 Palindromic Subsequences
MediumBit ManipulationHash TablePrefix Sum
Watch Solutions73.8% acceptance
1931. Painting a Grid With Three Different Colors
HardDynamic Programming
Watch Solutions77.2% acceptance
1932. Merge BSTs to Create Single BST
HardBinary SearchBinary TreeDepth-First Search
Watch Solutions39.7% acceptance
1934. Confirmation Rate
MediumDatabase
Watch Solutions60.1% acceptance
1935. Maximum Number of Words You Can Type
EasyHash TableString
Watch Solutions82.9% 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
1939. Users That Actively Request Confirmation Messages
EasyDatabase
Watch Solutions56.4% acceptance
1940. Longest Common Subsequence Between Sorted Arrays
MediumArrayCountingHash Table
Watch Solutions81.3% acceptance
1941. Check if All Characters Have Equal Number of Occurrences
EasyCountingHash TableString
Watch Solutions79.4% 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
1944. Number of Visible People in a Queue
HardArrayMonotonic StackStack
Watch Solutions73.3% acceptance
1945. Sum of Digits of String After Convert
EasySimulationString
Watch Solutions74.9% acceptance
1948. Delete Duplicate Folders in System
HardArrayHash FunctionHash Table
Watch Solutions77.7% acceptance
1949. Strong Friendship
MediumDatabase
Watch Solutions54.6% 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.