update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1 @@
-1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array python hard
+1183-maximum-number-of-ones python hard

1152-maximum-number-of-ones/1152-maximum-number-of-ones.py

@@ -1,3 +1,5 @@
+# time complexity: O(n^2)
+# space complexity: O(n)
 class Solution:
     def maximumNumberOfOnes(self, width: int, height: int, sideLength: int, maxOnes: int) -> int:
         count = []
@@ -10,4 +12,13 @@ def maximumNumberOfOnes(self, width: int, height: int, sideLength: int, maxOnes:
         return sum(count[:maxOnes])
 
 
-print(Solution().maximumNumberOfOnes(3, 3, 2, 1))
+width = 3
+height = 3
+sideLength = 2
+maxOnes = 1
+print(Solution().maximumNumberOfOnes(width, height, sideLength, maxOnes))
+width = 3
+height = 3
+sideLength = 2
+maxOnes = 2
+print(Solution().maximumNumberOfOnes(width, height, sideLength, maxOnes))

1152-maximum-number-of-ones/README.md

@@ -115,42 +115,3 @@ It helps others discover the repo and keeps the project growing.
 ---
 
 Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)  
-
-<!---LeetCode Topics Start-->
-# LeetCode Topics
-## Backtracking
-|  |
-| ------- |
-| [0077-combinations](https://github.com/hogan-tech/leetcode-solution/tree/master/0077-combinations) |
-## Array
-|  |
-| ------- |
-| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/hogan-tech/leetcode-solution/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
-| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/hogan-tech/leetcode-solution/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
-## Hash Table
-|  |
-| ------- |
-| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/hogan-tech/leetcode-solution/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
-| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/hogan-tech/leetcode-solution/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
-## Math
-|  |
-| ------- |
-| [1152-maximum-number-of-ones](https://github.com/hogan-tech/leetcode-solution/tree/master/1152-maximum-number-of-ones) |
-| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/hogan-tech/leetcode-solution/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
-## Linked List
-|  |
-| ------- |
-| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/hogan-tech/leetcode-solution/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
-## Greedy
-|  |
-| ------- |
-| [1152-maximum-number-of-ones](https://github.com/hogan-tech/leetcode-solution/tree/master/1152-maximum-number-of-ones) |
-## Sorting
-|  |
-| ------- |
-| [1152-maximum-number-of-ones](https://github.com/hogan-tech/leetcode-solution/tree/master/1152-maximum-number-of-ones) |
-## Heap (Priority Queue)
-|  |
-| ------- |
-| [1152-maximum-number-of-ones](https://github.com/hogan-tech/leetcode-solution/tree/master/1152-maximum-number-of-ones) |
-<!---LeetCode Topics End-->

3501-delete-nodes-from-linked-list-present-in-array/3501-delete-nodes-from-linked-list-present-in-array.py

@@ -1,11 +1,12 @@
-<h2><a href="https://leetcode.com/problems/maximum-number-of-ones/">1183. Maximum Number of Ones</a></h2><h3>Hard</h3><hr><div><p>Consider a matrix <code>M</code> with dimensions <code>width * height</code>, such that every cell has value <code>0</code>&nbsp;or <code>1</code>, and any <strong>square</strong>&nbsp;sub-matrix of <code>M</code> of size <code>sideLength * sideLength</code>&nbsp;has at most <code>maxOnes</code>&nbsp;ones.</p>
+<h2><a href="https://leetcode.com/problems/maximum-number-of-ones">1152. Maximum Number of Ones</a></h2><h3>Hard</h3><hr><p>Consider a matrix <code>M</code> with dimensions <code>width * height</code>, such that every cell has value <code>0</code>&nbsp;or <code>1</code>, and any <strong>square</strong>&nbsp;sub-matrix of <code>M</code> of size <code>sideLength * sideLength</code>&nbsp;has at most <code>maxOnes</code>&nbsp;ones.</p>
 
 <p>Return the maximum possible number of ones that the matrix <code>M</code> can have.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre><strong>Input:</strong> width = 3, height = 3, sideLength = 2, maxOnes = 1
+<pre>
+<strong>Input:</strong> width = 3, height = 3, sideLength = 2, maxOnes = 1
 <strong>Output:</strong> 4
 <strong>Explanation:</strong>
 In a 3*3 matrix, no 2*2 sub-matrix can have more than 1 one.
@@ -17,7 +18,8 @@ The best solution that has 4 ones is:
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre><strong>Input:</strong> width = 3, height = 3, sideLength = 2, maxOnes = 2
+<pre>
+<strong>Input:</strong> width = 3, height = 3, sideLength = 2, maxOnes = 2
 <strong>Output:</strong> 6
 <strong>Explanation:</strong>
 [1,0,1]
@@ -33,4 +35,3 @@ The best solution that has 4 ones is:
 	<li><code>1 &lt;= sideLength &lt;= width, height</code></li>
 	<li><code>0 &lt;= maxOnes &lt;= sideLength * sideLength</code></li>
 </ul>
-</div>