Skip to content

Topic: Number Theory

64 problems
TitleStatusDifficulty
Count Primes—Medium
Add Digits—Easy
Mirror Reflection—Medium
Prime Palindrome—Medium
X of a Kind in a Deck of Cards—Easy
Largest Component Size by Common Factor—Hard
Ugly Number III—Medium
Check If It Is a Good Array—Hard
Simplified Fractions—Medium
The kth Factor of n—Medium
Graph Connectivity With Threshold—Hard
Count Ways to Make Array With Productread—Hard
Tree of Coprimesread—Hard
Maximize Score After N Operations—Hard
Maximize Number of Nice Divisors—Hard
Number of Different Subsequences GCDs—Hard
Three Divisors—Easy
Find Greatest Common Divisor of Array—Easy
GCD Sort of an Array—Hard
Number of Pairs of Interchangeable Rectanglesread—Medium
Count Array Pairs Divisible by Kread—Hard
Replace Non-Coprime Numbers in Array—Hard
Minimum Lines to Represent a Line Chart—Medium
Count the Number of Ideal Arrays—Hard
Minimum Deletions to Make Array Divisibleread—Hard
Smallest Even Multiple—Easy
Number of Common Factors—Easy
Number of Subarrays With GCD Equal to K—Medium
Number of Subarrays With LCM Equal to K—Medium
Smallest Value After Replacing With Sum of Prime Factors—Medium
Minimize the Maximum of Two Arrays—Medium
Distinct Prime Factors of Product of Array—Medium
Closest Prime Numbers in Range—Medium
Check if Point Is Reachable—Hard
Split the Array to Make Coprime Products—Hard
Prime Subtraction Operation—Medium
Make K-Subarray Sums Equalread—Medium
Prime In Diagonal—Easy
Greatest Common Divisor Traversal—Hard
Number of Beautiful Pairs—Easy
Prime Pairs With Target Sum—Medium
Insert Greatest Common Divisors in Linked List—Medium
Apply Operations to Maximize Score—Hard
Maximum Element-Sum of a Complete Subset of Indices—Hard
Count Valid Paths in a Tree—Hard
Count Beautiful Substrings I—Medium
Count Beautiful Substrings II—Hard
Minimize Length of Array Using Operations—Medium
Most Frequent Primeread—Medium
Maximum Prime Difference—Medium
Page 1 of 2