Solutions organized by the approach used to solve each problem.
| Backtracking |
|---|
| 40. Combination Sum II |
| 51. N Queens |
| 78. Subsets |
| 90. Subsets II |
| 2044. Count Number of Maximum Bitwise OR Subsets |
| Bit Manipulation |
|---|
| 190. Reverse Bits |
| Block Iteration |
|---|
| 3499. Maximize Active Section with Trade I |
| Boolean Array Marking Presence |
|---|
| 3718. Smallest Missing Multiple of K |
| Counting Frequency And Constructing Palindrome |
|---|
| 3517. Smallest Palindromic Rearrangement I |
| Counting Sort |
|---|
| 75. Sort Colors |
| Counting Total Equal Adjacent Pairs With A Heuristic Formula |
|---|
| 4043. Count Rotations With Exactly K Equal Adjacent Pairs |
| Direct Calculation |
|---|
| 3986. Number of Elapsed Seconds Between Two Times |
| Direct Formula Computation With Euclidean GCD |
|---|
| 3658. GCD of Odd and Even Sums |
| Divide and Conquer |
|---|
| 263. Ugly Number |
| 761. Special Binary String |
| Factorial Number System With List Removal (direct Construction) |
|---|
| 60. Permutation Sequence |
| Hash Counting |
|---|
| 3731. Find Missing Elements |
| Hash Map |
|---|
| 347. Top K Frequent Elements |
| 594. Longest Harmonious Subsequence |
| 1207. Unique Number of Occurrences |
| 1394. Find Lucky Integer in an Array |
| 2352. Equal Row and Column Pairs |
| Hash Set |
|---|
| 1. Two Sum |
| Hash Set Solution |
|---|
| 2357. Make Array Zero by Subtracting Equal Amounts |
| HashSet To Track Unique Characters |
|---|
| 3760. Maximum Substrings With Distinct Start |
| Incremental Array Update |
|---|
| 66. Plus One |
| Insertion Sort |
|---|
| 147. Insertion Sort List |
| Iterate Over Digits To Compute Sum And Product |
|---|
| 3622. Check Divisibility by Digit Sum and Product |
| Iterate Through Digits To Find The Two Largest Values |
|---|
| 3536. Maximum Product of Two Digits |
| Iterative Linked List Reversal |
|---|
| 206. Reverse Linked List |
| Iterative Prefix Validation |
|---|
| 4006. Count Valid Prefixes |
| Linear Scan To Locate Min And Max Indices And Compute Minimal Deletions |
|---|
| 2091. Removing Minimum and Maximum From Array |
| Linear Scan With Conditional Checks |
|---|
| 8. String to Integer atoi |
| Linear Scan With Early Return |
|---|
| 3978. Unique Middle Element |
| Linear Scan With Two Dynamic Lists |
|---|
| 3069. Distribute Elements Into Two Arrays I |
| Modified Prefix Product Calculation |
|---|
| 2906. Construct Product Matrix |
| Prefix And Suffix Product Arrays |
|---|
| 238. Product of Array Except Self |
| Prefix Max & Suffix Min Precomputation |
|---|
| 3904. Smallest Stable Index II |
| Recursive BST Delete Using Inorder Successor/predecessor |
|---|
| 450. Delete Node in a BST |
| Sequential Digit Generation |
|---|
| 1291. Sequential Digits |
| Simple Grid Construction With Obstacles |
|---|
| 3963. Create Grid With Exactly One Path |
| Single Pass Scan For Minimum Odd And Even Values |
|---|
| 3876. Construct Uniform Parity Array II |
| Single Pass To Find Top 3 Maximums And 2 Minimums |
|---|
| 628. Maximum Product of Three Numbers |
| Sorting |
|---|
| 451. Sort Characters By Frequency |
| 2500. Delete Greatest Value in Each Row |
| Stack |
|---|
| 84. Largest Rectangle in Histogram |
| String |
|---|
| 151. Reverse Words in a String |
| 1071. Greatest Common Divisor of Strings |
| 1668. Maximum Repeating Substring |
| 3612. Process String with Special Operations I |
Generated by LeetLens — You're halfway done. Believe in Yourself ~K. 💖