- Array & String
- Binary Search
- Bitwise Manipulation
- Design
- Dynamic Programming
- Graph
- Greedy
- Hash Map/Hash Set
- Heap/Priority Queue
- Linked List
- Recursion
- Stack & Queue
- Tree
- Trie
- ⛔⛔⛔ 135. Candy
- 🍀 163. Missing Ranges
- 🍀 168. Excel Sheet Column Title
Math
- 🍀 169. Majority Element
Sort
Hash Map
Hash Set
Bitwise Manipulations
Boyer-Moore Voting Algorithm
Divide & Conquer
Math
- 🍀 228. Summary Ranges
⚠️ ⚠️ 229. Majority Element IIHash Map
Boyer-Moore Voting Algorithm
⚠️ ⚠️ 238. Product of Array Except SelfPrefix Sum
Two Pointers
- 🍀 293. Flip Game
⚠️ ⚠️ 334. Increasing Triplet Subsequence⚠️ ⚠️ 443. String Compression- ⛔⛔⛔ 956. Tallest Billboard
Dynamic Programming
- 🍀 859. Buddy Strings
- 🍀 896. Monotonic Array
- 🍀 1071. Greatest Common Divisor of Strings
- 🍀 1232. Check If It Is a Straight Line
Math
- 🍀 1431. Kids With the Greatest Number of Candies
- 🍀 1464. Maximum Product of Two Elements in an Array
Priority Queue
Sorting
- 🍀 1491. Average Salary Excluding the Minimum and Maximum Salary
- 🍀 1502. Can Make Arithmetic Progression From Sequence
Sorting
⚠️ ⚠️ 1503. Last Moment Before All Ants Fall Out of a PlankBrainteasing
⚠️ ⚠️ 1561. Maximum Number of Coins You Can Get⚠️ ⚠️ 1630. Arithmetic SubarraysSort
Math
- 🍀 1716. Calculate Money in Leetcode Bank
Math
- 🍀 1822. Sign of the Product of an Array
⚠️ ⚠️ 1887. Reduction Operations to Make the Array Elements EqualSorting
- 🍀 1909. Remove One Element to Make the Array Strictly Increasing
- 🍀 1913. Maximum Product Difference Between Two Pairs
Sort
Priority Queue
- 🍀 2264. Largest 3-Same-Digit Number in String
Hash Map
⚠️ ⚠️ 2483. Minimum Penalty for a Shop- 🍀 2660. Determine the Winner of a Bowling Game
Brainteasing
- 🍀 2706. Buy Two Chocolates
Priority Queue
Counting Sort
Bucket Sort
Greedy Algorithm
⚠️ ⚠️ 2966. Divide Array Into Arrays With Max DifferenceSorting
⚠️ ⚠️ 2971. Find Polygon With the Largest PerimeterSorting
⚠️ ⚠️ 36. Valid SudokuArray & String
Hash Set
Bitwise Manipulation
⚠️ ⚠️ 311. Sparse Matrix Multiplication⚠️ ⚠️ 498. Diagonal TraverseDepth First Search
Hash Map
⚠️ ⚠️ 1055. Shortest Way to Form StringTwo Pointers
Binary Search
2D Array
Dynamic Programming
- ⛔⛔⛔ 1074. Number of Submatrices That Sum to Target
Prefix Sum
- 🍀 1351. Count Negative Numbers in a Sorted Matrix
Binary Search
Linear Traversal
⚠️ ⚠️ 1428. Leftmost Column with at Least a OneBinary Search
Vertical Traversal
- 🍀 1582. Special Positions in a Binary Matrix
Hash Map
Sorting
⚠️ ⚠️ 56. Merge IntervalsSorting
Graph
Union-Find
⚠️ ⚠️ 57. Insert IntervalBinary Search
- 🍀 252. Meeting Rooms
Sorting
⚠️ ⚠️ 253. Meeting Rooms IIPriority Queue
Chronological Ordering
Sorting
⚠️ ⚠️ 435. Non-overlapping IntervalsGreedy
⚠️ ⚠️ 452. Minimum Number of Arrows to Burst BalloonsGreedy
⚠️ ⚠️ 624. Maximum Distance in ArraysGreedy
- ⛔⛔⛔ 1235. Maximum Profit in Job Scheduling
Dynamic Programming
Priority Queue
Sorting
⚠️ ⚠️ 1272. Remove IntervalGreedy
- ⛔⛔⛔ 2402. Meeting Rooms III
Priority Queue
Sorting
-
⚠️ ⚠️ 567. Permutation in StringHash Map
Two Pointers
-
⚠️ ⚠️ 904. Fruit Into BasketsSliding Window
Two Pointers
Hash Map
-
🍀 1065. Index Pairs of a String
Trie
Hash Set
-
⚠️ ⚠️ 1493. Longest Subarray of 1's After Deleting One ElementTwo Pointers
-
⛔⛔⛔ 2009. Minimum Number of Operations to Make Array Continuous
Binary Search
-
-
⚠️ ⚠️ 3. Longest Substring Without Repeating CharactersHash Map
-
⚠️ ⚠️ 159. Longest Substring with At Most Two Distinct CharactersSliding Window
Two Pointers
Hash Map
-
⚠️ ⚠️ 340. Longest Substring with At Most K Distinct CharactersSliding Window
Hash Map
Binary Search
-
⚠️ ⚠️ 424. Longest Repeating Character ReplacementHash Map
Hash Set
-
⚠️ ⚠️ 1456. Maximum Number of Vowels in a Substring of Given Length -
⚠️ ⚠️ 2024. Maximize the Confusion of an ExamHash Map
Binary Search
-
⚠️ ⚠️ 5. Longest Palindromic SubstringDynamic Programming
Sliding Window
Two Pointers
Manacher's Algorithm
- 🍀 125. Valid Palindrome
⚠️ ⚠️ 647. Palindromic SubstringsDynamic Programming
Manacher's Algorithm
- ⛔⛔⛔ 1216. Valid Palindrome III
Dynamic Programming
Breadth-First Search
Two Pointers
-
- 🍀 28. Find the Index of the First Occurrence in a String
Sliding Window
Rabin-Karp Algorithm
Knuth–Morris–Pratt Algorithm
- 🍀 459. Repeated Substring Pattern
Rabin-Karp Algorithm
Knuth–Morris–Pratt Algorithm
⚠️ ⚠️ 686. Repeated String MatchRabin-Karp Algorithm
Knuth–Morris–Pratt Algorithm
- 🍀 28. Find the Index of the First Occurrence in a String
-
⚠️ ⚠️ 43. Multiply Strings- [66. Plus One]
- [67. Add Binary]
- 🍀 258. Add Digits
Math
- [415. Add Strings]
- [989. Add to Array-Form of Integer]
- Count Binary Substrings
- Subarray Product Less Than K
- Binary Subarrays With Sum parent problem for 3 pointers -> 992. Subarrays with K Different Integers
- Number of Substrings Containing All Three Characters
- Number of Substrings With Only 1s
- Longest Substring Of All Vowels in Order
- Count Vowel Substrings of a String
- Vowels of All Substrings
- Count Subarrays With Score Less Than K
⚠️ ⚠️ 11. Container With Most Water⚠️ ⚠️ 151. Reverse Words in a String⚠️ ⚠️ 189. Rotate Array- 🍀 283. Move Zeroes
- 🍀 344. Reverse String
- 🍀 345. Reverse Vowels of a String
- 🍀 392. Is Subsequence
Greedy Algorithm
Divide & Conquer
Dynamic Programming
- 🍀 455. Assign Cookies
Sorting
- 🍀 557. Reverse Words in a String III
- 🍀 905. Sort Array By Parity
- 🍀 977. Squares of a Sorted Array
Heap
Sorting
⚠️ ⚠️ 1441. Build an Array With Stack Operations⚠️ ⚠️ 1498. Number of Subsequences That Satisfy the Given Sum ConditionBinary Search
⚠️ ⚠️ 1578. Minimum Time to Make Rope ColorfulGreedy
- 🍀 1099. Two Sum Less Than K
Sorting
Binary Search
Counting Sort
⚠️ ⚠️ 1679. Max Number of K-Sum PairsHash Map
Sorting
⚠️ ⚠️ 1750. Minimum Length of String After Deleting Similar EndsArray & String
Two Pointers
- 🍀 1768. Merge Strings Alternately
⚠️ ⚠️ 1877. Minimize Maximum Pair Sum in ArraySorting
- 🍀 1. Two Sum
Hash Table
⚠️ ⚠️ 15. 3Sum⚠️ ⚠️ 16. 3Sum ClosestBinary Search
⚠️ ⚠️ 18. 4Sum⚠️ ⚠️ 167. Two Sum II - Input Array Is SortedHash Table
⚠️ ⚠️ 454. 4Sum II- 🍀 1099. Two Sum Less Than K
-
⚠️ ⚠️ 34. Find First and Last Position of Element in Sorted Array -
🍀 69. Sqrt(x)
Math
Bitwise Manipulation
-
🍀 367. Valid Perfect Square
Math
-
⚠️ ⚠️ 658. Find K Closest ElementsSliding Window
-
⚠️ ⚠️ 702. Search in a Sorted Array of Unknown SizeBitwise Manipulation
-
⛔⛔⛔ 719. Find K-th Smallest Pair Distance
Heap
Prefix Sum
Sliding Window
-
⚠️ ⚠️ 1060. Missing Element in Sorted ArrayArray & String
-
Minimum number of days to make m bouquets
-
Magnetic force between two balls
-
Split array largest sum
-
Divide chocolate (for premium users only)
-
Cutting ribbons (for premium users only)
-
⚠️ ⚠️ 1802. Maximum Value at a Given Index in a Bounded ArrayGreedy & Binary Search
-
⛔⛔⛔ 2141. Maximum Running Time of N Computers
Prefix Sum
Greedy
-
⛔⛔⛔ 2251. Number of Flowers in Full Bloom
Priority Queue
Two Pointer
-
⚠️ ⚠️ 2300. Successful Pairs of Spells and PotionsTwo Pointers
- 🍀 136. Single Number
⚠️ ⚠️ 137. Single Number IISorting
Hash Map
Mathematics
Karnaugh Map
- 🍀 190. Reverse Bits
- 🍀 191. Number of 1 Bits
⚠️ ⚠️ 201. Bitwise AND of Numbers RangeBitwise Manipulation
Brian Kernighan's Algorithm
- 🍀 231. Power of Two
- 🍀 268. Missing Number
Sorting
Hash Map
Hash Set
Math
⚠️ ⚠️ 319. Bulb SwitcherBrainteaser
Math
- 🍀 338. Counting Bits
Dynamic Programming
- 🍀 342. Power of Four
Math
- 🍀 389. Find the Difference
Array & String
Counter
Hash Map
Hash Set
Sorting
- ⛔⛔⛔ 458. Poor Pigs
Quantum Bit
- ⛔⛔⛔ 847. Shortest Path Visiting All Nodes
Graph
Dynamic Programming
Depth-First Search
Breadth-First Search
⚠️ ⚠️ 1066. Campus Bikes IIDynamic Programming
Greedy Algorithm
Backtracking
Dijkstra's Algorithm
⚠️ ⚠️ 1239. Maximum Length of a Concatenated String with Unique CharactersDepth-First Search
Bitmasking
Backtracking
Recursion
⚠️ ⚠️ 1318. Minimum Flips to Make a OR b Equal to c- 🍀 1356. Sort Integers by The Number of 1 Bits
Sorting
Brian Kerninghan's Algorithm
- ⛔⛔⛔ 1611. Minimum One Bit Operations to Make Integers Zero
- 🍀 2864. Maximum Odd Binary Number
Array & String
Two Pointers
Bit Manipulations
-
⚠️ ⚠️ 146. LRU CacheOrdered Dict
Hash Map
Linked List
-
⚠️ ⚠️ 155. Min StackMonotonic Stack
-
⚠️ ⚠️ 211. Design Add and Search Words Data StructureTrie
Hash Map
-
⚠️ ⚠️ 304. Range Sum Query 2D - ImmutablePrefix Sum
Dynamic Programming
-
⚠️ ⚠️ 341. Flatten Nested List IteratorRecursion
-
⚠️ ⚠️ 348. Design Tic-Tac-ToeMatrix
-
⚠️ ⚠️ 528. Random Pick with WeightHash Set
-
🍀 703. Kth Largest Element in a Stream
Priority Queue
-
🍀 705. Design HashSet
Linked List
Binary Search Tree
-
🍀 706. Design HashMap
Array & String
-
⛔⛔⛔ 716. Max Stack
Linked List
Priority Queue
-
⚠️ ⚠️ 901. Online Stock SpanMonotonic Stack
-
🍀 933. Number of Recent Calls
Queue
-
⚠️ ⚠️ 1146. Snapshot ArrayBinary Search
Hash Map
-
⚠️ ⚠️ 1396. Design Underground SystemHash Map
-
⚠️ ⚠️ 1472. Design Browser HistoryLinked List
-
🍀 1603. Design Parking System
Hash Table
-
⚠️ ⚠️ 1845. Seat Reservation ManagerPriority Queue
Sorted Set
-
⚠️ ⚠️ 2336. Smallest Number in Infinite SetPriority Queue
-
⚠️ ⚠️ 2353. Design a Food Rating SystemPriority Queue
Hash Map
SortedSet
-
Implement Stack using Queues
-
Design Linked List
⚠️ ⚠️ 50. Pow(x, n)Binary Search
⚠️ ⚠️ 72. Edit Distance- ⛔⛔⛔ 87. Scramble String
⚠️ ⚠️ 91. Decode Ways⚠️ ⚠️ 139. Word Break⚠️ ⚠️ 256. Paint House- ⛔⛔⛔ 265. Paint House II
⚠️ ⚠️ 276. Paint Fence⚠️ ⚠️ 279. Perfect SquaresBreadth-First Search
⚠️ ⚠️ 322. Coin Change⚠️ ⚠️ 368. Largest Divisible Subset⚠️ ⚠️ 376. Wiggle SubsequenceGreedy
⚠️ ⚠️ 377. Combination Sum IV- ⛔⛔⛔ 403. Frog Jump
- ⛔⛔⛔ 410. Split Array Largest Sum
Binary Search
⚠️ ⚠️ 416. Partition Equal Subset Sum⚠️ ⚠️ 486. Predict the WinnerRecursion
⚠️ ⚠️ 518. Coin Change II⚠️ ⚠️ 651. 4 Keys KeyboardMath
⚠️ ⚠️ 688. Knight Probability in Chessboard⚠️ ⚠️ 712. Minimum ASCII Delete Sum for Two StringsRecursion
⚠️ ⚠️ 837. New 21 Game⚠️ ⚠️ 935. Knight DialerGraph
⚠️ ⚠️ 1043. Partition Array for Maximum Sum- ⛔⛔⛔ 1187. Make Array Strictly Increasing
Binary Search
⚠️ ⚠️ 1140. Stone Game II⚠️ ⚠️ 1155. Number of Dice Rolls With Target Sum- ⛔⛔⛔ 1199. Minimum Time to Build Blocks
Priority Queue
- ⛔⛔⛔ 1220. Count Vowels Permutation
⚠️ ⚠️ 1218. Longest Arithmetic Subsequence of Given Difference⚠️ ⚠️ 1230. Toss Strange Coins- ⛔⛔⛔ 1335. Minimum Difficulty of a Job Schedule
- ⛔⛔⛔ 1359. Count All Valid Pickup and Delivery Options
Monotonic Stack
- ⛔⛔⛔ 1406. Stone Game III
- ⛔⛔⛔ 1416. Restore The Array
- ⛔⛔⛔ 1444. Number of Ways of Cutting a Pizza
- ⛔⛔⛔ 1531. String Compression II
- ⛔⛔⛔ 1547. Minimum Cost to Cut a Stick
- ⛔⛔⛔ 1575. Count All Possible Routes
- ⛔⛔⛔ 1751. Maximum Number of Events That Can Be Attended II
Binary Search
Sorting
⚠️ ⚠️ 2140. Solving Questions With Brainpower- ⛔⛔⛔ 2147. Number of Ways to Divide a Long Corridor
Math
⚠️ ⚠️ 2291. Maximum Profit From Trading Stocks- ⛔⛔⛔ 2328. Number of Increasing Paths in a Grid
- ⛔⛔⛔ 2355. Maximum Number of Books You Can Take
- ⛔⛔⛔ 2361. Minimum Costs Using the Train Line
⚠️ ⚠️ 2369. Check if There is a Valid Partition For The Array⚠️ ⚠️ 2466. Count Ways To Build Good Strings- ⛔⛔⛔ 2742. Painting the Walls
⚠️ ⚠️ 2770. Maximum Number of Jumps to Reach the Last Index
- 🍀 70. Climbing Stairs
Recursion
Bitwise Manipulations
⚠️ ⚠️ 198. House Robber- 🍀 509. Fibonacci Number
⚠️ ⚠️ 740. Delete and Earn- 🍀 746. Min Cost Climbing Stairs
- 🍀 1137. N-th Tribonacci Number
⚠️ ⚠️ 62. Unique Paths⚠️ ⚠️ 63. Unique Paths II⚠️ ⚠️ 64. Minimum Path Sum- 🍀 118. Pascal's Triangle
⚠️ ⚠️ 120. Triangle⚠️ ⚠️ 221. Maximal Square⚠️ ⚠️ 799. Champagne Tower- 🍀 867. Transpose Matrix
⚠️ ⚠️ 931. Minimum Falling Path Sum
⚠️ ⚠️ 516. Longest Palindromic Subsequence- ⛔⛔⛔ 727. Minimum Window Subsequence
Greedy
Sliding Window
⚠️ ⚠️ 1035. Uncrossed Lines⚠️ ⚠️ 1143. Longest Common Subsequence- ⛔⛔⛔ 1312. Minimum Insertion Steps to Make a String Palindrome
⚠️ ⚠️ 300. Longest Increasing SubsequenceBinary Search
⚠️ ⚠️ 673. Number of Longest Increasing Subsequence⚠️ ⚠️ 1027. Longest Arithmetic Subsequence⚠️ ⚠️ 1048. Longest String Chain⚠️ ⚠️ 1218. Longest Arithmetic Subsequence of Given Difference- ⛔⛔⛔ 1964. Find the Longest Valid Obstacle Course at Each Position
Binary Search
Greedy
- ⛔⛔⛔ 2407. Longest Increasing Subsequence II
Segment Tree
Numpy
- ⛔⛔⛔ 879. Profitable Schemes
⚠️ ⚠️ 983. Minimum Cost For Tickets- ⛔⛔⛔ 1402. Reducing Dishes
Greedy
- 🍀 121. Best Time to Buy and Sell Stock
⚠️ ⚠️ 122. Best Time to Buy and Sell Stock IIGreedy
- ⛔⛔⛔ 123. Best Time to Buy and Sell Stock III
- ⛔⛔⛔ 188. Best Time to Buy and Sell Stock IV
⚠️ ⚠️ 309. Best Time to Buy and Sell Stock with Cooldown⚠️ ⚠️ 714. Best Time to Buy and Sell Stock with Transaction FeeGreedy
-
⚠️ ⚠️ 53. Maximum SubarrayKadane's Algorithm
Divide & Conquer
-
⚠️ ⚠️ 152. Maximum Product SubarrayKadane's Algorithm
-
⛔⛔⛔ 2272. Substring With Largest Variance
Kadane's Algorithm
-
[718. Maximum Length of Repeated Subarray] Similar Problems: 72, 10, 44, 97, 115, 583, 712, 1187, 1143, 1092, 718
⚠️ ⚠️ 560. Subarray Sum Equals KDynamic Programming
Prefix Sum
Hash Map
- 🍀 724. Find Pivot Index
- 🍀 1732. Find the Highest Altitude
⚠️ ⚠️ 2439. Minimize Maximum of ArrayDynamic Programming
- 🍀 2485. Find the Pivot Integer
Binary Search
- 🍀 997. Find the Town Judge
⚠️ ⚠️ 1236. Web CrawlerBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1466. Reorder Routes to Make All Paths Lead to the City ZeroBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1557. Minimum Number of Vertices to Reach All NodesHash Map
Hash Set
⚠️ ⚠️ 1615. Maximal Network Rank⚠️ ⚠️ 1631. Path With Minimum EffortDepth-First Search
Breadth-First Search
Priority Queue
Union-Find
Binary Search Tree
Dijkstra's Algorithm
Backtracking
⚠️ ⚠️ 210. Course Schedule IITopological Sorting
Kahn's Algorithm
⚠️ ⚠️ 802. Find Eventual Safe StatesTopological Sorting
Kahn's Algorithm
- ⛔⛔⛔ 815. Bus Routes
- ⛔⛔⛔ 864. Shortest Path to Get All Keys
⚠️ ⚠️ 1245. Tree DiameterBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1514. Path with Maximum ProbabilityBellman-Ford Algorithm
Shortest Path Faster Algorithm
Dijkstra's Algorithm
⚠️ ⚠️ 1926. Nearest Exit from Entrance in Maze
⚠️ ⚠️ 133. Clone Graph- ⛔⛔⛔ 332. Reconstruct Itinerary
Backtracking
Greedy
Hierholzer's Algorithm
⚠️ ⚠️ 841. Keys and Rooms⚠️ ⚠️ 1254. Number of Closed IslandsBreadth-First Search
Graph
Union-Find
⚠️ ⚠️ 1743. Restore the Array From Adjacent PairsLinked List
- ⛔⛔⛔ 1857. Largest Color Value in a Directed Graph
Topological Sorted Order
Kahn's Algorithm
- ⛔⛔⛔ 2360. Longest Cycle in a Graph
Topological Sorted Order
Kahn's Algorithm
⚠️ ⚠️ 207. Course ScheduleKahn's Algorithm
Depth-First Search
Breadth-First Search
⚠️ ⚠️ 1136. Parallel CoursesKahn's Algorithm
Depth-First Search
Breadth-First Search
⚠️ ⚠️ 399. Evaluate DivisionDepth-First Search
⚠️ ⚠️ 547. Number of ProvincesBreadth-First Search
Depth-First Search
- ⛔⛔⛔ 839. Similar String Groups
Breadth-First Search
Depth-First Search
⚠️ ⚠️ 947. Most Stones Removed with Same Row or ColumnBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1319. Number of Operations to Make Network ConnectedBreadth-First Search
Depth-First Search
- ⛔⛔⛔ 1579. Remove Max Number of Edges to Keep Graph Fully Traversable
⚠️ ⚠️ 1584. Min Cost to Connect All PointsKruskal's Algorithm
Prim's Algorithm
Union-Find
Priority Queue
- ⛔⛔⛔ 1697. Checking Existence of Edge Length Limited Paths
- ⛔⛔⛔ 1970. Last Day Where You Can Still Cross
Breadth-First Search
Depth-First Search
⚠️ ⚠️ 2316. Count Unreachable Pairs of Nodes in an Undirected GraphBreadth-First Search
Depth-First Search
⚠️ ⚠️ 2492. Minimum Score of a Path Between Two CitiesBreadth-First Search
Depth-First Search
- 🍀 326. Power of Three
Math
- 🍀 409. Longest Palindrome
Hash Set
Hash Map
- 🍀 605. Can Place Flowers
⚠️ ⚠️ 646. Maximum Length of Pair ChainDynamic Programming
⚠️ ⚠️ 881. Boats to Save PeopleTwo Pointers
⚠️ ⚠️ 946. Validate Stack SequencesStack
⚠️ ⚠️ 948. Bag of TokensSorting
Two Pointers
Queue
- ⛔⛔⛔ 1183. Maximum Number of Ones
- ⛔⛔⛔ 1326. Minimum Number of Taps to Open to Water a Garden
Dynamic Programming
⚠️ ⚠️ 1328. Break a Palindrome⚠️ ⚠️ 2038. Remove Colored Pieces if Both Neighbors are the Same ColorArray & String
Regular Expression
Greedy
Sliding Window
⚠️ ⚠️ 2125. Number of Laser Beams in a Ban⚠️ ⚠️ 2131. Longest Palindrome by Concatenating Two Letter Words- ⛔⛔⛔ 2366. Minimum Replacements to Sort the Array
⚠️ ⚠️ 2393. Count Strictly Increasing SubarraysDynamic Programming
⚠️ ⚠️ 2405. Optimal Partition of StringHash Table
- ⛔⛔⛔ 2551. Put Marbles in Bags
Sorting
⚠️ ⚠️ 791. Custom Sort StringArray & String
Hash Map
⚠️ ⚠️ 49. Group Anagrams⚠️ ⚠️ 347. Top K Frequent ElementsPriority Queue
Sorting
Quickselect (Hoare's Selection Algorithm)
- 🍀 350. Intersection of Two Arrays II
- 🍀 387. First Unique Character in a String
⚠️ ⚠️ 451. Sort Characters By FrequencyPriority Queue
Bucket Sort
- 🍀 760. Find Anagram Mappings
- 🍀 1160. Find Words That Can Be Formed by Characters
- 🍀 1207. Unique Number of Occurrences
⚠️ ⚠️ 1282. Group the People Given the Group Size They Belong ToGreedy
⚠️ ⚠️ 1347. Minimum Number of Steps to Make Two Strings Anagram- 🍀 1422. Maximum Score After Splitting a String
⚠️ ⚠️ 1647. Minimum Deletions to Make Character Frequencies UniquePriority Queue
⚠️ ⚠️ 1657. Determine if Two Strings Are CloseSorting
⚠️ ⚠️ 1814. Count Nice Pairs in an ArrayMath
⚠️ ⚠️ 2364. Count Number of Bad PairsMath
⚠️ ⚠️ 2391. Minimum Amount of Time to Collect GarbagePrefix Sum
⚠️ ⚠️ 2610. Convert an Array Into a 2D Array With Conditions⚠️ ⚠️ 2870. Minimum Number of Operations to Make Array Empty- 🍀 3005. Count Elements With Maximum Frequency
Array & String
Hash Map
⚠️ ⚠️ 128. Longest Consecutive Sequence- 🍀 202. Happy Number
- 🍀 349. Intersection of Two Arrays
Binary Search
Two Pointers
- 🍀 645. Set Mismatch
Array & String
Hash Map
Bitwise Manipulation
Sorting
- 🍀 1119. Remove Vowels from a String
Array & String
Hash Set
- 🍀 1496. Path Crossing
Hash Map
- 🍀 2215. Find the Difference of Two Arrays
Array & String
⚠️ ⚠️ 215. Kth Largest Element in an ArrayQuickselect
Counting Sort
- ⛔⛔⛔ 358. Rearrange String k Distance Apart
Greedy
⚠️ ⚠️ 373. Find K Pairs with Smallest Sums- ⛔⛔⛔ 502. IPO
Sorting
Dynamic Programming
⚠️ ⚠️ 621. Task SchedulerGreedy
Hash Map
Math
Heap
⚠️ ⚠️ 767. Reorganize StringCounter
- 🍀 1046. Last Stone Weight
- 🍀 1086. High Five
Sorted List
Sorting
⚠️ ⚠️ 1167. Minimum Cost to Connect Sticks- 🍀 1337. The K Weakest Rows in a Matrix
Binary Search
Array & String
Linear Search
Sorting
Vertical Iteration
⚠️ ⚠️ 1481. Least Number of Unique Integers after K RemovalsHash Map
Counting Sort
Sorting
⚠️ ⚠️ 1642. Furthest Building You Can ReachPriority Queue
Binary Search
⚠️ ⚠️ 1921. Eliminate Maximum Number of MonstersArray & String
⚠️ ⚠️ 2462. Total Cost to Hire K Workers⚠️ ⚠️ 2542. Maximum Subsequence ScoreSorting
⚠️ ⚠️ 2. Add Two Numbers⚠️ ⚠️ 19. Remove Nth Node From End of ListTwo Pointers
- 🍀 21. Merge Two Sorted Lists
Recursion
- ⛔⛔⛔ 23. Merge k Sorted Lists
Stack
Priority Queue
Divide & Conquer
⚠️ ⚠️ 24. Swap Nodes in PairsRecursion
⚠️ ⚠️ 61. Rotate ListTwo Pointers
⚠️ ⚠️ 86. Partition ListTwo Pointers
⚠️ ⚠️ 92. Reverse Linked List II⚠️ ⚠️ 138. Copy List with Random Pointer- 🍀 141. Linked List Cycle
⚠️ ⚠️ 142. Linked List Cycle IIHash Map
Floyd's Tortoise and Hare
- 🍀 206. Reverse Linked List
Recursion
⚠️ ⚠️ 382. Linked List Random NodeDesign
Algorithm R
⚠️ ⚠️ 445. Add Two Numbers IIStack
Two Pointers
Math
⚠️ ⚠️ 725. Split Linked List in Parts- 🍀 876. Middle of the Linked List
Two Pointers
Floyd's Tortoise and Hare
⚠️ ⚠️ 1721. Swapping Nodes in a Linked ListTwo Pointers
⚠️ ⚠️ 1836. Remove Duplicates From an Unsorted Linked ListStack
Hash Map
Two Pointers
⚠️ ⚠️ 2095. Delete the Middle Node of a Linked ListTwo Pointers
Floyd's Tortoise and Hare
⚠️ ⚠️ 2130. Maximum Twin Sum of a Linked ListStack
Two Pointers
- 🍀 3062. Winner of the Linked List Game
Two Pointers
⚠️ ⚠️ 576. Out of Boundary PathsDynamic Programming
- ⛔⛔⛔ 1569. Number of Ways to Reorder Array to Get Same BST
⚠️ ⚠️ 1980. Find Unique Binary String
⚠️ ⚠️ 17. Letter Combinations of a Phone NumberSorted List
- ⛔⛔⛔ [37. Sudoku Solver]
⚠️ ⚠️ 39. Combination Sum⚠️ ⚠️ 40. Combination Sum II⚠️ ⚠️ 216. Combination Sum III⚠️ ⚠️ 46. PermutationsDepth-First Search
Breadth-First Search
- [47. Permutations II]
⚠️ ⚠️ 77. Combinations- [78. Subsets]
- [90. Subsets II]
- [93. Restore IP addresses]
- [131. Palindrome Partitioning]
- ⛔⛔⛔ 465. Optimal Account Balancing
Dynamic Programming
Bitmasking
⚠️ ⚠️ 784. Lettercase PermutationDynamic Programming
Bitmasking
- [1079 Letter Tile Possibilities]
- [1087. Brace Expansion]
- ⛔⛔⛔ 1601. Maximum Number of Achievable Transfer Requests
Dynamic Programming
Bitmasking
⚠️ ⚠️ 2305. Fair Distribution of Cookies
- Walls and Gates
- As Far from Land as Possible
- Map of Highest Peak
- ⛔⛔⛔ 296. Best Meeting Point
Sort
Math
⚠️ ⚠️ 505. The Maze IIDepth-First Search
Dijkstra's Algorithm
Priority Queue
A* Search Algorithm
⚠️ ⚠️ 542. 01 MatrixDynamic Programming
- 🍀 661. Image Smoother
⚠️ ⚠️ 934. Shortest BridgeDepth-First Search
Manhattan Distance
⚠️ ⚠️ 994. Rotting Oranges⚠️ ⚠️ 1091. Shortest Path in Binary Matrix⚠️ ⚠️ 1197. Minimum Knight MovesDepth-First Search
Dijkstra's Algorithm
⚠️ ⚠️ 1424. Diagonal Traverse IIHash Map
- 🍀 1572. Matrix Diagonal Sum
Depth-First Search
Matrix
⚠️ ⚠️ 1660. Correct a Binary TreeBinary Search
⚠️ ⚠️ 417. Pacific Atlantic Water Flow⚠️ ⚠️ 490. The MazeBreadth-First Search
⚠️ ⚠️ 695. Max Area of IslandBreadth-First Search
⚠️ ⚠️ 1020. Number of EnclavesBreadth-First Search
⚠️ ⚠️ 2101. Detonate the Maximum BombsBreadth-First Search
Graph
⚠️ ⚠️ 54. Spiral MatrixBreadth-First Search
Matrix
⚠️ ⚠️ 59. Spiral Matrix IIBreadth-First Search
Matrix
- ⛔⛔⛔ 239. Sliding Window Maximum
Sliding Window
- ⛔⛔⛔ 1425. Constrained Subsequence Sum
Priority Queue
Kadane's Algorithm
- 🍀 20. Valid Parentheses
Hash Map
⚠️ ⚠️ 71. Simplify PathRegular Expression
⚠️ ⚠️ 150. Evaluate Reverse Polish Notation⚠️ ⚠️ 394. Decode StringRegular Expression
Recursion
⚠️ ⚠️ 735. Asteroid Collision⚠️ ⚠️ 880. Decoded String at IndexMath
⚠️ ⚠️ 2390. Removing Stars From a String
⚠️ ⚠️ 316. Remove Duplicate LettersGreedy
⚠️ ⚠️ 456. 132 PatternBinary Search
- 🍀 496. Next Greater Element I
Queue
Hash Map
⚠️ ⚠️ 739. Daily Temperatures- ⛔⛔⛔ 1063. Number of Valid Subarrays
⚠️ ⚠️ 1376. Time Needed to Inform All EmployeesDepth-First Search
Breadth-First Search
Path Compression
- 🍀 100. Same Tree
Breadth-First Search
Depth-First Search
- 🍀 101. Symmetric Tree
⚠️ ⚠️ 106. Construct Binary Tree from Inorder and Postorder Traversal- 🍀 111. Minimum Depth of Binary Tree
Breadth-First Search
Depth-First Search
⚠️ ⚠️ 116. Populating Next Right Pointers in Each NodeBreadth-First Search
Linked List
⚠️ ⚠️ 129. Sum Root to Leaf NumbersBacktracking
Morris Algorithm
⚠️ ⚠️ 199. Binary Tree Right Side ViewBreadth-First Search
Depth-First Search
⚠️ ⚠️ 236. Lowest Common Ancestor of a Binary TreeBacktracking
Recursion
Depth-First Search
⚠️ ⚠️ 250. Count Univalue SubtreesDepth-First Search
⚠️ ⚠️ 513. Find Bottom Left Tree ValueBreadth-First Search
Depth-First Search
⚠️ ⚠️ 515. Find Largest Value in Each Tree RowBreadth-First Search
Depth-First Search
- 🍀 543. Diameter of Binary Tree
Depth-First Search
- 🍀 606. Construct String from Binary Tree
Depth-First Search
Recursion
- 🍀 617. Merge Two Binary Trees
Recursion
⚠️ ⚠️ 662. Maximum Width of Binary TreeBreadth-First Search
Depth-First Search
⚠️ ⚠️ 863. All Nodes Distance K in Binary TreeBreadth-First Search
Depth-First Search
- 🍀 872. Leaf-Similar Trees
Breadth-First Search
Depth-First Search
⚠️ ⚠️ 894. All Possible Full Binary TreesDynamic Programming
⚠️ ⚠️ 958. Check Completeness of a Binary TreeBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1026. Maximum Difference Between Node and AncestorDepth-First Search
Recursion
⚠️ ⚠️ 1161. Maximum Level Sum of a Binary TreeBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1120. Maximum Average SubtreeDepth-First Search
Recursion
⚠️ ⚠️ 1372. Longest ZigZag Path in a Binary TreeBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1448. Count Good Nodes in Binary TreeBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1457. Pseudo-Palindromic Paths in a Binary TreeBacktracking
Recursion
Depth-First Search
Bitmasking
⚠️ ⚠️ 1485. Clone Binary Tree With Random PointerBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1609. Even Odd TreeBreadth-First Search
Depth-First Search
⚠️ ⚠️ 1644. Lowest Common Ancestor of a Binary Tree IIBacktracking
Recursion
Depth-First Search
⚠️ ⚠️ 1973. Count Nodes Equal to Sum of DescendantsDepth-First Search
⚠️ ⚠️ 2265. Count Nodes Equal to Average of SubtreeDepth-First Search
⚠️ ⚠️ 2385. Amount of Time for Binary Tree to Be InfectedGraph
Breadth-First Search
Depth-First Search
- 🍀 112. Path Sum
- ⛔⛔⛔ 124. Binary Tree Maximum Path Sum
⚠️ ⚠️ 437. Path Sum IIIPrefix Sum
⚠️ ⚠️ 543. Diameter of Binary Tree
- 🍀 108. Convert Sorted Array to Binary Search Tree
⚠️ ⚠️ 109. Convert Sorted List to Binary Search TreeLinked List
⚠️ ⚠️ 173. Binary Search Tree IteratorDesign
⚠️ ⚠️ 230. Kth Smallest Element in a BST- 🍀 270. Closest Binary Search Tree Value
⚠️ ⚠️ 450. Delete Node in a BST- 🍀 501. Find Mode in Binary Search Tree
Depth-First Search
Breadth-First Search
Hash Map
Morris Traversal
- 🍀 530. Minimum Absolute Difference in BST
Depth-First Search
- 🍀 700. Search in a Binary Search Tree
- 🍀 938. Range Sum of BST
Depth-First Search
⚠️ ⚠️ 1214. Two Sum BSTsHash Map
Hash Set
Depth-First Search
Two Pointers
Morris Traversal
⚠️ ⚠️ 79. Word SearchBacktracking
⚠️ ⚠️ 208. Implement Trie (Prefix Tree)Design
⚠️ ⚠️ 692. Top K Frequent WordsHash Map
Sorting
Priority Queue
⚠️ ⚠️ 1268. Search Suggestions SystemSorting
Binary Search
Two Pointers
⚠️ ⚠️ 1804. Implement Trie II (Prefix Tree)Design
⚠️ ⚠️ 2352. Equal Row and Column PairsHash Map
⚠️ ⚠️ 2707. Extra Characters in a StringDynamic Programming