FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
42
With Videos
14
Easy
20
Medium
8
Hard
1402. Reducing Dishes
HardArrayDynamic ProgrammingGreedy
Watch Solutions76.8% acceptance
1403. Minimum Subsequence in Non-Increasing Order
EasyArrayGreedySorting
Watch Solutions73.7% acceptance
1404. Number of Steps to Reduce a Number in Binary Representation to One
MediumBit ManipulationString
Watch Solutions63.8% acceptance
1405. Longest Happy String
MediumGreedyHeap (Priority Queue)String
Watch Solutions65.5% acceptance
1407. Top Travellers
EasyDatabase
Watch Solutions57.3% acceptance
1408. String Matching in an Array
EasyArrayStringString Matching
Watch Solutions69.8% acceptance
1409. Queries on a Permutation With Key
MediumArrayBinary Indexed TreeSimulation
Watch Solutions84.9% acceptance
1410. HTML Entity Parser
MediumHash TableString
Watch Solutions50.0% acceptance
1411. Number of Ways to Paint N × 3 Grid
HardDynamic Programming
Watch Solutions80.6% acceptance
1412. Find the Quiet Students in All Exams
HardDatabase
Watch Solutions58.7% acceptance
1413. Minimum Value to Get Positive Step by Step Sum
EasyArrayPrefix Sum
Watch Solutions65.1% acceptance
1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K
MediumGreedyMath
Watch Solutions64.9% acceptance
1415. The k-th Lexicographical String of All Happy Strings of Length n
MediumBacktrackingString
Watch Solutions87.1% acceptance
1416. Restore The Array
HardDynamic ProgrammingString
Watch Solutions47.2% acceptance
1417. Reformat The String
EasyString
Watch Solutions52.3% acceptance
1418. Display Table of Food Orders in a Restaurant
MediumArrayHash TableOrdered Set
Watch Solutions76.5% acceptance
1419. Minimum Number of Frogs Croaking
MediumCountingString
Watch Solutions51.2% acceptance
1421. NPV Queries
EasyDatabase
Watch Solutions82.8% acceptance
1422. Maximum Score After Splitting a String
EasyPrefix SumString
Watch Solutions65.1% acceptance
1423. Maximum Points You Can Obtain from Cards
MediumArrayPrefix SumSliding Window
Watch Solutions58.1% acceptance
1424. Diagonal Traverse II
MediumArrayHeap (Priority Queue)Sorting
Watch Solutions58.3% acceptance
1425. Constrained Subsequence Sum
HardArrayDynamic ProgrammingHeap (Priority Queue)
Watch Solutions56.5% acceptance
1426. Counting Elements
EasyArrayHash Table
Watch Solutions60.3% acceptance
1427. Perform String Shifts
EasyArrayMathString
Watch Solutions56.0% acceptance
1428. Leftmost Column with at Least a One
MediumArrayBinary SearchInteractive
Watch Solutions55.3% acceptance
1429. First Unique Number
MediumArrayData StreamDesign
Watch Solutions57.8% acceptance
1431. Kids With the Greatest Number of Candies
EasyArray
Watch Solutions87.8% acceptance
1432. Max Difference You Can Get From Changing an Integer
MediumGreedyMath
Watch Solutions48.8% acceptance
1433. Check If a String Can Break Another String
MediumGreedySortingString
Watch Solutions70.9% acceptance
1434. Number of Ways to Wear Different Hats to Each Other
HardArrayBit ManipulationBitmask
Watch Solutions46.4% acceptance
1435. Create a Session Bar Chart
EasyDatabase
Watch Solutions74.9% acceptance
1436. Destination City
EasyArrayHash TableString
Watch Solutions79.5% acceptance
1437. Check If All 1's Are at Least Length K Places Away
EasyArray
Watch Solutions64.3% acceptance
1440. Evaluate Boolean Expression
MediumDatabase
Watch Solutions72.6% acceptance
1441. Build an Array With Stack Operations
MediumArraySimulationStack
Watch Solutions81.0% acceptance
1442. Count Triplets That Can Form Two Arrays of Equal XOR
MediumArrayBit ManipulationHash Table
Watch Solutions84.9% acceptance
1443. Minimum Time to Collect All Apples in a Tree
MediumBreadth-First SearchDepth-First SearchHash Table
Watch Solutions63.6% acceptance
1444. Number of Ways of Cutting a Pizza
HardArrayDynamic ProgrammingMatrix
Watch Solutions61.8% acceptance
1445. Apples & Oranges
MediumDatabase
Watch Solutions86.0% acceptance
1446. Consecutive Characters
EasyString
Watch Solutions60.1% acceptance
1448. Count Good Nodes in Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions73.8% acceptance
1449. Form Largest Integer With Digits That Add up to Target
HardArrayDynamic Programming
Watch Solutions49.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.