Solutions & Explanations

Browse 4,030+ detailed solutions with multiple approaches, code in Python, Java, C++ and more.

4,030 Solutions961 Easy2102 Medium967 Hard

Title	Difficulty	Acceptance	Topics	Solution
1651. Hopper Company Queries III	Hard	65.6%	Database	Read
1652. Defuse the Bomb	Easy	79.2%	Array Sliding Window	Read
1653. Minimum Deletions to Make String Balanced	Medium	68.2%	Dynamic Programming Stack+1	Read
1654. Minimum Jumps to Reach Home	Medium	30.7%	Array Breadth-First Search+1	Read
1655. Distribute Repeating Integers	Hard	41.1%	Array Backtracking+3	Read
1656. Design an Ordered Stream	Easy	82.6%	Array Data Stream+2	Read
1657. Determine if Two Strings Are Close	Medium	54.2%	Counting Hash Table+2	Read
1658. Minimum Operations to Reduce X to Zero	Medium	40.5%	Array Binary Search+3	Read
1659. Maximize Grid Happiness	Hard	41.6%	Bit Manipulation Bitmask+2	Read
1660. Correct a Binary Tree	Medium	74.3%	Binary Tree Breadth-First Search+3	Read
1661. Average Time of Process per Machine	Easy	68.7%	Database	Read
1662. Check If Two String Arrays are Equivalent	Easy	86.2%	Array String	Read
1663. Smallest String With A Given Numeric Value	Medium	67.5%	Greedy String	Read
1664. Ways to Make a Fair Array	Medium	67.2%	Array Prefix Sum	Read
1665. Minimum Initial Energy to Finish Tasks	Hard	76.5%	Array Greedy+1	Read
1666. Change the Root of a Binary Tree	Medium	74.4%	Binary Tree Depth-First Search+1	Read
1667. Fix Names in a Table	Easy	61.3%	Database	Read
1668. Maximum Repeating Substring	Easy	41.9%	Dynamic Programming String+1	Read
1669. Merge In Between Linked Lists	Medium	82.9%	Linked List	Read
1670. Design Front Middle Back Queue	Medium	58.5%	Array Data Stream+3	Read
1671. Minimum Number of Removals to Make Mountain Array	Hard	55.0%	Array Binary Search+2	Read
1672. Richest Customer Wealth	Easy	88.9%	Array Matrix	Read
1673. Find the Most Competitive Subsequence	Medium	53.4%	Array Greedy+2	Read
1674. Minimum Moves to Make Array Complementary	Medium	65.2%	Array Hash Table+1	Read
1675. Minimize Deviation in Array	Hard	54.0%	Array Greedy+2	Read
1676. Lowest Common Ancestor of a Binary Tree IV	Medium	79.6%	Binary Tree Depth-First Search+2	Read
1677. Product's Worth Over Invoices	Easy	38.2%	Database	Read
1678. Goal Parser Interpretation	Easy	88.0%	String	Read
1679. Max Number of K-Sum Pairs	Medium	56.9%	Array Hash Table+2	Read
1680. Concatenation of Consecutive Binary Numbers	Medium	66.6%	Bit Manipulation Math+1	Read
1681. Minimum Incompatibility	Hard	41.8%	Array Bit Manipulation+2	Read
1682. Longest Palindromic Subsequence II	Medium	50.1%	Dynamic Programming String	Read
1683. Invalid Tweets	Easy	85.6%	Database	Read
1684. Count the Number of Consistent Strings	Easy	88.1%	Array Bit Manipulation+3	Read
1685. Sum of Absolute Differences in a Sorted Array	Medium	68.2%	Array Math+1	Read
1686. Stone Game VI	Medium	61.4%	Array Game Theory+4	Read
1687. Delivering Boxes from Storage to Ports	Hard	40.1%	Array Dynamic Programming+5	Read
1688. Count of Matches in Tournament	Easy	86.4%	Math Simulation	Read
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers	Medium	90.5%	Greedy String	Read
1690. Stone Game VII	Medium	59.4%	Array Dynamic Programming+2	Read
1691. Maximum Height by Stacking Cuboids	Hard	62.4%	Array Dynamic Programming+1	Read
1692. Count Ways to Distribute Candies	Hard	62.7%	Dynamic Programming	Read
1693. Daily Leads and Partners	Easy	86.6%	Database	Read
1694. Reformat Phone Number	Easy	67.7%	String	Read
1695. Maximum Erasure Value	Medium	64.2%	Array Hash Table+1	Read
1696. Jump Game VI	Medium	46.4%	Array Dynamic Programming+3	Read
1697. Checking Existence of Edge Length Limited Paths	Hard	63.2%	Array Graph+3	Read
1698. Number of Distinct Substrings in a String	Medium	64.4%	Hash Function Rolling Hash+3	Read
1699. Number of Calls Between Two Persons	Medium	81.1%	Database	Read
1700. Number of Students Unable to Eat Lunch	Easy	79.5%	Array Queue+2	Read

#1651Hard

Hopper Company Queries III

Database

Acceptance: 65.6%

#1652Easy

Defuse the Bomb

ArraySliding Window

Acceptance: 79.2%

#1653Medium

Minimum Deletions to Make String Balanced

Dynamic ProgrammingStackString

Acceptance: 68.2%

#1654Medium

Minimum Jumps to Reach Home

ArrayBreadth-First SearchDynamic Programming

Acceptance: 30.7%

#1655Hard

Distribute Repeating Integers

ArrayBacktrackingBit Manipulation+2

Acceptance: 41.1%

#1656Easy

Design an Ordered Stream

ArrayData StreamDesign+1

Acceptance: 82.6%

#1657Medium

Determine if Two Strings Are Close

CountingHash TableSorting+1

Acceptance: 54.2%

#1658Medium

Minimum Operations to Reduce X to Zero

ArrayBinary SearchHash Table+2

Acceptance: 40.5%

#1659Hard

Maximize Grid Happiness

Bit ManipulationBitmaskDynamic Programming+1

Acceptance: 41.6%

#1660Medium

Correct a Binary Tree

Binary TreeBreadth-First SearchDepth-First Search+2

Acceptance: 74.3%

#1661Easy

Average Time of Process per Machine

Database

Acceptance: 68.7%

#1662Easy

Check If Two String Arrays are Equivalent

ArrayString

Acceptance: 86.2%

#1663Medium

Smallest String With A Given Numeric Value

GreedyString

Acceptance: 67.5%

#1664Medium

Ways to Make a Fair Array

ArrayPrefix Sum

Acceptance: 67.2%

#1665Hard

Minimum Initial Energy to Finish Tasks

ArrayGreedySorting

Acceptance: 76.5%

#1666Medium

Change the Root of a Binary Tree

Binary TreeDepth-First SearchTree

Acceptance: 74.4%

#1667Easy

Fix Names in a Table

Database

Acceptance: 61.3%

#1668Easy

Maximum Repeating Substring

Dynamic ProgrammingStringString Matching

Acceptance: 41.9%

#1669Medium

Merge In Between Linked Lists

Linked List

Acceptance: 82.9%

#1670Medium

Design Front Middle Back Queue

ArrayData StreamDesign+2

Acceptance: 58.5%

#1671Hard

Minimum Number of Removals to Make Mountain Array

ArrayBinary SearchDynamic Programming+1

Acceptance: 55.0%

#1672Easy

Richest Customer Wealth

ArrayMatrix

Acceptance: 88.9%

#1673Medium

Find the Most Competitive Subsequence

ArrayGreedyMonotonic Stack+1

Acceptance: 53.4%

#1674Medium

Minimum Moves to Make Array Complementary

ArrayHash TablePrefix Sum

Acceptance: 65.2%

#1675Hard

Minimize Deviation in Array

ArrayGreedyHeap (Priority Queue)+1

Acceptance: 54.0%

#1676Medium

Lowest Common Ancestor of a Binary Tree IV

Binary TreeDepth-First SearchHash Table+1

Acceptance: 79.6%

#1677Easy

Product's Worth Over Invoices

Database

Acceptance: 38.2%

#1678Easy

Goal Parser Interpretation

String

Acceptance: 88.0%

#1679Medium

Max Number of K-Sum Pairs

ArrayHash TableSorting+1

Acceptance: 56.9%

#1680Medium

Concatenation of Consecutive Binary Numbers

Bit ManipulationMathSimulation

Acceptance: 66.6%

#1681Hard

Minimum Incompatibility

ArrayBit ManipulationBitmask+1

Acceptance: 41.8%

#1682Medium

Longest Palindromic Subsequence II

Dynamic ProgrammingString

Acceptance: 50.1%

#1683Easy

Invalid Tweets

Database

Acceptance: 85.6%

#1684Easy

Count the Number of Consistent Strings

ArrayBit ManipulationCounting+2

Acceptance: 88.1%

#1685Medium

Sum of Absolute Differences in a Sorted Array

ArrayMathPrefix Sum

Acceptance: 68.2%

#1686Medium

Stone Game VI

ArrayGame TheoryGreedy+3

Acceptance: 61.4%

#1687Hard

Delivering Boxes from Storage to Ports

ArrayDynamic ProgrammingHeap (Priority Queue)+4

Acceptance: 40.1%

#1688Easy

Count of Matches in Tournament

MathSimulation

Acceptance: 86.4%

#1689Medium

Partitioning Into Minimum Number Of Deci-Binary Numbers

GreedyString

Acceptance: 90.5%

#1690Medium

Stone Game VII

ArrayDynamic ProgrammingGame Theory+1

Acceptance: 59.4%

#1691Hard

Maximum Height by Stacking Cuboids

ArrayDynamic ProgrammingSorting

Acceptance: 62.4%

#1692Hard

Count Ways to Distribute Candies

Dynamic Programming

Acceptance: 62.7%

#1693Easy

Daily Leads and Partners

Database

Acceptance: 86.6%

#1694Easy

Reformat Phone Number

String

Acceptance: 67.7%

#1695Medium

Maximum Erasure Value

ArrayHash TableSliding Window

Acceptance: 64.2%

#1696Medium

Jump Game VI

ArrayDynamic ProgrammingHeap (Priority Queue)+2

Acceptance: 46.4%

#1697Hard

Checking Existence of Edge Length Limited Paths

ArrayGraphSorting+2

Acceptance: 63.2%

#1698Medium

Number of Distinct Substrings in a String

Hash FunctionRolling HashString+2

Acceptance: 64.4%

#1699Medium

Number of Calls Between Two Persons

Database

Acceptance: 81.1%

#1700Easy

Number of Students Unable to Eat Lunch

ArrayQueueSimulation+1

Acceptance: 79.5%

1 2 333 34 3579 80 81

Page 34 of 81

Master DSA with Step-by-Step Solutions

Each solution article on FleetCode breaks down the problem into multiple approaches, from brute force to optimal, with detailed explanations and code in Python, Java, C++ and more. Understanding why an approach works - not just copying code - is what separates candidates who clear interviews from those who don't.

How to Use These Solutions

Try the problem first: Spend at least 20 minutes before reading the solution
Read all approaches: Start from brute force to understand the problem fully, then study the optimized solution
Understand the complexity: Pay attention to time and space analysis for each approach
Code it yourself: After understanding the approach, close the solution and implement from memory
Revisit after a week: Spaced repetition helps retain problem-solving patterns