FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
29
With Videos
0
Easy
29
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
3341. Find Minimum Time to Reach Last Room I
MediumArrayGraphHeap (Priority Queue)
Watch Solutions55.5% acceptance
3346. Maximum Frequency of an Element After Performing Operations I
MediumArrayBinary SearchPrefix Sum
Watch Solutions40.1% acceptance
3350. Adjacent Increasing Subarrays Detection II
MediumArrayBinary Search
Watch Solutions58.9% acceptance
3355. Zero Array Transformation I
MediumArrayPrefix Sum
Watch Solutions54.5% acceptance
3356. Zero Array Transformation II
MediumArrayBinary SearchPrefix Sum
Watch Solutions43.6% acceptance
3362. Zero Array Transformation III
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions54.9% acceptance
3365. Rearrange K Substrings to Form Target String
MediumHash TableSortingString
Watch Solutions56.7% acceptance
3366. Minimum Array Sum
MediumArrayDynamic Programming
Watch Solutions31.7% acceptance
3371. Identify the Largest Outlier in an Array
MediumArrayCountingEnumeration
Watch Solutions36.2% acceptance
3372. Maximize the Number of Target Nodes After Connecting Trees I
MediumBreadth-First SearchDepth-First SearchTree
Watch Solutions69.5% acceptance
3868. Minimum Cost to Equalize Arrays Using Swaps
MediumArrayCountingGreedy
Watch Solutions48.7% acceptance
3867. Sum of GCD of Formed Pairs
MediumArrayMathNumber Theory
Watch Solutions75.1% acceptance
3862. Find the Smallest Balanced Index
MediumArrayPrefix Sum
Watch Solutions19.2% acceptance
3872. Longest Arithmetic Sequence After Changing At Most One Element
MediumArrayEnumeration
Watch Solutions21.4% acceptance
3848. Check Digitorial Permutation
MediumCountingMath
Watch Solutions46.5% acceptance
3844. Longest Almost-Palindromic Substring
MediumDynamic ProgrammingStringTwo Pointers
Watch Solutions22.8% acceptance
3863. Minimum Operations to Sort a String
MediumString
Watch Solutions19.1% acceptance
3854. Minimum Operations to Make Array Parity Alternating
MediumArrayGreedy
Watch Solutions17.1% acceptance
3843. First Element with Unique Frequency
MediumArrayCountingHash Table
Watch Solutions69.9% acceptance
3834. Merge Adjacent Equal Elements
MediumArraySimulationStack
Watch Solutions42.6% acceptance
3835. Count Subarrays With Cost Less Than or Equal to K
MediumArrayMonotonic QueueQueue
Watch Solutions46.1% acceptance
3818. Minimum Prefix Removal to Make Array Strictly Increasing
MediumArray
Watch Solutions73.7% acceptance
3807. Minimum Cost to Repair Edges to Traverse a Graph
MediumBinary SearchBreadth-First SearchGraph
Watch Solutions55.0% acceptance
3809. Best Reachable Tower
MediumArray
Watch Solutions55.7% acceptance
3824. Minimum K to Reduce Array Within Limit
MediumArrayBinary Search
Watch Solutions41.1% acceptance
3790. Smallest All-Ones Multiple
MediumHash TableMath
Watch Solutions46.8% acceptance
3788. Maximum Score of a Split
MediumArrayPrefix Sum
Watch Solutions51.6% acceptance
3819. Rotate Non Negative Elements
MediumArraySimulation
Watch Solutions47.9% acceptance
3779. Minimum Number of Operations to Have Distinct Elements
MediumArrayHash Table
Watch Solutions42.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.