JS 中的 DSA - 解决基本数学问题
DSA in JS - Solving Basic Math Problems
- 1. Introduction
- 1. Introduction
- 2. Analysis of Algorithms
- 3. Time & Space Complexity
- 2. Let's Solve
- 1. Count Digits Overview
- 3. Count Digits Solution
- 4. Palindrome Number Overview
- 6. Palindrome Number Solution
- 7. Factorial Overview
- 9. Factorial Iterative Approach Solution
- 11. Factorial Recursive Approach Solution
- 12. Trailing Zeroes in a Factorial Overview
- 14. Trailing Zeroes in a Factorial Solution
- 15. GCD HCF Overview
- 17. GCD Naive Approach Solution
- 18. GCD Better Approach Overview
- 20. GCD Better Approach Solution
- 21. LCM Overview
- 23. LCM Naive Approach Solution
- 24. LCM Better Approach Overview
- 26. LCM Better Approach Solution
- 27. Prime Numbers Overview
- 29. Prime Numbers Naive Solution
- 30. Prime Numbers Better Approach 1 Overview
- 32. Prime Numbers Better Approach 1 Solution
- 33. Prime Numbers Better Approach 2 Overview
- 35. Prime Numbers Better Approach 2 Solution
- 36. Prime Factors Overview
- 39. Prime Factors Naive Solution
- 40. Prime Factors Efficient Overview
- 42. Prime Factors Efficient Approach Solution
- 43. Divisors Overview
- 45. Divisors Naive Approach Solution
- 46. Divisors Efficient Approach Overview
- 48. Divisors Efficient Approach Solution
- 49. Divisors Efficient Approach Extended Solution Explanation
- 50. Primes of Number Overview
- 52. Primes of Number Naive Solution
- 53. Sieve of Eratosthenes Overview
- 55. Sieve of Eratosthenes Solution
- 56. Computing Power Overview
- 58. Computing Power naive approach solution
- 59. Computing Power Recursive Approach Overview
- 61. Computing Power Recursive Approach Solution
- 62. Computing Power Iterative Approach Overview
- 64. Computing Power Iterative Approach Solution
- 3. Practice problems
- 2. Absolute Value Solution
- 4. Number of Digits in a Factorial Solution
- 6. Exactly Three Divisors Solution
- 8. Modulo Addition Solution
- 10. Modulo Multiplication Solution
- 4. Conclusion
- 1. Thank You