📄️ 8.1 Introduction
For the numerous math problems on LeetCode, we strive to categorize and explain them by type. However, many math problems have solutions that are not universally applicable, making it challenging to summarize all problem-solving techniques in one go. Therefore, we have selected a few classic or representative problems for your reference.
📄️ 8.2 Least Common Multiple and Greatest Common Divisor
Using the Euclidean algorithm, we can efficiently calculate the greatest common divisor (GCD) of two numbers. Multiplying the two numbers and dividing the product by their GCD gives the least common multiple (LCM).
📄️ 8.3 Prime Numbers
Prime numbers are integers greater than 1 that have no divisors other than 1 and themselves. It is important to note that every number can be expressed as a product of prime numbers.
📄️ 8.4 Numerical Processing
504. Base 7
📄️ 8.5 Random and Sampling
384. Shuffle an Array
📄️ 8.6 Exercises
Basic Difficulty