FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
41
With Videos
10
Easy
21
Medium
10
Hard
3051. Find Candidates for Data Scientist Position
EasyDatabase
Watch Solutions74.7% acceptance
3052. Maximize Items
HardDatabase
Watch Solutions72.0% acceptance
3053. Classifying Triangles by Lengths
EasyDatabase
Watch Solutions50.3% acceptance
3054. Binary Tree Nodes
MediumDatabase
Watch Solutions79.8% acceptance
3055. Top Percentile Fraud
MediumDatabase
Watch Solutions58.1% acceptance
3056. Snaps Analysis
MediumDatabase
Watch Solutions58.0% acceptance
3057. Employees Project Allocation
HardDatabase
Watch Solutions68.4% acceptance
3058. Friends With No Mutual Friends
MediumDatabase
Watch Solutions49.4% acceptance
3059. Find All Unique Email Domains
EasyDatabase
Watch Solutions69.0% acceptance
3060. User Activities within Time Bounds
HardDatabase
Watch Solutions40.6% acceptance
3061. Calculate Trapping Rain Water
HardDatabase
Watch Solutions81.1% acceptance
3062. Winner of the Linked List Game
EasyLinked List
Watch Solutions77.6% acceptance
3063. Linked List Frequency
EasyCountingHash TableLinked List
Watch Solutions85.8% acceptance
3064. Guess the Number Using Bitwise Questions I
MediumBit ManipulationInteractive
Watch Solutions89.0% acceptance
3065. Minimum Operations to Exceed Threshold Value I
EasyArray
Watch Solutions86.7% acceptance
3066. Minimum Operations to Exceed Threshold Value II
MediumArrayHeap (Priority Queue)Simulation
Watch Solutions45.8% acceptance
3068. Find the Maximum Sum of Node Values
HardArrayBit ManipulationDynamic Programming
Watch Solutions69.5% acceptance
3070. Count Submatrices with Top-Left Element and Sum Less Than k
MediumArrayMatrixPrefix Sum
Watch Solutions74.8% acceptance
3073. Maximum Increasing Triplet Value
MediumArrayOrdered Set
Watch Solutions35.7% acceptance
3074. Apple Redistribution into Boxes
EasyArrayGreedySorting
Watch Solutions78.5% acceptance
3075. Maximize Happiness of Selected Children
MediumArrayGreedySorting
Watch Solutions58.7% acceptance
3076. Shortest Uncommon Substring in an Array
MediumArrayHash TableString
Watch Solutions50.8% acceptance
3077. Maximum Strength of K Disjoint Subarrays
HardArrayDynamic ProgrammingPrefix Sum
Watch Solutions28.2% acceptance
3081. Replace Question Marks in String to Minimize Its Value
MediumCountingGreedyHash Table
Watch Solutions29.0% acceptance
3083. Existence of a Substring in a String and Its Reverse
EasyHash TableString
Watch Solutions66.6% acceptance
3084. Count Substrings Starting and Ending with Given Character
MediumCountingMathString
Watch Solutions49.9% acceptance
3085. Minimum Deletions to Make String K-Special
MediumCountingGreedyHash Table
Watch Solutions67.2% acceptance
3086. Minimum Moves to Pick K Ones
HardArrayGreedyPrefix Sum
Watch Solutions21.6% acceptance
3087. Find Trending Hashtags
MediumDatabase
Watch Solutions62.0% acceptance
3088. Make String Anti-palindrome
HardCounting SortGreedySorting
Watch Solutions46.6% acceptance
3089. Find Bursty Behavior
MediumDatabase
Watch Solutions39.4% acceptance
3091. Apply Operations to Make Sum of Array Greater Than or Equal to k
MediumEnumerationGreedyMath
Watch Solutions44.2% acceptance
3092. Most Frequent IDs
MediumArrayHash TableHeap (Priority Queue)
Watch Solutions43.0% acceptance
3093. Longest Common Suffix Queries
HardArrayStringTrie
Watch Solutions52.8% acceptance
3094. Guess the Number Using Bitwise Questions II
MediumBit ManipulationInteractive
Watch Solutions83.0% acceptance
3095. Shortest Subarray With OR at Least K I
EasyArrayBit ManipulationSliding Window
Watch Solutions44.9% acceptance
3096. Minimum Levels to Gain More Points
MediumArrayPrefix Sum
Watch Solutions40.4% acceptance
3097. Shortest Subarray With OR at Least K II
MediumArrayBit ManipulationSliding Window
Watch Solutions50.5% acceptance
3098. Find the Sum of Subsequence Powers
HardArrayDynamic ProgrammingSorting
Watch Solutions25.1% acceptance
3099. Harshad Number
EasyMath
Watch Solutions83.4% acceptance
3100. Water Bottles II
MediumMathSimulation
Watch Solutions78.2% 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.