MediumNo. 2579
Count Total Number of Colored Cells — LeetCode 2579 Python Solution
- Pattern
- Math and Number Theory
- Topics
- Math
- Reading time
- 2 min
- Source
- leetcode.com
The problem
There exists an infinitely large two-dimensional grid of uncolored unit cells. You are given a positive integer n, indicating that you must do the following routine for n minutes: At the first minute, color any arbitrary unit cell blue.
Example
- Input
- n = 1
- Output
- 1
- Explanation
- After 1 minute, there is only 1 blue cell, so we return 1.
Python solution
class Solution:
def coloredCells(self, n: int) -> int:
return 2 * n * (n - 1) + 1Complexity
- Time
- O(1)
- Space · auxiliary
- O(1)
Pattern: Math and Number Theory
Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 2579. Count Total Number of Colored Cells is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.
The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 2582 | Pass the Pillow | Easy |
| 2575 | Find the Divisibility Array of a String | Medium |
| 0002 | Add Two Numbers | Medium |
| 0007 | Reverse Integer | Medium |
| 0009 | Palindrome Number | Easy |
| 0043 | Multiply Strings | Medium |
Frequently asked questions
- How hard is LeetCode 2579. Count Total Number of Colored Cells?
LeetCode 2579. Count Total Number of Colored Cells is rated Medium on LeetCode.
- What is the time complexity of LeetCode 2579. Count Total Number of Colored Cells?
The Python solution on this page runs in O(1).
- What is the space complexity of LeetCode 2579. Count Total Number of Colored Cells?
The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 2579. Count Total Number of Colored Cells cover?
LeetCode 2579. Count Total Number of Colored Cells is tagged Math on LeetCode.