This site uses different types of cookies, including analytics and functional cookies (its own and from other sites). To change your cookie settings or find out more, click here. If you continue browsing our website, you accept these cookies.
We've recently made an accessibility improvement to the community and therefore posts without any content are no longer allowed. Please use the spoiler feature or add a short message in the message body in order to submit your weekly challenge.
Hi, Here's my solution, which is i think more efficient in terms of space and time complexity. Because it generates less rows compared to append fields or generating all the dividends. It is able to generate not only 0-50 but more than that, efficiently. It can generate prime numbers from 0-10000 by 1 second.
My solution attempts to be efficient with O(n log n). I avoided the append tool because on a bigger scale, if used, performance will be O(n^2) because it would generate n x n rows, more than is necessary to solve this.