{"request":{"endpoint":"https://exercism.org/api/v2/tracks/typescript/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"22d872ec9cef4cc2b2e02c6d2b84ca56","snippet":"export function calculatePrimeFactors(n: number): number[] { const factors: number[] = [] let divisor = 2 while (n > 1) { while (n % divisor === 0) { factors.push(divisor) n /= divisor } divisor++ } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-20T19:54:59.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"alexcarrizosa"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/alexcarrizosa","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"b549bd099dfc476da03d25c09fe557e3","snippet":"export function calculatePrimeFactors(_n: number) { let pri: number[] = primes(900000) let ret: number[] = [] let divisor_index: number = 0 while(_n > 1) { if(_n % pri[divisor_index] == 0) { ret.push(pri[divisor_index]) _n /= pri[divisor_index] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":46,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-06-27T18:25:31.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"kepler"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/kepler","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"91109bce4b29444e942803ec3783dbed","snippet":"export function calculatePrimeFactors(number: number): number[] { const primeFactors: number[] = []; let divisor = 2; while (number > 1) { if (number % divisor === 0) { primeFactors.push(divisor); number /= divisor; } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-03T22:55:29.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"EfrenAlmanzalamas"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/EfrenAlmanzalamas","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"c98cfcb3616c4d97bf27350e813b1989","snippet":"export function calculatePrimeFactors(num: number): number[] { const result: number[] = []; let div = 2; while(num != 1) { if ( num % div == 0 ) { num = num / div; result.push(div); } else { div++; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-12-13T00:54:41.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"rkaustchr"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/rkaustchr","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"f9b53e1f2c524a88990a55bb8dfd2f22","snippet":"export function calculatePrimeFactors(factor: number) { let divisor = 2; let result = []; while (factor > 1) { if (!(factor % divisor)) { factor = factor / divisor; result.push(divisor); } else { divisor++; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-08-30T08:01:02.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"rlukawski"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/rlukawski","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"2f06e803d5614607ae59f5e385e91a53","snippet":"export default function(n: number): number[] { const pf = [] for(let i = 2; n >= i;) { if(n%i === 0) { n /= i pf.push(i) } else i++ } return pf ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"anurat"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/anurat","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"29eeac97b95148e49164eff6bf81b68c","snippet":"export function calculatePrimeFactors(toFactor: number): number[] { return Array.from(primeFactors(toFactor)); } function *primeFactors(toFactor: number): Iterable { var result = toFactor; for (const prime of generatePrimes(toFactor)) { while (result > 1 && result % prime == 0) { result /= prime; yield prime; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":28,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2021-10-05T20:30:49.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"Cyro56"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/Cyro56","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"ca60ce6fbb10491e88700ad974112bbf","snippet":"function isPrime(n: number): boolean { if (n % 1 !== 0 || n % 2 === 0 || n <= 2) { return n === 2; } for (let i = 3, sr = Math.sqrt(n); i <= sr; i += 2) { if (n % i === 0) { return false; } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-16T23:21:55.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"mickio"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/mickio","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"826980b781e04e6a91158c061ec903fc","snippet":"function *generatePrimeFactors(n: number): Generator { let i = 2 while (i <= n) { if (n % i === 0) { yield i n = n / i } else { i++ } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-09T01:36:02.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"yuksew"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/yuksew","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"80de83102be04fb1b556ff0e38bae75e","snippet":"export function calculatePrimeFactors(input: number): number[] { if (input < 2) { return []; } const output: number[] = []; while (input % 2 === 0) { output.push(2); input /= 2; ","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":"2022-05-29T10:27:17.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"mystvearn147"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/mystvearn147","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"f237c46808cf4b66830d94aa77a3f1ba","snippet":"export const calculatePrimeFactors = (input: number): number[] => { let divisor = 2 const result = [] while (input > 1) { if (input % divisor === 0) { result.push(divisor) input /= divisor } else { divisor++ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-08-27T12:46:40.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"dan-lee"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/dan-lee","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"4805cb05948d4d6aa98cbbe0914b07e6","snippet":"export const calculatePrimeFactors = (start: number) => { let fac = [] let divisor = 2 while (start > 1) { while (start % divisor === 0) { fac.push(divisor); start /= divisor; } ","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":"2022-09-07T18:03:21.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"menketechnologies"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/menketechnologies","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"16d621f758b8494fad9e74ab48917b82","snippet":"export function calculatePrimeFactors(n:number):number | number [] { let factors:number[] = [] if (n > 1){ for (var i:number = 2; i <= n; i++) { if (n % i===0){ return ([i].concat(calculatePrimeFactors(n / i))) } } } return factors; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-18T21:31:51.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"theoG"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/theoG","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"a6950dd908564b3f926aa528febfce47","snippet":"export function calculatePrimeFactors(d: number): number[]{ let allFactors: number[] = [] let currentNum = d for(let i=2;i<=currentNum;i++){ if(currentNum % i === 0){ allFactors.push(i) currentNum = currentNum / i i=1 } } ","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":"2023-04-26T02:59:53.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"jrjeffreyrice257"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/jrjeffreyrice257","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"585e25f2d6984bb2bb81fbe76d1e2777","snippet":"const primes = (n: number): number[] => { const array = new Array(n + 1).fill(true) const p = new Set([...Array(n + 1).keys()].map((i) => i)) for (let i = 2; i <= Math.sqrt(n); i++) { if (p.has(i)) { for (let j = i * i; j < n + 1; j += i) { p.delete(j) } ","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":"2023-02-23T10:18:04.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"pedrotari7"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/pedrotari7","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"cf358f68468b4e12be3e76e1a651af42","snippet":"export function calculatePrimeFactors(input_number: number) { let divisors = new Array; let to_divide = input_number; let divisor = 2; while (divisor <= to_divide){ if (to_divide % divisor === 0) { to_divide /= divisor; ","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":"2022-11-28T01:09:29.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"chris31415926535"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/chris31415926535","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"0062af73c3744c8b844a7896b78fe41d","snippet":"export function calculatePrimeFactors(n: number): number[] { const factors = []; let d = 2; while (n >= 2) { if (n % d === 0) { factors.push(d); n /= d; } else { d++; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-10-26T07:00:07.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"Jack-ALM"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/Jack-ALM","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"cffdde4abaf149df806f581fa94752d2","snippet":"export function calculatePrimeFactors(n : number) : number[] { let primeFactors : number[] = []; let divisor = 2; while (n >= 2) { if (n % divisor === 0) { primeFactors.push(divisor); n = n / divisor; } else { divisor++; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-17T12:53:54.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"LionelMN"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/LionelMN","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"1167fafef7a747b69b3d866b2347e9cc","snippet":"export function calculatePrimeFactors(value:number):number[] { let divisor:number = 2; let result:number[] = []; while (value > 1) { if (value % divisor === 0) { result.push(divisor); value /= divisor; }else{ divisor++; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-08-03T01:17:26.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"cvalencia1991"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/cvalencia1991","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"7e19fe51199c4b1486f4bf7f9f20bf74","snippet":"export function calculatePrimeFactors(value: number): number[] { let divided: number = value; let factors: number[] = []; let currentDivisor: number = 2; while (divided !== 1) { if (divided % currentDivisor === 0) { factors.push(currentDivisor); divided /= currentDivisor; } else { ","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-09-05T07:16:35.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"socheatathai"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/socheatathai","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"ff97f31f2a0f4a94ba63ea19d5bb0dd4","snippet":"const primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]; export function calculatePrimeFactors(n: number): number[] { const factors: number[] = []; let i = 0; let prime = primes[i]; while (n > 1) { while (n % prime === 0) { factors.push(prime); n /= prime; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":38,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-07T23:18:30.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"ghnoob"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/ghnoob","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"eb8c764f130740899f76a76a8b44041d","snippet":"export function calculatePrimeFactors(num:number){ var factors = Array(); var br:boolean; while (num > 1){ br = true; for (var i:number = 2; i <= num && br; i++){ if (num % i == 0){ factors.push(i); br = false; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"sephirothrr"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/sephirothrr","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"2fefa64cc352456abc0ed208a2550943","snippet":"export function calculatePrimeFactors(input: number):number[] { let num = input; let factors = new Array(); while(num % 2 === 0){ num = num / 2; factors.push(2); } let factor = 3; while(num != 1){ if(num % factor === 0){ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-03-27T13:44:50.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"zeeshan707"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/zeeshan707","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}},{"uuid":"a624bee0d0aa4a97b47aa8c0c0f741bb","snippet":"function getPrimes(max: number): number[] { const sieve: boolean[] = []; let j = 0; const primes: number[] = []; try { for (let i = 2; i <= max; ++i) { if (!sieve[i]) { primes.push(i); for (j = i << 1; j <= max; j += i) { sieve[j] = true; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":44,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-28T02:03:18.000Z","is_out_of_date":false,"language":"typescript","author":{"handle":"lewislwood"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"TypeScript","icon_url":"https://assets.exercism.org/tracks/typescript.svg","highlightjs_language":"typescript"},"links":{"public_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/solutions/lewislwood","private_iterations_url":"https://exercism.org/uk/tracks/typescript/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":108,"total_pages":5,"unscoped_total":108}}}}}

Мовні треки

Вчимося програмувати з Jiki

Подорож

ОбранеНове

Переваги Exercism

Відео спільноти

Серія коротких вступів

Інтервʼю та історії

Discord

Форум

З чого почати

Наставництво

Документація

Учасники

ПерекладачіНове

Пожертвувати

Про Exercism

Наш вплив

Синхронізатор GitHubНове

Інсайдери