FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
41
With Videos
0
Easy
41
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2831. Find the Longest Equal Subarray
MediumArrayBinary SearchHash Table
Watch Solutions38.4% acceptance
2832. Maximal Range That Each Element Is Maximum in It
MediumArrayMonotonic StackStack
Watch Solutions75.5% acceptance
2834. Find the Minimum Possible Sum of a Beautiful Array
MediumGreedyMath
Watch Solutions35.1% acceptance
2838. Maximum Coins Heroes Can Collect
MediumArrayBinary SearchPrefix Sum
Watch Solutions68.7% acceptance
2840. Check if Strings Can be Made Equal With Operations II
MediumHash TableSortingString
Watch Solutions73.9% acceptance
2841. Maximum Sum of Almost Unique Subarray
MediumArrayHash TableSliding Window
Watch Solutions41.5% acceptance
2844. Minimum Operations to Make a Special Number
MediumEnumerationGreedyMath
Watch Solutions38.5% acceptance
2845. Count of Interesting Subarrays
MediumArrayHash TablePrefix Sum
Watch Solutions58.0% acceptance
2847. Smallest Number With Given Digit Product
MediumGreedyMath
Watch Solutions43.8% acceptance
2849. Determine if a Cell Is Reachable at a Given Time
MediumMath
Watch Solutions37.2% acceptance
2852. Sum of Remoteness of All Cells
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions70.8% acceptance
2854. Rolling Average Steps
MediumDatabase
Watch Solutions67.8% acceptance
2856. Minimum Array Length After Pair Removals
MediumArrayBinary SearchCounting
Watch Solutions27.8% acceptance
2860. Happy Students
MediumArrayEnumerationSorting
Watch Solutions50.9% acceptance
2861. Maximum Number of Alloys
MediumArrayBinary Search
Watch Solutions41.2% acceptance
2863. Maximum Length of Semi-Decreasing Subarrays
MediumArrayMonotonic StackSorting
Watch Solutions70.5% acceptance
2865. Beautiful Towers I
MediumArrayMonotonic StackStack
Watch Solutions44.4% acceptance
2870. Minimum Number of Operations to Make Array Empty
MediumArrayCountingGreedy
Watch Solutions61.9% acceptance
2871. Split Array Into Maximum Number of Subarrays
MediumArrayBit ManipulationGreedy
Watch Solutions42.4% acceptance
2874. Maximum Value of an Ordered Triplet II
MediumArray
Watch Solutions56.4% acceptance
2875. Minimum Size Subarray in Infinite Array
MediumArrayHash TablePrefix Sum
Watch Solutions32.1% acceptance
2892. Minimizing Array After Replacing Pairs With Their Product
MediumArrayDynamic ProgrammingGreedy
Watch Solutions40.6% acceptance
2893. Calculate Orders Within Each Interval
MediumDatabase
Watch Solutions67.2% acceptance
2895. Minimum Processing Time
MediumArrayGreedySorting
Watch Solutions70.3% acceptance
2896. Apply Operations to Make Two Strings Equal
MediumDynamic ProgrammingString
Watch Solutions27.7% acceptance
2898. Maximum Linear Stock Score
MediumArrayHash Table
Watch Solutions61.7% acceptance
2901. Longest Unequal Adjacent Groups Subsequence II
MediumArrayDynamic ProgrammingString
Watch Solutions51.4% acceptance
2905. Find Indices With Index and Value Difference II
MediumArrayTwo Pointers
Watch Solutions32.6% acceptance
2906. Construct Product Matrix
MediumArrayMatrixPrefix Sum
Watch Solutions51.7% acceptance
2910. Minimum Number of Groups to Create a Valid Assignment
MediumArrayGreedyHash Table
Watch Solutions25.0% acceptance
2914. Minimum Number of Changes to Make Binary String Beautiful
MediumString
Watch Solutions76.4% acceptance
2915. Length of the Longest Subsequence That Sums to Target
MediumArrayDynamic Programming
Watch Solutions40.0% acceptance
2918. Minimum Equal Sum of Two Arrays After Replacing Zeros
MediumArrayGreedy
Watch Solutions50.2% acceptance
2919. Minimum Increment Operations to Make Array Beautiful
MediumArrayDynamic Programming
Watch Solutions34.7% acceptance
2922. Market Analysis III
MediumDatabase
Watch Solutions41.1% acceptance
2924. Find Champion II
MediumGraph
Watch Solutions70.3% acceptance
2925. Maximum Score After Applying Operations on a Tree
MediumDepth-First SearchDynamic ProgrammingTree
Watch Solutions47.2% acceptance
2929. Distribute Candies Among Children II
MediumCombinatoricsEnumerationMath
Watch Solutions55.7% acceptance
2930. Number of Strings Which Can Be Rearranged to Contain Substring
MediumCombinatoricsDynamic ProgrammingMath
Watch Solutions57.0% acceptance
2933. High-Access Employees
MediumArrayHash TableSorting
Watch Solutions47.4% acceptance
2938. Separate Black and White Balls
MediumGreedyStringTwo Pointers
Watch Solutions64.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.