Prime Factorization¶
Table of Contents¶
- 2521. Distinct Prime Factors of Product of Array (Medium)
- 2507. Smallest Value After Replacing With Sum of Prime Factors (Medium)
- 3326. Minimum Division Operations to Make Array Non Decreasing (Medium)
- 2584. Split the Array to Make Coprime Products (Hard)
- 2709. Greatest Common Divisor Traversal (Hard)
- 2862. Maximum Element-Sum of a Complete Subset of Indices (Hard)
- 2818. Apply Operations to Maximize Score (Hard)
- 1998. GCD Sort of an Array (Hard)
- 1735. Count Ways to Make Array With Product (Hard)
- 2338. Count the Number of Ideal Arrays (Hard)
2521. Distinct Prime Factors of Product of Array¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, hash table, math, number theory
2507. Smallest Value After Replacing With Sum of Prime Factors¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: math, simulation, number theory
3326. Minimum Division Operations to Make Array Non Decreasing¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, greedy, number theory
2584. Split the Array to Make Coprime Products¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, hash table, math, number theory
2709. Greatest Common Divisor Traversal¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, union find, number theory
2862. Maximum Element-Sum of a Complete Subset of Indices¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, number theory
2818. Apply Operations to Maximize Score¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, stack, greedy, sorting, monotonic stack, number theory
1998. GCD Sort of an Array¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, union find, sorting, number theory
1735. Count Ways to Make Array With Product¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, dynamic programming, combinatorics, number theory
2338. Count the Number of Ideal Arrays¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: math, dynamic programming, combinatorics, number theory