Console in the editor (beta)
Clear console on run
Indent with tabs
Code hinting (autocomplete) (beta)
Only auto-run code that validates
Auto-save code (bumps the version)
Auto-close HTML tags
Live code validation
Highlight matching tags
Show boilerplates bar less often
Save anonymous (public) fiddle?
- Be sure not to include personal data- Do not include copyrighted material
Log in if you'd like to delete this fiddle in the future.
Fork anonymous (public) fiddle?
No autoresizing to fit the code
Render blocking of the parent page
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 
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.
/echo simulates Async calls:
See docs for more info.
Created and maintained by Piotr and Oskar.
Hosted on DigitalOcean
All code belongs to the poster and no license is enforced. JSFiddle or its authors are not responsible or liable for any loss or damage of any kind during the usage of provided code.
Roadmap (vote for features)