Javascript Ninjas
Easy 2 point Medium 4 points Hard 6 points Ninja 10 points

Question Type Level Solve
Write a JavaScript function that takes two parameters: an array and an integer n. The function should return the element at the nth index of the array? Array Hard Solve
Write a function that converts the given number to english phrase? Number Hard Solve
Write a function to count how many digits a number has without using division (/), multiplication (*), or % ? Challenge Hard Solve
Write a function to find longest substring with all distinct characters? String Hard Solve
Write a function that returns the remainder when a number is divided by 10, without using %, /, *, or subtraction ? Challenge Hard Solve
Write a function that returns true if a number is "almost prime" (i.e., has exactly two distinct prime factors)? Math Hard Solve
Write a function that returns true if a number is "almost prime" (i.e., has exactly two distinct prime factors)? Math Hard Solve
Write a function that returns a list of prime factors of the given number in ascending order? Array Hard Solve
Write a function that removes all duplicate letters from given string? String Hard Solve
Write a function that sorts the given list of numbers in descending order? Array Hard Solve



Level Up Your JavaScript Skills

Train Like a Ninja. Code Like a Pro.

Welcome to JavaScript Ninjas — the ultimate playground for mastering JavaScript through hands-on coding. Whether you're just getting started or sharpening your blade, our interactive challenges, live coding playground, and real-time feedback will push your skills to the next level. Write, run, and test JavaScript directly in your browser. Learn by doing. Solve real problems. Become the JavaScript Ninja you were born to be.