Easy 2 point
Medium 4 points
Hard 6 points
Ninja 10 points
| Question | Type | Level | Solve |
|---|---|---|---|
| Write a function that takes an array and an integer k, and returns the maximum sum of any subarray of size k with all distinct elements? | Array | Hard | Solve |
| Write a function that takes an array and returns the maximum sum of non-adjacent elements? | Array | Hard | Solve |
| Write a function that takes an array and returns the count of reverse pairs (i, j) where i < j and arr[i] > 2 * arr[j]? | Array | Hard | Solve |
| Write a function that takes an array and returns true if it can be partitioned into two subsets such that the absolute difference of their sums is minimized? | Array | Hard | Solve |
| Write a function that returns the next number in a geometric sequence? | Puzzle | Hard | 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 to count how many digits a number has without using division (/), multiplication (*), or % ? | Challenge | 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 |