FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
37
With Videos
0
Easy
37
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2738. Count Occurrences in Text
MediumDatabase
Watch Solutions55.6% acceptance
2740. Find the Value of the Partition
MediumArraySorting
Watch Solutions64.9% acceptance
2741. Special Permutations
MediumArrayBit ManipulationBitmask
Watch Solutions29.4% acceptance
2743. Count Substrings Without Repeating Character
MediumHash TableSliding WindowString
Watch Solutions75.9% acceptance
2749. Minimum Operations to Make the Integer Zero
MediumBit ManipulationBrainteaser
Watch Solutions58.2% acceptance
2750. Ways to Split Array Into Good Subarrays
MediumArrayDynamic ProgrammingMath
Watch Solutions34.9% acceptance
2754. Bind Function to Context
Medium
Watch Solutions87.0% acceptance
2755. Deep Merge of Two Objects
Medium
Watch Solutions66.4% acceptance
2757. Generate Circular Array Values
Medium
Watch Solutions73.3% acceptance
2762. Continuous Subarrays
MediumArrayHeap (Priority Queue)Monotonic Queue
Watch Solutions58.0% acceptance
2764. Is Array a Preorder of Some Binary Tree
MediumBinary TreeDepth-First SearchStack
Watch Solutions67.8% acceptance
2767. Partition String Into Minimum Beautiful Substrings
MediumBacktrackingDynamic ProgrammingHash Table
Watch Solutions54.0% acceptance
2771. Longest Non-decreasing Subarray From Two Arrays
MediumArrayDynamic Programming
Watch Solutions31.1% acceptance
2772. Apply Operations to Make All Array Elements Equal to Zero
MediumArrayPrefix Sum
Watch Solutions33.5% acceptance
2775. Undefined to Null
Medium
Watch Solutions69.6% acceptance
2776. Convert Callback Based Function to Promise Based Function
Medium
Watch Solutions92.1% acceptance
2777. Date Range Generator
Medium
Watch Solutions80.4% acceptance
2779. Maximum Beauty of an Array After Applying Operation
MediumArrayBinary SearchSliding Window
Watch Solutions58.4% acceptance
2780. Minimum Index of a Valid Split
MediumArrayHash TableSorting
Watch Solutions75.5% acceptance
2783. Flight Occupancy and Waitlist Analysis
MediumDatabase
Watch Solutions38.0% acceptance
2785. Sort Vowels in a String
MediumSortingString
Watch Solutions83.4% acceptance
2786. Visit Array Positions to Maximize Score
MediumArrayDynamic Programming
Watch Solutions37.5% acceptance
2787. Ways to Express an Integer as Sum of Powers
MediumDynamic Programming
Watch Solutions49.8% acceptance
2795. Parallel Execution of Promises for Individual Results Retrieval
Medium
Watch Solutions88.7% acceptance
2799. Count Complete Subarrays in an Array
MediumArrayHash TableSliding Window
Watch Solutions75.9% acceptance
2802. Find The K-th Lucky Number
MediumBit ManipulationMathString
Watch Solutions76.1% acceptance
2805. Custom Interval
Medium
Watch Solutions81.7% acceptance
2807. Insert Greatest Common Divisors in Linked List
MediumLinked ListMathNumber Theory
Watch Solutions91.4% acceptance
2808. Minimum Seconds to Equalize a Circular Array
MediumArrayHash Table
Watch Solutions28.5% acceptance
2811. Check if it is Possible to Split Array
MediumArrayDynamic ProgrammingGreedy
Watch Solutions34.5% acceptance
2812. Find the Safest Path in a Grid
MediumArrayBinary SearchBreadth-First Search
Watch Solutions57.0% acceptance
2816. Double a Number Represented as a Linked List
MediumLinked ListMathStack
Watch Solutions61.4% acceptance
2820. Election Results
Medium
Watch Solutions66.7% acceptance
2821. Delay the Resolution of Each Promise
Medium
Watch Solutions68.4% acceptance
2823. Deep Object Filter
Medium
Watch Solutions54.6% acceptance
2825. Make String a Subsequence Using Cyclic Increments
MediumStringTwo Pointers
Watch Solutions65.7% acceptance
2829. Determine the Minimum Sum of a k-avoiding Array
MediumGreedyMath
Watch Solutions61.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.