{"request":{"endpoint":"https://exercism.org/api/v2/tracks/groovy/exercises/sum-of-multiples/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"8eea97d316dd4bc49a7bb3f742ccc78d","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { (1.. factors.any { factor -> (factor > 0) && (number % factor == 0) } }.sum(0) as int } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-07-01T13:01:22.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"ancho"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/ancho","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"57870bfa9f55492e88c1086f91aae95c","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { def fs = factors.findAll { it != 0 } (1.. fs.any { i % it == 0 } } .sum() ?: 0 } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-07-20T12:56:55.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"glennj"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/glennj","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"d433d40869be4706bc482809a990e344","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { factors = factors.findAll {it != 0} (1.. factors.any {n % it == 0} }?.sum() ?: 0 } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-14T22:49:53.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"suic86"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/suic86","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"fb97860d6d014860ac4df6a358d45bcd","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { def multiples = [] for (factor in factors) { if (factor == 0) { continue } for (def i = factor; i < limit; i += factor) { multiples.add(i) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-12-04T20:58:18.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"mooper37"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/mooper37","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"82fd284a82524605a0a143bad6c8d354","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { (1.. factors.any { h -> h != 0 && f % h == 0 } }.sum(0) as int } }","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-04-23T23:45:20.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"amscotti"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/amscotti","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"0749a0e70d124622a75441ba5f82b63f","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { (1.. if(factors.find {it && i % it == 0}) i}.findAll {it}.sum()?: 0 } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-06-16T15:39:07.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"anwarsky"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/anwarsky","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"b0d458e051184683a15a72647d9cd2ac","snippet":"class SumOfMultiples { static Integer sum ( List factors, Integer limit ) { return ( 0.. factors.find { it > 0 && num % it == 0 } }.sum () ?: 0 } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-23T19:39:45.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"dimos1984"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/dimos1984","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"173d3609333f41bf98cc64a7a7c297c0","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { (1.. factors.any { int factor -> factor > 0 && num % factor == 0 } }.sum(0) } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-08-31T15:15:29.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"steve-perkins"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/steve-perkins","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"273c1a67ab674962a4695221c1e05c24","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { factors.removeIf{it == 0} (1.. factors.any{ f % it == 0}}.sum(0) as int } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-14T16:26:38.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"menketechnologies"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/menketechnologies","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"779e993b6536433989513a84b9f82569","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { List multis = [] for(int i=1; i factors, int limit) { def multiples = [] factors.each { factor -> def multiple = factor def multiplier = 1 while (multiple < limit) { multiples << multiple ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2022-10-31T14:52:49.000Z","is_out_of_date":true,"language":"groovy","author":{"handle":"gilesejb"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/gilesejb","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"66620b74db304e4bba4181728ce471ca","snippet":null,"num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-12T11:58:53.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"Macudsc"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/Macudsc","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"28631942d005497185b10bdbdd0250a2","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { Set multiples = [] factors.each{ if (it == 0) multiples << 0 else { Integer value = it ","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-11-10T16:42:37.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"Ironus"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/Ironus","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"eb9661d62382414d921157da4f60d6cf","snippet":"import java.util.BitSet class SumOfMultiples { static int sum(List factors, int limit) { BitSet multiples = new BitSet(limit) factors.each { factor -> if (factor != 0) { for (int multiple = factor; multiple < limit; multiple += factor) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-01-31T21:44:44.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"FranklinChen"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/FranklinChen","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"c1a82419cb57485fbede5424c95c90ce","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { def sumTotal = new ArrayList() factors.removeAll { it == 0 } if(factors.size()>0) { for(int i=1; i factors, int limit) { factors -= 0 if (!factors.isEmpty() && factors.min() <= limit) { // Validate edge cases (factors.min()..(limit - 1)) // Loop on possible values. .findAll { v -> factors.find { f -> v % f == 0 } != null } // Filter out those that doesn't match the factors. .sum() // Sum the total. } else { 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-03-12T16:56:21.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"pldupont"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/pldupont","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"91a40eadd6fe4b75b4ebe579e002aae2","snippet":"import java.util.stream.IntStream class SumOfMultiples { static int sum(List factors, int limit) { factors.collect { factorsOf(it, limit) }.flatten().unique().sum(0) } private static factorsOf(int base, int limit) { IntStream.iterate(base, { it + base }) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-05-20T20:18:50.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"KirillArtamonov"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/KirillArtamonov","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"9a1a1703ddaf43da9d0fbba1b7a0665c","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { def lst = [] //for-in loop is better when using with break. DO NOT USE each in combination with break/continue for(i in factors) { def mul = 0; def num = 1; //the iterations needed will be far less than limit. using break for exiting loop when condition is no longer met ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-08-17T08:50:52.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"bsnecco"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/bsnecco","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"fee1506aad9a45cf8332d98f104be805","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { (1.. factors.any{it>0 && n%it==0}}.sum(0) } }","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-10-03T07:25:54.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"darkcheftar"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/darkcheftar","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"ab0222323ee5492db4cd4d06e10186e6","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { (1.. factor != 0 && it % factor == 0 } }.sum(0) } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-04-09T10:07:31.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"Yevhenii-Khaliuk"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/Yevhenii-Khaliuk","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"f9631ac53b4d4535a863112652d5a0dd","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { factors .findAll { it > 0 && it < limit } .collectMany([] as Set) { (it.. factors, int limit) { factors = factors - 0 (1.. factors.any { factor -> n % factor == 0 } }. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-18T19:25:49.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"nelok"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/nelok","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"64e560e4837444fe948a023023a39af2","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { Set nums = [0] factors.each { def range = (it ..< limit).by(it) if (it > 0 && !range.reverse) range.each(nums.&add) } nums.sum() } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-10-10T20:28:29.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"AMathMonkey"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/AMathMonkey","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}},{"uuid":"d022956607f54786918e707a353ebaaa","snippet":"class SumOfMultiples { static int sum(List factors, int limit) { factors.inject([] as HashSet) { uniqueMultiples , factor -> if (factor > 0) { def multiple = factor while (multiple < limit) { uniqueMultiples.add(multiple) multiple += factor } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-12-16T23:43:21.000Z","is_out_of_date":false,"language":"groovy","author":{"handle":"denizeve"},"exercise":{"title":"Άθροισμα πολλαπλασίων","icon_url":"https://assets.exercism.org/exercises/sum-of-multiples.svg"},"track":{"title":"Groovy","icon_url":"https://assets.exercism.org/tracks/groovy.svg","highlightjs_language":"groovy"},"links":{"public_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/solutions/denizeve","private_iterations_url":"https://exercism.org/el/tracks/groovy/exercises/sum-of-multiples/iterations"}}],"meta":{"current_page":1,"total_count":32,"total_pages":2,"unscoped_total":32}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders