FleetCode
Video Solutions
Watch step-by-step video walkthroughs for DSA problems. Learn from expert explanations.
40
With Videos
11
Easy
24
Medium
5
Hard
1701. Average Waiting Time
MediumArraySimulation
Watch Solutions73.1% acceptance
1702. Maximum Binary String After Change
MediumGreedyString
Watch Solutions48.1% acceptance
1704. Determine if String Halves Are Alike
EasyCountingString
Watch Solutions78.6% acceptance
1706. Where Will the Ball Fall
MediumArrayMatrixSimulation
Watch Solutions71.9% acceptance
1708. Largest Subarray Length K
EasyArrayGreedy
Watch Solutions65.7% acceptance
1709. Biggest Window Between Visits
MediumDatabase
Watch Solutions70.3% acceptance
1711. Count Good Meals
MediumArrayHash Table
Watch Solutions32.7% acceptance
1712. Ways to Split Array Into Three Subarrays
MediumArrayBinary SearchPrefix Sum
Watch Solutions34.2% acceptance
1713. Minimum Operations to Make a Subsequence
HardArrayBinary SearchGreedy
Watch Solutions49.7% acceptance
1714. Sum Of Special Evenly-Spaced Elements In Array
HardArrayDynamic Programming
Watch Solutions49.9% acceptance
1715. Count Apples and Oranges
MediumDatabase
Watch Solutions75.6% acceptance
1716. Calculate Money in Leetcode Bank
EasyMath
Watch Solutions82.4% acceptance
1717. Maximum Score From Removing Substrings
MediumGreedyStackString
Watch Solutions66.6% acceptance
1718. Construct the Lexicographically Largest Valid Sequence
MediumArrayBacktracking
Watch Solutions72.7% acceptance
1720. Decode XORed Array
EasyArrayBit Manipulation
Watch Solutions87.3% acceptance
1721. Swapping Nodes in a Linked List
MediumLinked ListTwo Pointers
Watch Solutions69.3% acceptance
1722. Minimize Hamming Distance After Swap Operations
MediumArrayDepth-First SearchUnion Find
Watch Solutions69.6% acceptance
1725. Number Of Rectangles That Can Form The Largest Square
EasyArray
Watch Solutions79.5% acceptance
1726. Tuple with Same Product
MediumArrayCountingHash Table
Watch Solutions70.1% acceptance
1727. Largest Submatrix With Rearrangements
MediumArrayGreedyMatrix
Watch Solutions80.3% acceptance
1728. Cat and Mouse II
HardArrayDynamic ProgrammingGame Theory
Watch Solutions40.4% acceptance
1729. Find Followers Count
EasyDatabase
Watch Solutions69.3% acceptance
1730. Shortest Path to Get Food
MediumArrayBreadth-First SearchMatrix
Watch Solutions57.1% acceptance
1731. The Number of Employees Which Report to Each Employee
EasyDatabase
Watch Solutions50.6% acceptance
1732. Find the Highest Altitude
EasyArrayPrefix Sum
Watch Solutions84.7% acceptance
1733. Minimum Number of People to Teach
MediumArrayGreedyHash Table
Watch Solutions67.7% acceptance
1734. Decode XORed Permutation
MediumArrayBit Manipulation
Watch Solutions67.0% acceptance
1736. Latest Time by Replacing Hidden Digits
EasyGreedyString
Watch Solutions43.7% acceptance
1738. Find Kth Largest XOR Coordinate Value
MediumArrayBit ManipulationDivide and Conquer
Watch Solutions64.3% acceptance
1739. Building Boxes
HardBinary SearchGreedyMath
Watch Solutions52.5% acceptance
1740. Find Distance in a Binary Tree
MediumBinary TreeBreadth-First SearchDepth-First Search
Watch Solutions74.3% acceptance
1741. Find Total Time Spent by Each Employee
EasyDatabase
Watch Solutions86.9% acceptance
1742. Maximum Number of Balls in a Box
EasyCountingHash TableMath
Watch Solutions74.8% acceptance
1743. Restore the Array From Adjacent Pairs
MediumArrayDepth-First SearchHash Table
Watch Solutions74.7% acceptance
1744. Can You Eat Your Favorite Candy on Your Favorite Day?
MediumArrayPrefix Sum
Watch Solutions36.1% acceptance
1745. Palindrome Partitioning IV
HardDynamic ProgrammingString
Watch Solutions45.2% acceptance
1746. Maximum Subarray Sum After One Operation
MediumArrayDynamic Programming
Watch Solutions65.2% acceptance
1747. Leetflex Banned Accounts
MediumDatabase
Watch Solutions62.9% acceptance
1749. Maximum Absolute Sum of Any Subarray
MediumArrayDynamic Programming
Watch Solutions71.1% acceptance
1750. Minimum Length of String After Deleting Similar Ends
MediumStringTwo Pointers
Watch Solutions55.9% 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.