We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Data Structures
- Stacks
- Waiter
- Discussions
Waiter
Waiter
Sort by
recency
|
359 Discussions
|
Please Login in order to post a comment
pytohn 3
Java sol
JAVA
Python
I built the stack and defined a sieve function. This one is not as efficient as Sieve of Erasthones, but it avoids the issue where the Sieve of Erasthones gives primes up to a certain number (number known) and what the problem is asking (the N number of primes, actual number unknown)