FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
41
With Videos
10
Easy
22
Medium
9
Hard
1351. Count Negative Numbers in a Sorted Matrix
EasyArrayBinary SearchMatrix
Watch Solutions79.6% acceptance
1352. Product of the Last K Numbers
MediumArrayData StreamDesign
Watch Solutions62.9% acceptance
1353. Maximum Number of Events That Can Be Attended
MediumArrayGreedyHeap (Priority Queue)
Watch Solutions38.9% acceptance
1354. Construct Target Array With Multiple Sums
HardArrayHeap (Priority Queue)
Watch Solutions36.8% acceptance
1355. Activity Participants
MediumDatabase
Watch Solutions72.3% acceptance
1356. Sort Integers by The Number of 1 Bits
EasyArrayBit ManipulationCounting
Watch Solutions82.3% acceptance
1358. Number of Substrings Containing All Three Characters
MediumHash TableSliding WindowString
Watch Solutions74.4% acceptance
1359. Count All Valid Pickup and Delivery Options
HardCombinatoricsDynamic ProgrammingMath
Watch Solutions64.9% acceptance
1361. Validate Binary Tree Nodes
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions43.8% acceptance
1363. Largest Multiple of Three
HardArrayDynamic ProgrammingGreedy
Watch Solutions33.2% acceptance
1364. Number of Trusted Contacts of a Customer
MediumDatabase
Watch Solutions74.9% acceptance
1365. How Many Numbers Are Smaller Than the Current Number
EasyArrayCountingHash Table
Watch Solutions87.0% acceptance
1366. Rank Teams by Votes
MediumArrayCountingHash Table
Watch Solutions60.1% acceptance
1367. Linked List in Binary Tree
MediumBinary TreeDepth-First SearchLinked List
Watch Solutions52.1% acceptance
1368. Minimum Cost to Make at Least One Valid Path in a Grid
HardArrayBreadth-First SearchGraph
Watch Solutions70.9% acceptance
1369. Get the Second Most Recent Activity
HardDatabase
Watch Solutions67.5% acceptance
1370. Increasing Decreasing String
EasyCountingHash TableString
Watch Solutions77.3% acceptance
1371. Find the Longest Substring Containing Vowels in Even Counts
MediumBit ManipulationHash TablePrefix Sum
Watch Solutions75.7% acceptance
1372. Longest ZigZag Path in a Binary Tree
MediumBinary TreeDepth-First SearchDynamic Programming
Watch Solutions67.0% acceptance
1374. Generate a String With Characters That Have Odd Counts
EasyString
Watch Solutions78.1% acceptance
1375. Number of Times Binary String Is Prefix-Aligned
MediumArray
Watch Solutions65.8% acceptance
1376. Time Needed to Inform All Employees
MediumBreadth-First SearchDepth-First SearchTree
Watch Solutions60.6% acceptance
1378. Replace Employee ID With The Unique Identifier
EasyDatabase
Watch Solutions83.6% acceptance
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
EasyBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions85.9% acceptance
1380. Lucky Numbers in a Matrix
EasyArrayMatrix
Watch Solutions79.9% acceptance
1381. Design a Stack With Increment Operation
MediumArrayDesignStack
Watch Solutions79.9% acceptance
1382. Balance a Binary Search Tree
MediumBinary Search TreeBinary TreeDepth-First Search
Watch Solutions86.3% acceptance
1383. Maximum Performance of a Team
HardArrayGreedyHeap (Priority Queue)
Watch Solutions47.6% acceptance
1384. Total Sales Amount by Year
HardDatabase
Watch Solutions61.0% acceptance
1387. Sort Integers by The Power Value
MediumDynamic ProgrammingMemoizationSorting
Watch Solutions71.6% acceptance
1390. Four Divisors
MediumArrayMath
Watch Solutions56.6% acceptance
1391. Check if There is a Valid Path in a Grid
MediumArrayBreadth-First SearchDepth-First Search
Watch Solutions64.5% acceptance
1392. Longest Happy Prefix
HardHash FunctionRolling HashString
Watch Solutions53.5% acceptance
1393. Capital Gain/Loss
MediumDatabase
Watch Solutions85.3% acceptance
1394. Find Lucky Integer in an Array
EasyArrayCountingHash Table
Watch Solutions75.5% acceptance
1395. Count Number of Teams
MediumArrayBinary Indexed TreeDynamic Programming
Watch Solutions70.1% acceptance
1396. Design Underground System
MediumDesignHash TableString
Watch Solutions74.8% acceptance
1397. Find All Good Strings
HardDynamic ProgrammingStringString Matching
Watch Solutions45.8% acceptance
1398. Customers Who Bought Products A and B but Not C
MediumDatabase
Watch Solutions72.3% acceptance
1399. Count Largest Group
EasyHash TableMath
Watch Solutions74.7% acceptance
1400. Construct K Palindrome Strings
MediumCountingGreedyHash Table
Watch Solutions68.6% 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.