Settings - JSFiddle - Code Playground

Nishit's public fiddles

divisors/Divisors

Create a function named divisors/Divisors that takes an integer n > 1 and returns an array with all of the integer's divisors(except for 1 and the number itself), from smallest to largest. If the number is prime return the string '(integer) is prime' (null in C#) (use Either String a in Haskell and Result<Vec<u32>, String> in Rust). its a code challenge . you can choose any language Output will be divisors(12); // should return [2,3,4,6] divisors(25); // should return [5] divisors(13); // should return "13 is prime" Note : When you guys have a free time please work on above code challenge . and submit your code.

divisors/Divisors

Create a function named divisors/Divisors that takes an integer n > 1 and returns an array with all of the integer's divisors(except for 1 and the number itself), from smallest to largest. If the number is prime return the string '(integer) is prime' (null in C#) (use Either String a in Haskell and Result<Vec<u32>, String> in Rust). its a code challenge . you can choose any language Output will be divisors(12); // should return [2,3,4,6] divisors(25); // should return [5] divisors(13); // should return "13 is prime" Note : When you guys have a free time please work on above code challenge . and submit your code.