Skip to content

Topic: Number Theory

64 problems
TitleStatusDifficulty
Count PrimesMedium
Add DigitsEasy
Mirror ReflectionMedium
Prime PalindromeMedium
X of a Kind in a Deck of CardsEasy
Largest Component Size by Common FactorHard
Ugly Number IIIMedium
Check If It Is a Good ArrayHard
Simplified FractionsMedium
The kth Factor of nMedium
Graph Connectivity With ThresholdHard
Count Ways to Make Array With ProductreadHard
Tree of CoprimesreadHard
Maximize Score After N OperationsHard
Maximize Number of Nice DivisorsHard
Number of Different Subsequences GCDsHard
Three DivisorsEasy
Find Greatest Common Divisor of ArrayEasy
GCD Sort of an ArrayHard
Number of Pairs of Interchangeable RectanglesreadMedium
Count Array Pairs Divisible by KreadHard
Replace Non-Coprime Numbers in ArrayHard
Minimum Lines to Represent a Line ChartMedium
Count the Number of Ideal ArraysHard
Minimum Deletions to Make Array DivisiblereadHard
Smallest Even MultipleEasy
Number of Common FactorsEasy
Number of Subarrays With GCD Equal to KMedium
Number of Subarrays With LCM Equal to KMedium
Smallest Value After Replacing With Sum of Prime FactorsMedium
Minimize the Maximum of Two ArraysMedium
Distinct Prime Factors of Product of ArrayMedium
Closest Prime Numbers in RangeMedium
Check if Point Is ReachableHard
Split the Array to Make Coprime ProductsHard
Prime Subtraction OperationMedium
Make K-Subarray Sums EqualreadMedium
Prime In DiagonalEasy
Greatest Common Divisor TraversalHard
Number of Beautiful PairsEasy
Prime Pairs With Target SumMedium
Insert Greatest Common Divisors in Linked ListMedium
Apply Operations to Maximize ScoreHard
Maximum Element-Sum of a Complete Subset of IndicesHard
Count Valid Paths in a TreeHard
Count Beautiful Substrings IMedium
Count Beautiful Substrings IIHard
Minimize Length of Array Using OperationsMedium
Most Frequent PrimereadMedium
Maximum Prime DifferenceMedium
Page 1 of 2