FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
43
With Videos
0
Easy
43
Medium
0
Hard
Filter by Difficulty
Browse video solutions by difficulty level
1364. Number of Trusted Contacts of a Customer
MediumDatabase
Watch Solutions74.9% 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
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
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
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
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
1393. Capital Gain/Loss
MediumDatabase
Watch Solutions85.3% acceptance
1395. Count Number of Teams
MediumArrayBinary Indexed TreeDynamic Programming
Watch Solutions70.1% acceptance
1396. Design Underground System
MediumDesignHash TableString
Watch Solutions74.8% acceptance
1398. Customers Who Bought Products A and B but Not C
MediumDatabase
Watch Solutions72.3% acceptance
1400. Construct K Palindrome Strings
MediumCountingGreedyHash Table
Watch Solutions68.6% 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
1409. Queries on a Permutation With Key
MediumArrayBinary Indexed TreeSimulation
Watch Solutions84.9% acceptance
1410. HTML Entity Parser
MediumHash TableString
Watch Solutions50.0% 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
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
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
1428. Leftmost Column with at Least a One
MediumArrayBinary SearchInteractive
Watch Solutions55.3% acceptance
1429. First Unique Number
MediumArrayData StreamDesign
Watch Solutions57.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
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
1445. Apples & Oranges
MediumDatabase
Watch Solutions86.0% acceptance
1448. Count Good Nodes in Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions73.8% acceptance
1451. Rearrange Words in a Sentence
MediumSortingString
Watch Solutions66.9% acceptance
1452. People Whose List of Favorite Companies Is Not a Subset of Another List
MediumArrayHash TableString
Watch Solutions60.6% acceptance
1454. Active Users
MediumDatabase
Watch Solutions36.7% acceptance
1457. Pseudo-Palindromic Paths in a Binary Tree
MediumBinary TreeBit ManipulationBreadth-First Search
Watch Solutions68.3% acceptance
1459. Rectangles Area
MediumDatabase
Watch Solutions68.5% acceptance
1461. Check If a String Contains All Binary Codes of Size K
MediumBit ManipulationHash FunctionHash Table
Watch Solutions61.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.