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 |
Practice JavaScript Online
Become a Javascript Ninja with Javascript Challenges
Welcome to JavaScript Ninjas, your premier destination for mastering JavaScript online. Whether you're a novice or an experienced coder, our platform offers a dynamic environment to practice JavaScript online, tackle challenging coding challenges, and elevate your skills to ninja-level proficiency. With our curated collection of real-time JavaScript challenges, you'll have the opportunity to hone your coding prowess and become a true JavaScript Ninja. Join our community today and embark on your journey to becoming a coding master!