Mar 05

Author: siddydutta

2025-03-March-LeetCoding-Challenge/Count Total Number of Colored Cells.py

@@ -0,0 +1,15 @@
+class Solution:
+    def coloredCells(self, n: int) -> int:
+        return 1 + 4 * n * (n-1) // 2
+
+
+def main():
+    n = 1
+    assert Solution().coloredCells(n) == 1
+
+    n = 2
+    assert Solution().coloredCells(n) == 5
+
+
+if __name__ == '__main__':
+    main()

2025-03-March-LeetCoding-Challenge/README.md

@@ -8,7 +8,7 @@
 | March 02 | [2570. Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/) | Easy | Solved |
 | March 03 | [2161. Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/) | Medium | Solved |
 | March 04 | [1780. Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/) | Medium | Solved |
-| March 05 | []() |  |  |
+| March 05 | [2579. Count Total Number of Colored Cells](https://leetcode.com/problems/count-total-number-of-colored-cells/) | Medium | Solved |
 | March 06 | []() |  |  |
 | March 07 | []() |  |  |
 | March 08 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 2 | 2 | 0 |
-| Medium | 2 | 1 | 1 |
+| Medium | 3 | 1 | 3 |
 | Hard   | 0 | 0 | 0 |