FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
35
With Videos
7
Easy
20
Medium
8
Hard
3467. Transform Array by Parity
EasyArrayCountingSorting
Watch Solutions89.7% acceptance
3509. Maximum Product of Subsequences With an Alternating Sum Equal to K
HardArrayDynamic ProgrammingHash Table
Watch Solutions13.7% acceptance
3469. Find Minimum Cost to Remove Array Elements
MediumArrayDynamic Programming
Watch Solutions22.2% acceptance
3463. Check If Digits Are Equal in String After Operations II
HardCombinatoricsMathNumber Theory
Watch Solutions14.3% acceptance
3507. Minimum Pair Removal to Sort Array I
EasyArrayDoubly-Linked ListHash Table
Watch Solutions65.3% acceptance
3510. Minimum Pair Removal to Sort Array II
HardArrayDoubly-Linked ListHash Table
Watch Solutions39.1% acceptance
3458. Select K Disjoint Special Substrings
MediumDynamic ProgrammingGreedyHash Table
Watch Solutions19.2% acceptance
3461. Check If Digits Are Equal in String After Operations I
EasyCombinatoricsMathNumber Theory
Watch Solutions82.5% acceptance
3627. Maximum Median Sum of Subsequences of Size 3
MediumArrayGame TheoryGreedy
Watch Solutions65.1% acceptance
3462. Maximum Sum With at Most K Elements
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions60.6% acceptance
3453. Separate Squares I
MediumArrayBinary Search
Watch Solutions58.0% acceptance
3449. Maximize the Minimum Game Score
HardArrayBinary SearchGreedy
Watch Solutions26.2% acceptance
3445. Maximum Difference Between Even and Odd Frequency II
HardEnumerationPrefix SumSliding Window
Watch Solutions48.7% acceptance
3447. Assign Elements to Groups with Constraints
MediumArrayHash Table
Watch Solutions26.8% acceptance
3478. Choose K Elements With Maximum Sum
MediumArrayHeap (Priority Queue)Sorting
Watch Solutions34.0% acceptance
3443. Maximum Manhattan Distance After K Changes
MediumCountingHash TableMath
Watch Solutions54.2% acceptance
3442. Maximum Difference Between Even and Odd Frequency I
EasyCountingHash TableString
Watch Solutions60.7% acceptance
3488. Closest Equal Element Queries
MediumArrayBinary SearchHash Table
Watch Solutions51.4% acceptance
3446. Sort Matrix by Diagonals
MediumArrayMatrixSorting
Watch Solutions84.7% acceptance
3423. Maximum Difference Between Adjacent Elements in a Circular Array
EasyArray
Watch Solutions75.7% acceptance
3495. Minimum Operations to Make Array Elements Zero
HardArrayBit ManipulationMath
Watch Solutions60.4% acceptance
3439. Reschedule Meetings for Maximum Free Time I
MediumArrayGreedySliding Window
Watch Solutions53.9% acceptance
3440. Reschedule Meetings for Maximum Free Time II
MediumArrayEnumerationGreedy
Watch Solutions60.4% acceptance
3400. Maximum Number of Matching Indices After Right Shifts
MediumArraySimulationTwo Pointers
Watch Solutions84.7% acceptance
3523. Make Array Non-decreasing
MediumArrayGreedyMonotonic Stack
Watch Solutions57.5% acceptance
3391. Design a 3D Binary Matrix with Efficient Layer Tracking
MediumArrayDesignHash Table
Watch Solutions66.1% acceptance
3459. Length of Longest V-Shaped Diagonal Segment
HardArrayDynamic ProgrammingMatrix
Watch Solutions56.3% acceptance
3522. Calculate Score After Performing Instructions
MediumArrayHash TableSimulation
Watch Solutions57.0% acceptance
3427. Sum of Variable Length Subarrays
EasyArrayPrefix Sum
Watch Solutions85.6% acceptance
3430. Maximum and Minimum Sums of at Most Size K Subarrays
HardArrayMathMonotonic Stack
Watch Solutions25.9% acceptance
3452. Sum of Good Numbers
EasyArray
Watch Solutions69.6% acceptance
3473. Sum of K Subarrays With Length at Least M
MediumArrayDynamic ProgrammingPrefix Sum
Watch Solutions26.0% acceptance
3433. Count Mentions Per User
MediumArrayMathSimulation
Watch Solutions50.8% acceptance
3419. Minimize the Maximum Edge Weight of Graph
MediumBinary SearchBreadth-First SearchDepth-First Search
Watch Solutions45.2% acceptance
3409. Longest Subsequence With Decreasing Adjacent Difference
MediumArrayDynamic Programming
Watch Solutions16.7% 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.