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
351. Android Unlock Patterns	Medium	53.8%	Backtracking Bit Manipulation+2	Read
352. Data Stream as Disjoint Intervals	Hard	60.2%	Binary Search Design+1	Read
353. Design Snake Game	Medium	40.0%	Array Design+3	Read
354. Russian Doll Envelopes	Hard	37.8%	Array Binary Search+2	Read
355. Design Twitter	Medium	45.6%	Design Hash Table+2	Read
356. Line Reflection	Medium	36.3%	Array Hash Table+1	Read
357. Count Numbers with Unique Digits	Medium	56.1%	Backtracking Dynamic Programming+1	Read
358. Rearrange String k Distance Apart	Hard	39.9%	Counting Greedy+4	Read
359. Logger Rate Limiter	Easy	76.8%	Data Stream Design+1	Read
360. Sort Transformed Array	Medium	58.0%	Array Math+2	Read
361. Bomb Enemy	Medium	52.8%	Array Dynamic Programming+1	Read
362. Design Hit Counter	Medium	69.6%	Array Binary Search+3	Read
363. Max Sum of Rectangle No Larger Than K	Hard	46.0%	Array Binary Search+3	Read
364. Nested List Weight Sum II	Medium	66.8%	Breadth-First Search Depth-First Search+1	Read
365. Water and Jug Problem	Medium	46.4%	Breadth-First Search Depth-First Search+1	Read
366. Find Leaves of Binary Tree	Medium	81.4%	Binary Tree Depth-First Search+1	Read
367. Valid Perfect Square	Easy	44.8%	Binary Search Math	Read
368. Largest Divisible Subset	Medium	50.1%	Array Dynamic Programming+2	Read
369. Plus One Linked List	Medium	61.1%	Linked List Math	Read
370. Range Addition	Medium	73.0%	Array Prefix Sum	Read
371. Sum of Two Integers	Medium	55.9%	Bit Manipulation Math	Read
372. Super Pow	Medium	37.3%	Divide and Conquer Math	Read
373. Find K Pairs with Smallest Sums	Medium	42.3%	Array Heap (Priority Queue)	Read
374. Guess Number Higher or Lower	Easy	57.9%	Binary Search Interactive	Read
375. Guess Number Higher or Lower II	Medium	53.2%	Dynamic Programming Game Theory+1	Read
376. Wiggle Subsequence	Medium	49.3%	Array Dynamic Programming+1	Read
377. Combination Sum IV	Medium	55.0%	Array Dynamic Programming	Read
378. Kth Smallest Element in a Sorted Matrix	Medium	65.1%	Array Binary Search+3	Read
379. Design Phone Directory	Medium	52.7%	Array Design+3	Read
380. Insert Delete GetRandom O(1)	Medium	55.3%	Array Design+3	Read
381. Insert Delete GetRandom O(1) - Duplicates allowed	Hard	36.5%	Array Design+3	Read
382. Linked List Random Node	Medium	64.7%	Linked List Math+2	Read
383. Ransom Note	Easy	66.3%	Counting Hash Table+1	Read
384. Shuffle an Array	Medium	59.6%	Array Design+2	Read
385. Mini Parser	Medium	43.4%	Depth-First Search Stack+1	Read
386. Lexicographical Numbers	Medium	76.2%	Depth-First Search Trie	Read
387. First Unique Character in a String	Easy	66.4%	Counting Hash Table+2	Read
388. Longest Absolute File Path	Medium	49.9%	Depth-First Search Stack+1	Read
389. Find the Difference	Easy	60.2%	Bit Manipulation Hash Table+2	Read
390. Elimination Game	Medium	46.7%	Math Recursion	Read
391. Perfect Rectangle	Hard	38.8%	Array Line Sweep	Read
392. Is Subsequence	Easy	48.9%	Dynamic Programming String+1	Read
393. UTF-8 Validation	Medium	46.7%	Array Bit Manipulation	Read
394. Decode String	Medium	63.0%	Recursion Stack+1	Read
395. Longest Substring with At Least K Repeating Characters	Medium	46.2%	Divide and Conquer Hash Table+2	Read
396. Rotate Function	Medium	54.0%	Array Dynamic Programming+1	Read
397. Integer Replacement	Medium	37.9%	Bit Manipulation Dynamic Programming+2	Read
398. Random Pick Index	Medium	65.0%	Hash Table Math+2	Read
399. Evaluate Division	Medium	64.1%	Array Breadth-First Search+5	Read
400. Nth Digit	Medium	38.8%	Binary Search Math	Read

#351Medium

Android Unlock Patterns

BacktrackingBit ManipulationBitmask+1

Acceptance: 53.8%

#352Hard

Data Stream as Disjoint Intervals

Binary SearchDesignOrdered Set

Acceptance: 60.2%

#353Medium

Design Snake Game

ArrayDesignHash Table+2

Acceptance: 40.0%

#354Hard

Russian Doll Envelopes

ArrayBinary SearchDynamic Programming+1

Acceptance: 37.8%

#355Medium

Design Twitter

DesignHash TableHeap (Priority Queue)+1

Acceptance: 45.6%

#356Medium

Line Reflection

ArrayHash TableMath

Acceptance: 36.3%

#357Medium

Count Numbers with Unique Digits

BacktrackingDynamic ProgrammingMath

Acceptance: 56.1%

#358Hard

Rearrange String k Distance Apart

CountingGreedyHash Table+3

Acceptance: 39.9%

#359Easy

Logger Rate Limiter

Data StreamDesignHash Table

Acceptance: 76.8%

#360Medium

Sort Transformed Array

ArrayMathSorting+1

Acceptance: 58.0%

#361Medium

Bomb Enemy

ArrayDynamic ProgrammingMatrix

Acceptance: 52.8%

#362Medium

Design Hit Counter

ArrayBinary SearchData Stream+2

Acceptance: 69.6%

#363Hard

Max Sum of Rectangle No Larger Than K

ArrayBinary SearchMatrix+2

Acceptance: 46.0%

#364Medium

Nested List Weight Sum II

Breadth-First SearchDepth-First SearchStack

Acceptance: 66.8%

#365Medium

Water and Jug Problem

Breadth-First SearchDepth-First SearchMath

Acceptance: 46.4%

#366Medium

Find Leaves of Binary Tree

Binary TreeDepth-First SearchTree

Acceptance: 81.4%

#367Easy

Valid Perfect Square

Binary SearchMath

Acceptance: 44.8%

#368Medium

Largest Divisible Subset

ArrayDynamic ProgrammingMath+1

Acceptance: 50.1%

#369Medium

Plus One Linked List

Linked ListMath

Acceptance: 61.1%

#370Medium

Range Addition

ArrayPrefix Sum

Acceptance: 73.0%

#371Medium

Sum of Two Integers

Bit ManipulationMath

Acceptance: 55.9%

#372Medium

Super Pow

Divide and ConquerMath

Acceptance: 37.3%

#373Medium

Find K Pairs with Smallest Sums

ArrayHeap (Priority Queue)

Acceptance: 42.3%

#374Easy

Guess Number Higher or Lower

Binary SearchInteractive

Acceptance: 57.9%

#375Medium

Guess Number Higher or Lower II

Dynamic ProgrammingGame TheoryMath

Acceptance: 53.2%

#376Medium

Wiggle Subsequence

ArrayDynamic ProgrammingGreedy

Acceptance: 49.3%

#377Medium

Combination Sum IV

ArrayDynamic Programming

Acceptance: 55.0%

#378Medium

Kth Smallest Element in a Sorted Matrix

ArrayBinary SearchHeap (Priority Queue)+2

Acceptance: 65.1%

#379Medium

Design Phone Directory

ArrayDesignHash Table+2

Acceptance: 52.7%

#380Medium

Insert Delete GetRandom O(1)

ArrayDesignHash Table+2

Acceptance: 55.3%

#381Hard

Insert Delete GetRandom O(1) - Duplicates allowed

ArrayDesignHash Table+2

Acceptance: 36.5%

#382Medium

Linked List Random Node

Linked ListMathRandomized+1

Acceptance: 64.7%

#383Easy

Ransom Note

CountingHash TableString

Acceptance: 66.3%

#384Medium

Shuffle an Array

ArrayDesignMath+1

Acceptance: 59.6%

#385Medium

Mini Parser

Depth-First SearchStackString

Acceptance: 43.4%

#386Medium

Lexicographical Numbers

Depth-First SearchTrie

Acceptance: 76.2%

#387Easy

First Unique Character in a String

CountingHash TableQueue+1

Acceptance: 66.4%

#388Medium

Longest Absolute File Path

Depth-First SearchStackString

Acceptance: 49.9%

#389Easy

Find the Difference

Bit ManipulationHash TableSorting+1

Acceptance: 60.2%

#390Medium

Elimination Game

MathRecursion

Acceptance: 46.7%

#391Hard

Perfect Rectangle

ArrayLine Sweep

Acceptance: 38.8%

#392Easy

Is Subsequence

Dynamic ProgrammingStringTwo Pointers

Acceptance: 48.9%

#393Medium

UTF-8 Validation

ArrayBit Manipulation

Acceptance: 46.7%

#394Medium

Decode String

RecursionStackString

Acceptance: 63.0%

#395Medium

Longest Substring with At Least K Repeating Characters

Divide and ConquerHash TableSliding Window+1

Acceptance: 46.2%

#396Medium

Rotate Function

ArrayDynamic ProgrammingMath

Acceptance: 54.0%

#397Medium

Integer Replacement

Bit ManipulationDynamic ProgrammingGreedy+1

Acceptance: 37.9%

#398Medium

Random Pick Index

Hash TableMathRandomized+1

Acceptance: 65.0%

#399Medium

Evaluate Division

ArrayBreadth-First SearchDepth-First Search+4

Acceptance: 64.1%

#400Medium

Nth Digit

Binary SearchMath

Acceptance: 38.8%

1 2 37 8 979 80 81

Page 8 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