Solutions & Explanations

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

4,029 Solutions961 Easy2102 Medium966 Hard

Title	Difficulty	Acceptance	Topics	Solution
1463. Cherry Pickup II	Hard	72.4%	Array Dynamic Programming+1	Read
1467. Probability of a Two Boxes Having The Same Number of Distinct Balls	Hard	61.7%	Array Backtracking+4	Read
1473. Paint House III	Hard	60.9%	Array Dynamic Programming	Read
1478. Allocate Mailboxes	Hard	57.1%	Array Dynamic Programming+2	Read
1479. Sales by Day of the Week	Hard	77.4%	Database	Read
1483. Kth Ancestor of a Tree Node	Hard	39.7%	Binary Search Breadth-First Search+4	Read
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree	Hard	66.4%	Graph Minimum Spanning Tree+3	Read
1494. Parallel Courses II	Hard	31.3%	Bit Manipulation Bitmask+2	Read
1499. Max Value of Equation	Hard	45.0%	Array Heap (Priority Queue)+3	Read
1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits	Hard	41.8%	Binary Indexed Tree Greedy+2	Read
1510. Stone Game IV	Hard	65.2%	Dynamic Programming Game Theory+1	Read
1515. Best Position for a Service Centre	Hard	35.8%	Array Geometry+2	Read
1516. Move Sub-Tree of N-Ary Tree	Hard	59.7%	Depth-First Search Tree	Read
1520. Maximum Number of Non-Overlapping Substrings	Hard	64.4%	Greedy String	Read
1521. Find a Value of a Mysterious Function Closest to Target	Hard	47.7%	Array Binary Search+2	Read
1526. Minimum Number of Increments on Subarrays to Form a Target Array	Hard	78.2%	Array Dynamic Programming+3	Read
1531. String Compression II	Hard	52.2%	Dynamic Programming String	Read
1537. Get the Maximum Score	Hard	41.5%	Array Dynamic Programming+2	Read
1542. Find Longest Awesome Substring	Hard	47.4%	Bit Manipulation Hash Table+1	Read
1547. Minimum Cost to Cut a Stick	Hard	62.9%	Array Dynamic Programming+1	Read
1548. The Most Similar Path in a Graph	Hard	59.2%	Dynamic Programming Graph	Read
1553. Minimum Number of Days to Eat N Oranges	Hard	36.2%	Dynamic Programming Memoization	Read
1563. Stone Game V	Hard	58.8%	Array Dynamic Programming+2	Read
1568. Minimum Number of Days to Disconnect Island	Hard	58.8%	Array Breadth-First Search+3	Read
1569. Number of Ways to Reorder Array to Get Same BST	Hard	54.0%	Array Binary Search Tree+8	Read
1575. Count All Possible Routes	Hard	65.1%	Array Dynamic Programming+1	Read
1579. Remove Max Number of Edges to Keep Graph Fully Traversable	Hard	70.1%	Graph Union Find	Read
1585. Check If String Is Transformable With Substring Sort Operations	Hard	51.9%	Greedy Sorting+1	Read
1591. Strange Printer II	Hard	60.8%	Array Graph+2	Read
1595. Minimum Cost to Connect Two Groups of Points	Hard	50.3%	Array Bit Manipulation+3	Read
1597. Build Binary Expression Tree From Infix Expression	Hard	62.5%	Binary Tree Stack+2	Read
1601. Maximum Number of Achievable Transfer Requests	Hard	64.5%	Array Backtracking+2	Read
1606. Find Servers That Handled Most Number of Requests	Hard	45.3%	Array Greedy+2	Read
1610. Maximum Number of Visible Points	Hard	38.1%	Array Geometry+3	Read
1611. Minimum One Bit Operations to Make Integers Zero	Hard	78.5%	Bit Manipulation Dynamic Programming+1	Read
1617. Count Subtrees With Max Distance Between Cities	Hard	67.4%	Bit Manipulation Bitmask+3	Read
1622. Fancy Sequence	Hard	41.3%	Design Math+1	Read
1627. Graph Connectivity With Threshold	Hard	49.9%	Array Math+2	Read
1632. Rank Transform of a Matrix	Hard	42.1%	Array Graph+4	Read
1635. Hopper Company Queries I	Hard	47.7%	Database	Read
1639. Number of Ways to Form a Target String Given a Dictionary	Hard	56.6%	Array Dynamic Programming+1	Read
1643. Kth Smallest Instructions	Hard	44.7%	Array Combinatorics+2	Read
1645. Hopper Company Queries II	Hard	39.1%	Database	Read
1649. Create Sorted Array through Instructions	Hard	42.1%	Array Binary Indexed Tree+5	Read
1651. Hopper Company Queries III	Hard	65.6%	Database	Read
1655. Distribute Repeating Integers	Hard	41.1%	Array Backtracking+3	Read
1659. Maximize Grid Happiness	Hard	41.6%	Bit Manipulation Bitmask+2	Read
1665. Minimum Initial Energy to Finish Tasks	Hard	76.5%	Array Greedy+1	Read
1671. Minimum Number of Removals to Make Mountain Array	Hard	55.0%	Array Binary Search+2	Read
1675. Minimize Deviation in Array	Hard	54.0%	Array Greedy+2	Read

#1463Hard

Cherry Pickup II

ArrayDynamic ProgrammingMatrix

Acceptance: 72.4%

#1467Hard

Probability of a Two Boxes Having The Same Number of Distinct Balls

ArrayBacktrackingCombinatorics+3

Acceptance: 61.7%

#1473Hard

Paint House III

ArrayDynamic Programming

Acceptance: 60.9%

#1478Hard

Allocate Mailboxes

ArrayDynamic ProgrammingMath+1

Acceptance: 57.1%

#1479Hard

Sales by Day of the Week

Database

Acceptance: 77.4%

#1483Hard

Kth Ancestor of a Tree Node

Binary SearchBreadth-First SearchDepth-First Search+3

Acceptance: 39.7%

#1489Hard

Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

GraphMinimum Spanning TreeSorting+2

Acceptance: 66.4%

#1494Hard

Parallel Courses II

Bit ManipulationBitmaskDynamic Programming+1

Acceptance: 31.3%

#1499Hard

Max Value of Equation

ArrayHeap (Priority Queue)Monotonic Queue+2

Acceptance: 45.0%

#1505Hard

Minimum Possible Integer After at Most K Adjacent Swaps On Digits

Binary Indexed TreeGreedySegment Tree+1

Acceptance: 41.8%

#1510Hard

Stone Game IV

Dynamic ProgrammingGame TheoryMath

Acceptance: 65.2%

#1515Hard

Best Position for a Service Centre

ArrayGeometryMath+1

Acceptance: 35.8%

#1516Hard

Move Sub-Tree of N-Ary Tree

Depth-First SearchTree

Acceptance: 59.7%

#1520Hard

Maximum Number of Non-Overlapping Substrings

GreedyString

Acceptance: 64.4%

#1521Hard

Find a Value of a Mysterious Function Closest to Target

ArrayBinary SearchBit Manipulation+1

Acceptance: 47.7%

#1526Hard

Minimum Number of Increments on Subarrays to Form a Target Array

ArrayDynamic ProgrammingGreedy+2

Acceptance: 78.2%

#1531Hard

String Compression II

Dynamic ProgrammingString

Acceptance: 52.2%

#1537Hard

Get the Maximum Score

ArrayDynamic ProgrammingGreedy+1

Acceptance: 41.5%

#1542Hard

Find Longest Awesome Substring

Bit ManipulationHash TableString

Acceptance: 47.4%

#1547Hard

Minimum Cost to Cut a Stick

ArrayDynamic ProgrammingSorting

Acceptance: 62.9%

#1548Hard

The Most Similar Path in a Graph

Dynamic ProgrammingGraph

Acceptance: 59.2%

#1553Hard

Minimum Number of Days to Eat N Oranges

Dynamic ProgrammingMemoization

Acceptance: 36.2%

#1563Hard

Stone Game V

ArrayDynamic ProgrammingGame Theory+1

Acceptance: 58.8%

#1568Hard

Minimum Number of Days to Disconnect Island

ArrayBreadth-First SearchDepth-First Search+2

Acceptance: 58.8%

#1569Hard

Number of Ways to Reorder Array to Get Same BST

ArrayBinary Search TreeBinary Tree+7

Acceptance: 54.0%

#1575Hard

Count All Possible Routes

ArrayDynamic ProgrammingMemoization

Acceptance: 65.1%

#1579Hard

Remove Max Number of Edges to Keep Graph Fully Traversable

GraphUnion Find

Acceptance: 70.1%

#1585Hard

Check If String Is Transformable With Substring Sort Operations

GreedySortingString

Acceptance: 51.9%

#1591Hard

Strange Printer II

ArrayGraphMatrix+1

Acceptance: 60.8%

#1595Hard

Minimum Cost to Connect Two Groups of Points

ArrayBit ManipulationBitmask+2

Acceptance: 50.3%

#1597Hard

Build Binary Expression Tree From Infix Expression

Binary TreeStackString+1

Acceptance: 62.5%

#1601Hard

Maximum Number of Achievable Transfer Requests

ArrayBacktrackingBit Manipulation+1

Acceptance: 64.5%

#1606Hard

Find Servers That Handled Most Number of Requests

ArrayGreedyHeap (Priority Queue)+1

Acceptance: 45.3%

#1610Hard

Maximum Number of Visible Points

ArrayGeometryMath+2

Acceptance: 38.1%

#1611Hard

Minimum One Bit Operations to Make Integers Zero

Bit ManipulationDynamic ProgrammingMemoization

Acceptance: 78.5%

#1617Hard

Count Subtrees With Max Distance Between Cities

Bit ManipulationBitmaskDynamic Programming+2

Acceptance: 67.4%

#1622Hard

Fancy Sequence

DesignMathSegment Tree

Acceptance: 41.3%

#1627Hard

Graph Connectivity With Threshold

ArrayMathNumber Theory+1

Acceptance: 49.9%

#1632Hard

Rank Transform of a Matrix

ArrayGraphMatrix+3

Acceptance: 42.1%

#1635Hard

Hopper Company Queries I

Database

Acceptance: 47.7%

#1639Hard

Number of Ways to Form a Target String Given a Dictionary

ArrayDynamic ProgrammingString

Acceptance: 56.6%

#1643Hard

Kth Smallest Instructions

ArrayCombinatoricsDynamic Programming+1

Acceptance: 44.7%

#1645Hard

Hopper Company Queries II

Database

Acceptance: 39.1%

#1649Hard

Create Sorted Array through Instructions

ArrayBinary Indexed TreeBinary Search+4

Acceptance: 42.1%

#1651Hard

Hopper Company Queries III

Database

Acceptance: 65.6%

#1655Hard

Distribute Repeating Integers

ArrayBacktrackingBit Manipulation+2

Acceptance: 41.1%

#1659Hard

Maximize Grid Happiness

Bit ManipulationBitmaskDynamic Programming+1

Acceptance: 41.6%

#1665Hard

Minimum Initial Energy to Finish Tasks

ArrayGreedySorting

Acceptance: 76.5%

#1671Hard

Minimum Number of Removals to Make Mountain Array

ArrayBinary SearchDynamic Programming+1

Acceptance: 55.0%

#1675Hard

Minimize Deviation in Array

ArrayGreedyHeap (Priority Queue)+1

Acceptance: 54.0%

1 2 36 7 818 19 20

Page 7 of 20

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