Easy 2 point
Medium 4 points
Hard 6 points
Ninja 10 points
| Question | Type | Level | 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 to check if a number is zero without using ==, !=, or comparison operators? | Challenge | Medium | Solve |
| Write a function to flip a binary value (0 to 1, or 1 to 0) without using !, ^, or ~ ? | Challenge | Medium | Solve |
| Write a function to check if two numbers are equal without using ==, !=, <, > ? | Challenge | Medium | Solve |
| Write a function to return 1 if a number is positive, 0 otherwise — without using comparison operators or if ? | Challenge | Medium | Solve |
| Write a function to check whether a number is divisible by 2 without using %, /, or & ? | Challenge | Medium | 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 the sum of digits of the product of all input numbers? | Number | Hard | Solve |