Count Primes, is a LeetCode problem from math subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Count Primes at LeetCode

Solution

filter numbers are times of previous number starting from its square

Time Complexity: O(n), Space Complexity: O(n)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu