This directory includes problems, solutions and accompanying notes for various basic math problems.
| S.No. | Problem | Solution | Difficulty | Solution Notes |
|---|---|---|---|---|
| 1 | Count Digits | [Optimal](./01_Count%20Digits/01_Count_Digits.js | ||
| ) |  |
Notes | ||
| 2 | Reverse a Number | [Optimal](./02_Reverse%20a%20Number/02_Reverse_a_Number.js | ||
| ) | |
Notes | ||
| 3 | Palindrome Number | [Optimal](./03_Palindrome%20Number/03_Palindrome_Number.js | ||
| ) | |
Notes | ||
| 4 | Armstrong Number | [Optimal](./04_Armstrong%20Number/04_Armstrong_Number.js | ||
| ) |  |
Notes | ||
| 5 | Print All Divisors | [Brute Force](./05_print%20all%20divisors/05_all_divisors_bruteforce.js | ||
| ) [Optimal](./05_print%20all%20divisors/05_all_divisors_optimal.js |
||||
| ) | |
Notes | ||
| 6 | Sum of All Divisors | [Brute Force](./06_Sum%20of%20all%20divisors/06_sum_of_divisors_bruteforce.js | ||
| ) | |
Notes | ||
| 7 | Check Prime Number | [Optimal](./07_Check%20Prime%20Number/07_check_prime_optimal.js | ||
| ) | |
Notes | ||
| 8 | GCD or HCF | [Brute Force](./08_GCD%20or%20HCF/08_GCD_or_HCF_BruteForce.js | ||
| ) [Optimal](./08_GCD%20or%20HCF/08_GCD_or_HCF_Optimal.js |
||||
| ) | |
Notes |