{"request":{"endpoint":"https://exercism.org/api/v2/tracks/dart/exercises/sieve/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"3499cc92e6ea4a38b12b96954a6011e7","snippet":"class Sieve { final int limit; Sieve(this.limit); List get primes { if (limit < 2) return []; final isPrime = List.filled(limit + 1, true); isPrime[0] = false; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":10,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-28T05:59:37.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"valli-5"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/valli-5","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"865581cbe4bb4854b5807070507e3cf5","snippet":"class Sieve { final int _limit; Sieve(this._limit); List get primes { if (_limit < 2) return []; // Step 1: Create a list of booleans from 0 to _limit, initialized to true List isPrime = List.filled(_limit + 1, true); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-30T15:38:38.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Denil24"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/Denil24","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"5aa5e603bbd7482faf94ee889a35e4b5","snippet":"class Sieve { final int limit; Sieve(this.limit); List get primes { if (limit < 2) return []; List isPrime = List.filled(limit + 1, true); isPrime[0] = false; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-26T09:48:39.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Masthan23"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/Masthan23","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"163a179e7707496c8b1c808fd48b31e4","snippet":"class Sieve { List primes = []; Sieve(limit) { final composites = List.generate(limit + 1, (_) => false, growable: false); for (int i = 2; i <= limit; i++) { if (!composites[i]) { primes.add(i); for (int j = i + i; j <= limit; j += i) { composites[j] = true; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":3,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-26T14:17:21.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"menketechnologies"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/menketechnologies","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"6a71c735bddd4617ae11ce0951499c3b","snippet":"class Sieve { int _until; Sieve(int until): this._until = until; List get primes { final List sieve = [for (var i = 2; i <= _until; i++) i]; for (int i = 2; i <= _until / 2; i++) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-25T06:34:37.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"QuentinC"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/QuentinC","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"e4d5b81c59ff4950a0e216c90e88de97","snippet":"class Sieve { // Put your code here List primes = []; Sieve(final int max) { final List primes = [for (var i = 0; i <= max; i += 1) true]; for (var i = 2; i <= max; i += 1) { if (primes[i]) { final square = i * i; if (square > max) { break; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-18T13:55:29.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Some1ls"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/Some1ls","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"72acacf4fc5e44849f6faaade83ce4e3","snippet":"class Sieve { int number; List allNum = []; List primesNum = []; Sieve(this.number) { if (number >= 2) { for (int i = 2; i <= number; i++) { allNum.add(i); } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-29T09:41:40.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"phoenixlyq"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/phoenixlyq","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"bcc8ab1b013c412b9d44e3d6c8e90749","snippet":"class Sieve { int n; Sieve(int n) : this.n = n; List get primes { List listPrimes = []; Map range = {}; for (int i = 2; i < n + 1; i++) { range[i] = true; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-01-22T21:49:04.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"lawson89"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/lawson89","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"7a747f307e9a4e219e77a3aa32b43bd2","snippet":"class Sieve { int limit; Sieve(this.limit); List get primes { final numbers = List.generate(limit - 1, (index) => index + 2); final marked = {}; final primes = []; for (final numb in numbers) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-12-13T14:29:27.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"SylaneCpn"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/SylaneCpn","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"8e21bbb4fee2468fbee2f51eb4b48359","snippet":"class Sieve { // Put your code here int limit; Sieve(this.limit) { if (limit < 2) { primes = []; } else { primes = _calculatePrimes(); } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-23T15:41:59.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"lusteven901228"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/lusteven901228","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"1ede74e8e1e7418bb06004d4b5ee8fd6","snippet":"import 'package:test/test.dart'; class Sieve { final int limit; late final List _primes; Sieve(this.limit) { _primes = _findPrimes(); } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":227,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-03T04:51:44.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"KeyboarKat-1"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/KeyboarKat-1","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"464071b7cde04bb7a90b90a4b3780e9a","snippet":"class Sieve { final int limit; late final List primes; Sieve(this.limit) { primes = _calculatePrimes(limit); } List _calculatePrimes(int limit) { if (limit < 2) return []; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-03T07:47:23.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Tirumalasetti-Tejaswini"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/Tirumalasetti-Tejaswini","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"d23a5aa57b2f4c769302e6487e0c8bda","snippet":"class Sieve { final int limit; late final List primes; Sieve(this.limit) { primes = _generatePrimes(limit); } List _generatePrimes(int n) { if (n < 2) return []; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-04T04:37:55.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"divya-19999"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/divya-19999","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"4458390843514478bfeef78b9406e8f6","snippet":"class Sieve { final int limit; late final List primes; Sieve(this.limit) { primes = _generatePrimes(limit); } List _generatePrimes(int n) { if (n < 2) return []; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-04T05:54:28.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Tatavarthisravani"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/Tatavarthisravani","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"b058b06d8b86447d8eff12b5257f01b1","snippet":"class Sieve { final List _primes = []; Sieve(int limit) { if (limit < 2) { return; } // Create a list representing the numbers from 0 up to limit. // Index represents the number, and the boolean value represents whether it is prime. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-06-13T13:23:18.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"david82"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/david82","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"20321154c91e457e9201535e5b9c66a8","snippet":"class Sieve { final int limit; Sieve(this.limit); List get primes { if (limit < 2) return []; final isPrime = List.filled(limit + 1, true); isPrime[0] = false; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-03T09:01:27.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"Loki10"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/Loki10","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"2aa16cc71192475486ca4cb4a28b6953","snippet":"class Sieve { Sieve(int max){ this.max = max; } late int max; List get primes{ List numbers = []; for(int i = 2;i <= max; i++){ numbers.add(i); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-21T10:52:23.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"DavidKombacher"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/DavidKombacher","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"92182ea0f3bd4e3e8a362cbd21ac7dee","snippet":"class Sieve { List primes = []; Sieve(int n) { List result = List.generate(n-1, (int idx) => idx+2); int i, x, j, z, idx; i = 0; while(i < result.length) { x = result[i]; j = 2; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-30T05:26:45.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"turenko"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/turenko","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"4a3e87e8b2c44a56ba3acf9b5245295c","snippet":"enum NumberStates { prime, composite } class Sieve { Sieve(this.max) { final eratosthenes = {for (int i = 2; i <= max; i++) i: NumberStates.prime}; for (var number in eratosthenes.keys) { for (int i = number * 2; i <= max; i += number) { eratosthenes[i] = NumberStates.composite; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-18T19:40:38.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"jealwe"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/jealwe","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"c6a9581f369c456abc444098759eb747","snippet":"class Sieve { final int number; Sieve(this.number); get primes{ List primes = List.filled(number+1, true); List result = []; for (int p = 2; p * p <= number; p++) { if (primes[p] == true) { for (int i = p * p; i <= number; i += p) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-02T06:05:49.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"adlan11"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/adlan11","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"fa65fedfb9574b7d8ccff743bd8fc438","snippet":"class Sieve { int upper; Sieve(this.upper); List get primes { List prime = List.filled(upper + 1, true); prime[0] = prime[1] = false; for (var i = 2; i * i <= upper; i++) { if (prime[i]) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-17T07:36:41.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"taylorren"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/taylorren","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"3423cfb5fa994f5f86625ecb4d5f7e45","snippet":"class Sieve { late List primes; Sieve(int n) { primes = [for (var x = 2; x <= n; x++) x]; for (var i = 0; i < primes.length; i++) { var j = i + primes[i]; while (primes[i] != 0 && j < primes.length) { primes[j] = 0; j += primes[i]; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-01-29T15:02:51.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"y1n0"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/y1n0","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"aa9267d9256d41c2bb45c238ec8c5a08","snippet":"class Sieve { final int limit; Sieve(this.limit); List get primes { if (limit < 2) return []; List isPrime = List.filled(limit + 1, true); isPrime[0] = false; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-07-26T19:44:55.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"mariam-280"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/mariam-280","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}},{"uuid":"512d18feb60a472d838eb1b9d70371dc","snippet":"class Sieve { final int limit; Sieve(this.limit); List get primes { if (limit < 2) return []; // Initialize a list where index represents the number, marked true by default List isPrime = List.generate(limit + 1, (_) => true); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-07-27T14:10:49.000Z","is_out_of_date":false,"language":"dart","author":{"handle":"dianagracebudithi"},"exercise":{"title":"غربال اراتوستن","icon_url":"https://assets.exercism.org/exercises/sieve.svg"},"track":{"title":"Dart","icon_url":"https://assets.exercism.org/tracks/dart.svg","highlightjs_language":"dart"},"links":{"public_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/solutions/dianagracebudithi","private_iterations_url":"https://exercism.org/fa/tracks/dart/exercises/sieve/iterations"}}],"meta":{"current_page":1,"total_count":50,"total_pages":3,"unscoped_total":50}}}}}

مسیرهای زبان

با Jiki کدنویسی یاد بگیرید

سفر شما

علاقه‌مندی‌های شماجدید

مزایای Exercism

ویدیوهای جامعه

مجموعه‌ی معرفی‌های کوتاه

مصاحبه‌ها و داستان‌ها

Discord

انجمن

شروع کار

منتورینگ

مستندات

مشارکت‌کنندگان

مترجمانجدید

حمایت مالی

درباره‌ی Exercism

تأثیر ما

همگام‌ساز GitHubجدید

Insiders