leetcode2sumc interview 面试

leetcode 2和c面试3月25日至3月31日3月25日1. Learn about LCM and GCD 1. The euclidean Algorithm 2. https://www.geeksforgeeks.org/common-divisors-of-n-numbers/ 3. https://www.geeksforgeeks.org/common-divisors-of-two-numbers/ 2. Leetcode 1. https://leetcode.com/problems/intersection-of-two-arrays-ii/ - Done 2. https://leetcode.com/problems/is-subsequence/ - Done 3. Coursera - algori