Keep finding: 68 more pages from the low-score audit — Remove Element, 4Sum, 3Sum Closest, Sign Of Product, Longest Mountain, Sorted&Rotated, Degree, Difference, Good Pairs, Unique Occ, Equal Pairs, Max Distance, K Items, Move Balls, Max Pop Year, Stone Game, Min Path Sum, Continuous Subarray, Zero-Filled, Product<K, String Chain, Partition Minimize, Balanced Tree, Count Avg, Apples, GST, Path Sum, Water Distribution, Cracking Safe, All Buildings, Obstacles Elim, Path Quality, Max Prob, Increasing Path, Simplify Path, Remove Stars, Subarray Mins/Ranges, Ocean View, Convert Zero, Happy Number, Multiply Strings, Add Binary, Palindrome Num, GCD Strings, Valid Number, Word Abbrev, Shortest Way, Reverse Vowels, Excel Column, Max Value Insert, Nested Weighted, Equal Digit Freq, First Letter Twice, Number Container, File System, Max Swap, Balanced Swaps, Rope Colorful, Deletions, Replacement Sort, Catch Bus, Closest Subseq, Concatenated String, Window Subseq, Nice Subarray, Vacation Days

Author: arpanpathak

CodingInterviewFightClub/src/SUMMARY.md

@@ -35,7 +35,6 @@
   - [1.19 Single Element In A Sorted Array](ch01-binary-search/single-element-in-a-sorted-array.md)
   - [1.20 Valley Element](ch01-binary-search/valley-element.md)
   - [1.21 Apartment Hunting](ch01-binary-search/apartment-hunting.md)
-  - [1.22 Closest Subsequence Sum](ch01-binary-search/closest-subsequence-sum.md)
 
 - [2. Dynamic Programming](ch02-dynamic-programming/index.md)
   - [2.0 Pattern Primer: Organized Recursion](ch02-dynamic-programming/pattern-primer.md)
@@ -73,6 +72,13 @@
   - [2.33 Palindrome Partitioning II](ch02-dynamic-programming/palindrome-partitioning-ii.md)
   - [2.34 Valid Palindrome III](ch02-dynamic-programming/valid-palindrome-iii.md)
   - [2.35 Longest Palindromic Subsequence](ch02-dynamic-programming/longest-palindromic-subsequence.md)
+  - [2.36 Stone Game](ch02-dynamic-programming/stone-game.md)
+  - [2.37 Minimum Path Sum](ch02-dynamic-programming/minimum-path-sum.md)
+  - [2.38 Continuous Subarray Sum](ch02-dynamic-programming/continuous-subarray-sum.md)
+  - [2.39 Number Of Zero-Filled Subarrays](ch02-dynamic-programming/number-of-zero-filled-subarrays.md)
+  - [2.40 Subarray Product Less Than K](ch02-dynamic-programming/subarray-product-less-than-k.md)
+  - [2.41 String Chain](ch02-dynamic-programming/string-chain.md)
+  - [2.42 Partition Array Into Two Arrays](ch02-dynamic-programming/partition-array-into-two-arrays.md)
 
 - [3. Arrays, Two Pointers & Matrices](ch03-arrays/index.md)
   - [3.0 Pattern Primer: Two Pointers & The Sorted-Array Dance](ch03-arrays/pattern-primer.md)
@@ -111,7 +117,21 @@
   - [3.33 Rectangle Area II](ch03-arrays/rectangle-area-ii.md)
   - [3.34 Spiral Matrix II](ch03-arrays/spiral-matrix-ii.md)
   - [3.35 Remove Duplicates II](ch03-arrays/remove-duplicates-from-sorted-array-ii.md)
-  - [2.12 Closest Subsequence Sum](ch02-dynamic-programming/closest-subsequence-sum.md)
+  - [3.36 Remove Element](ch03-arrays/remove-element.md)
+  - [3.37 4Sum](ch03-arrays/4-sum.md)
+  - [3.38 Three Sum Closest](ch03-arrays/three-sum-closest.md)
+  - [3.39 Sign Of The Product Of An Array](ch03-arrays/sign-of-the-product-of-an-array.md)
+  - [3.41 Longest Mountain In Array](ch03-arrays/longest-mountain-in-array.md)
+  - [3.42 Check If Array Is Sorted And Rotated](ch03-arrays/check-if-array-is-sorted-and-rotated.md)
+  - [3.43 Degree Of An Array](ch03-arrays/degree-of-an-array.md)
+  - [3.44 Find Difference Of Two Arrays](ch03-arrays/find-difference-of-two-arrays.md)
+  - [3.45 Number Of Good Pairs](ch03-arrays/number-of-good-pairs.md)
+  - [3.46 Unique Number Of Occurrences](ch03-arrays/unique-number-of-occurrences.md)
+  - [3.47 Divide Array Into Equal Pairs](ch03-arrays/divide-array-into-equal-pairs.md)
+  - [3.48 Maximum Distance In Arrays](ch03-arrays/maximum-distance-in-arrays.md)
+  - [3.49 K Items With Maximum Sum](ch03-arrays/k-items-with-maximum-sum.md)
+  - [3.50 Minimum Operations To Move All Balls](ch03-arrays/minimum-operations-to-move-all-balls.md)
+  - [3.51 Maximum Population Year](ch03-arrays/maximum-population-year.md)
 
 - [4. Linked Lists](ch04-linked-lists/index.md)
   - [4.0 Pattern Primer: Pointer Choreography](ch04-linked-lists/pattern-primer.md)
@@ -166,6 +186,11 @@
   - [5.28 Unique Binary Search Trees II](ch05-trees/unique-binary-search-trees-ii.md)
   - [5.29 Lowest Common Ancestor III](ch05-trees/lowest-common-ancestor-iii.md)
   - [5.30 Step-By-Step Directions](ch05-trees/step-by-step-directions.md)
+  - [5.31 Balanced Binary Tree](ch05-trees/balanced-binary-tree.md)
+  - [5.32 Count Nodes Equal To Average](ch05-trees/count-nodes-equal-to-average.md)
+  - [5.33 Minimum Time To Collect All Apples](ch05-trees/minimum-time-to-collect-all-apples.md)
+  - [5.34 Binary Search Tree To Greater Sum Tree](ch05-trees/binary-search-tree-to-greater-sum-tree.md)
+  - [5.35 Path Sum](ch05-trees/path-sum.md)
 
 - [6. Graphs](ch06-graphs/index.md)
   - [6.0 Pattern Primer: The Seven Engines](ch06-graphs/pattern-primer.md)
@@ -196,6 +221,13 @@
   - [6.25 Sliding Puzzle](ch06-graphs/sliding-puzzle.md)
   - [6.26 Shortest Bridge](ch06-graphs/shortest-bridge.md)
   - [6.27 The Maze III](ch06-graphs/the-maze-iii.md)
+  - [6.28 Optimize Water Distribution](ch06-graphs/optimize-water-distribution.md)
+  - [6.29 Cracking The Safe](ch06-graphs/cracking-the-safe.md)
+  - [6.30 Shortest Distance From All Buildings](ch06-graphs/shortest-distance-from-all-buildings.md)
+  - [6.31 Shortest Path With Obstacles Elimination](ch06-graphs/shortest-path-in-grid-with-obstacles-elimination.md)
+  - [6.32 Maximum Path Quality Of A Graph](ch06-graphs/maximum-path-quality-of-a-graph.md)
+  - [6.33 Path With Maximum Probability](ch06-graphs/path-with-maximum-probability.md)
+  - [6.34 Longest Increasing Path In A Matrix](ch06-graphs/longest-increasing-path-in-a-matrix.md)
 
 - [7. Heaps & Priority Queues](ch07-heaps/index.md)
   - [7.0 Pattern Primer: The Lazy Sorted Structure](ch07-heaps/pattern-primer.md)
@@ -237,6 +269,12 @@
   - [8.20 One Three Two Pattern](ch08-stacks/one-three-two-pattern.md)
   - [8.21 Maximal Rectangle](ch08-stacks/maximal-rectangle.md)
   - [8.22 Check If A Parentheses String Can Be Valid](ch08-stacks/check-if-a-parentheses-string-can-be-valid.md)
+  - [8.23 Simplify Path](ch08-stacks/simplify-path.md)
+  - [8.24 Remove Stars From String](ch08-stacks/remove-stars-from-string.md)
+  - [8.25 Sum Of Subarray Minimums](ch08-stacks/sum-of-subarray-minimums.md)
+  - [8.26 Sum Of Subarray Ranges](ch08-stacks/sum-of-subarray-ranges.md)
+  - [8.27 Buildings With An Ocean View](ch08-stacks/buildings-with-an-ocean-view.md)
+  - [8.28 Minimum Operations To Convert All Elements To Zero](ch08-stacks/minimum-operations-to-convert-all-elements-to-zero.md)
 
 - [9. Strings](ch09-strings/index.md)
   - [9.0 Pattern Primer: The Three Lenses](ch09-strings/pattern-primer.md)
@@ -265,6 +303,19 @@
   - [9.23 Rank Teams By Votes](ch09-strings/rank-teams-by-votes.md)
   - [9.24 Valid Palindrome II](ch09-strings/valid-palindrome-ii.md)
   - [9.25 String Compression III](ch09-strings/string-compression-iii.md)
+  - [9.26 Happy Number](ch09-strings/happy-number.md)
+  - [9.27 Multiply Strings](ch09-strings/multiply-strings.md)
+  - [9.28 Add Binary](ch09-strings/add-binary.md)
+  - [9.29 Palindrome Number](ch09-strings/palindrome-number.md)
+  - [9.30 Greatest Common Divisor Of Strings](ch09-strings/greatest-common-divisor-of-strings.md)
+  - [9.31 Valid Number](ch09-strings/valid-number.md)
+  - [9.32 Valid Word Abbreviation](ch09-strings/valid-word-abbreviation.md)
+  - [9.33 Shortest Way To Form String](ch09-strings/shortest-way-to-form-string.md)
+  - [9.34 Reverse Vowels Of A String](ch09-strings/reverse-vowels-of-a-string.md)
+  - [9.35 Excel Sheet Column Number](ch09-strings/excel-sheet-column-number.md)
+  - [9.36 Maximum Value After Insertion](ch09-strings/maximum-value-after-insertion.md)
+  - [9.37 Nested List Weighted Sum](ch09-strings/nested-list-weighted-sum.md)
+  - [9.38 Unique Substring With Equal Digit Frequency](ch09-strings/unique-substring-with-equal-digit-frequency.md)
 
 - [10. Hash Tables & Sets](ch10-hash-tables/index.md)
   - [10.0 Pattern Primer: O(1) Lookup, Three Moves](ch10-hash-tables/pattern-primer.md)
@@ -297,6 +348,9 @@
   - [10.27 Snapshot Array](ch10-hash-tables/snapshot-array.md)
   - [10.28 Find Unique Binary String](ch10-hash-tables/find-unique-binary-string.md)
   - [10.29 Intersection Of Two Arrays](ch10-hash-tables/intersection-of-two-arrays.md)
+  - [10.30 First Letter To Appear Twice](ch10-hash-tables/first-letter-to-appear-twice.md)
+  - [10.31 Design Number Container System](ch10-hash-tables/design-number-container-system.md)
+  - [10.32 Design File System](ch10-hash-tables/design-file-system.md)
 
 - [11. Greedy](ch11-greedy/index.md)
   - [11.0 Pattern Primer: The Local Choice, Defended](ch11-greedy/pattern-primer.md)
@@ -328,6 +382,12 @@
   - [11.26 Max Chunks To Make Sorted II](ch11-greedy/max-chunks-to-make-sorted-ii.md)
   - [11.27 Maximum Value Of An Ordered Triplet II](ch11-greedy/maximum-value-of-an-ordered-triplet-ii.md)
   - [11.28 Reschedule Meetings For Maximum Free Time](ch11-greedy/reschedule-meetings-for-maximum-free-time.md)
+  - [11.29 Maximum Swap](ch11-greedy/maximum-swap.md)
+  - [11.30 Minimum Number Of Swaps To Make The String Balanced](ch11-greedy/minimum-number-of-swaps-to-make-the-string-balanced.md)
+  - [11.31 Minimum Time To Make Rope Colorful](ch11-greedy/minimum-time-to-make-rope-colorful.md)
+  - [11.32 Minimum Deletions To Make String Balanced](ch11-greedy/minimum-deletions-to-make-string-balanced.md)
+  - [11.33 Minimum Replacement To Sort The Array](ch11-greedy/minimum-replacement-to-sort-the-array.md)
+  - [11.34 Latest Time To Catch A Bus](ch11-greedy/latest-time-to-catch-a-bus.md)
 
 - [12. Backtracking](ch12-backtracking/index.md)
   - [12.0 Pattern Primer: DFS With an Undo Button](ch12-backtracking/pattern-primer.md)
@@ -348,6 +408,8 @@
   - [12.15 Word Break II](ch12-backtracking/word-break-ii.md)
   - [12.16 Next Greater Element III](ch12-backtracking/next-greater-element-iii.md)
   - [12.17 Strobogrammatic Number II](ch12-backtracking/strobogrammatic-number-ii.md)
+  - [12.19 Closest Subsequence Sum](ch12-backtracking/closest-subsequence-sum.md)
+  - [12.20 Maximum Length Of Concatenated String](ch12-backtracking/maximum-length-of-concatenated-string.md)
   - [12.12 Combinations](ch12-backtracking/combinations.md)
   - [12.13 Combination Sum III](ch12-backtracking/combination-sum-iii.md)
 
@@ -388,6 +450,7 @@
   - [15.10 Longest Subarray Of 1s After Deleting One](ch15-sliding-window/longest-subarray-of-ones-after-deleting-one.md)
   - [15.11 Find All Anagrams In A String](ch15-sliding-window/find-all-anagrams.md)
   - [15.12 Maximum Number Of Vowels In A Substring](ch15-sliding-window/maximum-number-of-vowels-in-a-substring.md)
+  - [15.13 Minimum Window Subsequence](ch15-sliding-window/minimum-window-subsequence.md)
 
 - [16. Bit Manipulation](ch16-bit-manipulation/index.md)
   - [16.0 Pattern Primer: The Bit Identities](ch16-bit-manipulation/pattern-primer.md)
@@ -402,6 +465,7 @@
   - [16.9 Divide Two Integers](ch16-bit-manipulation/divide-two-integers.md)
   - [16.10 Number Of Steps To Reduce A Number In Binary](ch16-bit-manipulation/number-of-steps-to-reduce-a-number-in-binary.md)
   - [16.13 Power Of Two](ch16-bit-manipulation/power-of-two.md)
+  - [16.14 Longest Nice Subarray](ch16-bit-manipulation/longest-nice-subarray.md)
 
 - [17. Advanced Graphs](ch17-advanced-graphs/index.md)
   - [17.0 Pattern Primer: Flow, Matching, MST, and State-Space BFS](ch17-advanced-graphs/pattern-primer.md)
@@ -422,6 +486,7 @@
   - [17.15 Longest Path With Different Adjacent Characters](ch17-advanced-graphs/longest-path-with-different-adjacent-characters.md)
   - [17.16 The Great Town Split](ch17-advanced-graphs/the-great-town-split.md)
   - [17.17 Floyd-Warshall](ch17-advanced-graphs/floyd-warshall.md)
+  - [17.18 Maximum Vacation Days](ch17-advanced-graphs/maximum-vacation-days.md)
 
 - [18. Design & Caches](ch18-design-caches/index.md)
   - [18.0 Pattern Primer: Composing Structures](ch18-design-caches/pattern-primer.md)