FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
28
With Videos
0
Easy
0
Medium
28
Hard
Filter by Difficulty
Browse video solutions by difficulty level
2742. Painting the Walls
HardArrayDynamic Programming
Watch Solutions49.0% acceptance
2751. Robot Collisions
HardArraySimulationSorting
Watch Solutions61.6% acceptance
2752. Customers with Maximum Number of Transactions on Consecutive Days
HardDatabase
Watch Solutions39.6% acceptance
2756. Query Batching
Hard
Watch Solutions63.0% acceptance
2759. Convert JSON String to Object
Hard
Watch Solutions61.7% acceptance
2781. Length of the Longest Valid Substring
HardArrayHash TableSliding Window
Watch Solutions38.3% acceptance
2790. Maximum Number of Groups With Increasing Length
HardArrayBinary SearchGreedy
Watch Solutions23.0% acceptance
2792. Count Nodes That Are Great Enough
HardBinary TreeDepth-First SearchDivide and Conquer
Watch Solutions56.5% acceptance
2793. Status of Flight Tickets
Hard
Watch Solutions76.1% acceptance
2813. Maximum Elegance of a K-Length Subsequence
HardArrayGreedyHash Table
Watch Solutions29.2% acceptance
2814. Minimum Time Takes to Reach Destination Without Drowning
HardArrayBreadth-First SearchMatrix
Watch Solutions54.7% acceptance
2818. Apply Operations to Maximize Score
HardArrayGreedyMath
Watch Solutions53.7% acceptance
2827. Number of Beautiful Integers in the Range
HardDynamic ProgrammingMath
Watch Solutions23.1% acceptance
2835. Minimum Operations to Form Subsequence With Target Sum
HardArrayBit ManipulationGreedy
Watch Solutions32.5% acceptance
2842. Count K-Subsequences of a String With Maximum Beauty
HardCombinatoricsGreedyHash Table
Watch Solutions30.2% acceptance
2851. String Transformation
HardDynamic ProgrammingMathString
Watch Solutions27.4% acceptance
2858. Minimum Edge Reversals So Every Node Is Reachable
HardBreadth-First SearchDepth-First SearchDynamic Programming
Watch Solutions59.6% acceptance
2872. Maximum Number of K-Divisible Components
HardDepth-First SearchTree
Watch Solutions74.1% acceptance
2902. Count of Sub-Multisets With Bounded Sum
HardArrayDynamic ProgrammingHash Table
Watch Solutions22.3% acceptance
2916. Subarrays Distinct Element Sum of Squares II
HardArrayBinary Indexed TreeDynamic Programming
Watch Solutions23.5% acceptance
2920. Maximum Points After Collecting Coins From All Nodes
HardArrayBit ManipulationDepth-First Search
Watch Solutions36.6% acceptance
2921. Maximum Profitable Triplets With Increasing Prices II
HardArrayBinary Indexed TreeSegment Tree
Watch Solutions46.1% acceptance
2926. Maximum Balanced Subsequence Sum
HardArrayBinary Indexed TreeBinary Search
Watch Solutions25.8% acceptance
2927. Distribute Candies Among Children III
HardCombinatoricsMath
Watch Solutions57.3% acceptance
2935. Maximum Strong Pair XOR II
HardArrayBit ManipulationHash Table
Watch Solutions32.9% acceptance
2940. Find Building Where Alice and Bob Can Meet
HardArrayBinary Indexed TreeBinary Search
Watch Solutions52.3% acceptance
2945. Find Maximum Non-decreasing Array Length
HardArrayBinary SearchDynamic Programming
Watch Solutions19.2% acceptance
2949. Count Beautiful Substrings II
HardHash TableMathNumber Theory
Watch Solutions27.5% 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.