solves count primes in python

Author: anishLearnsToCode

README.md

@@ -58,7 +58,7 @@
 | 198 | [House Robber](https://leetcode.com/problems/house-robber) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/HouseRobber.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/house_robber.py) |
 | 202 | [Happy Number](https://leetcode.com/problems/happy-number) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/HappyNumber.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/happy_number.py) | 
 | 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/RemoveLinkedListElements.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/remove_linked_list_elements.py) |
-| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/CountPrimes.java) |
+| 204 | [Count Primes](https://leetcode.com/problems/count-primes) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/CountPrimes.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/count_primes.py) |
 | 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/IsomorphicStrings.java) |
 | 206 | [Reverse Linked Lists](https://leetcode.com/problems/reverse-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ReverseLinkedList.java) |
 | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ContainsDuplicate.java) |

python/count_primes.py

@@ -0,0 +1,15 @@
+from typing import List
+
+
+class Solution:
+    def _get_prime_sieve(self, size: int) -> List[int]:
+        sieve = [1] * (max(size, 2))
+        sieve[0], sieve[1] = 0, 0
+        for number in range(2, len(sieve)):
+            if sieve[number]:
+                for dividend in range(number ** 2, len(sieve), number):
+                    sieve[dividend] = 0
+        return sieve
+
+    def countPrimes(self, n: int) -> int:
+        return sum(self._get_prime_sieve(n))