Skip to main content
FleetCode

Video Solutions

Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.

24
With Videos
0
Easy
24
Medium
0
Hard

Filter by Difficulty

Browse video solutions by difficulty level

Clear filter×

3780. Maximum Sum of Three Numbers Divisible by Three

MediumArrayGreedyHeap (Priority Queue)
Watch Solutions47.7% acceptance

3795. Minimum Subarray Length With Distinct Sum At Least K

MediumArrayHash TableSliding Window
Watch Solutions31.7% acceptance

3789. Minimum Cost to Acquire Required Items

MediumGreedyMath
Watch Solutions34.8% acceptance

3811. Number of Alternating XOR Partitions

MediumArrayBit ManipulationDynamic Programming
Watch Solutions27.3% acceptance

3759. Count Elements With at Least K Greater Values

MediumArrayBinary SearchDivide and Conquer
Watch Solutions31.9% acceptance

3784. Minimum Deletion Cost to Make All Characters Equal

MediumArrayEnumerationHash Table
Watch Solutions55.0% acceptance

3839. Number of Prefix Connected Groups

MediumArrayCountingHash Table
Watch Solutions60.5% acceptance

3756. Concatenate Non-Zero Digits and Multiply by Sum II

MediumMathPrefix SumString
Watch Solutions42.7% acceptance

3828. Final Element After Subarray Deletions

MediumArrayBrainteaserGame Theory
Watch Solutions40.9% acceptance

3744. Find Kth Character in Expanded String

MediumString
Watch Solutions55.8% acceptance

3730. Maximum Calories Burnt from Jumps

MediumArrayGreedySorting
Watch Solutions72.2% acceptance

3732. Maximum Product of Three Elements After One Replacement

MediumArrayGreedyMath
Watch Solutions47.8% acceptance

3765. Complete Prime Number

MediumEnumerationMathNumber Theory
Watch Solutions36.9% acceptance

3760. Maximum Substrings With Distinct Start

MediumHash TableString
Watch Solutions91.4% acceptance

3770. Largest Prime from Consecutive Prime Sum

MediumArrayMathNumber Theory
Watch Solutions39.0% acceptance

3711. Maximum Transactions Without Negative Balance

MediumArrayGreedyHeap (Priority Queue)
Watch Solutions46.1% acceptance

3727. Maximum Alternating Sum of Squares

MediumArrayGreedySorting
Watch Solutions61.3% acceptance

3752. Lexicographically Smallest Negated Permutation that Sums to Target

MediumArrayGreedyMath
Watch Solutions31.5% acceptance

3737. Count Subarrays With Majority Element I

MediumArrayCountingDivide and Conquer
Watch Solutions75.7% acceptance

3815. Design Auction System

MediumDesignHash TableHeap (Priority Queue)
Watch Solutions41.9% acceptance

3709. Design Exam Scores Tracker

MediumArrayBinary SearchDesign
Watch Solutions44.0% acceptance

3714. Longest Balanced Substring II

MediumHash TablePrefix SumString
Watch Solutions42.0% acceptance

3713. Longest Balanced Substring I

MediumCountingEnumerationHash Table
Watch Solutions69.7% acceptance

3747. Count Distinct Integers After Removing Zeros

MediumDynamic ProgrammingMath
Watch Solutions23.1% acceptance
Page 37 of 42

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.