Leap of Faith
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 0 | isPrime | Java | O(√n) | O(1) | Easy | ||
| 1 | print all Primes till N | Java | O(√n) | O(1) | Easy | ||
| 2 | print all Fibonacci till N | Java | O(n) | O(1) | Easy | ||
| 3 | Count Digits in a Number | Java | O(n) | O(1) | Easy | ||
| 4 | Digits of a Number | Java | O(n) | O(1) | Easy | Todo with Recursion | |
| 5 | Reverse a Number | Java | O(n) | O(1) | Easy | Todo with Recursion | |
| 6 | Inverse of a Number | Java | O(n) | O(1) | Easy | ||
| 7 | Rotate a Number | Java | O(n) | O(1) | Easy | ||
| 8 | GCD and LCM | Java | O(log(a+b)) | O(1) | Easy | To Derive Time Complexity | |
| 9 | Prime Factorization of a Number | Java | O(√n) | O(1) | Easy | Prove Validity of last if condition | |
| 10 | Pythagorean Triplet | Java | O(1) | O(1) | Easy | ||
| 11 | 319. Bulb Switcher / Benjamin Bulbs | Java | O(√n) | O(1) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 0 | pattern1 | Java | O(n²) | O(1) | Easy | ||
| 1 | pattern2 | Java | O(n²) | O(1) | Easy | ||
| 2 | pattern3 | Java | O(n²) | O(1) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 0 | Digit Frequency | Java | O(n) | O(1) | Easy |