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

Question Type Level Solve
Write a function that checks whether the given binary tree is a binary search tree? Data Structures Hard Solve
Write a function to check whether the given binary tree has the given value node? Data Structures Medium Solve
Write a function that checks whether the given binary tree is a max heap? Data Structures Hard Solve
Write a function to check whether the given binary tree is a min heap? Data Structures Hard Solve
Write a function that finds the missing number in a list of consecutive numbers that was shuffled? Array Medium Solve
Write a function that sorts list of strings according to string length and then lexicographically? Array Hard Solve
Write a function to add two single digit numbers without using any operators? Challenge Hard Solve
Write a function that creates a cumulative sum array? Array Medium Solve
Write a function to find time duration between two times in minutes? String Hard Solve
Write a function that extracts unique elements from two lists? Array Medium 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.