Tag: number-theory
- Add Digits
- Apply Operations to Maximize Score
- Check If Digits Are Equal in String After Operations I
- Check If Digits Are Equal in String After Operations II
- Check If It Is a Good Array
- Check if Point Is Reachable
- Closest Prime Numbers in Range
- Count Array Pairs Divisible by K
- Count Beautiful Substrings I
- Count Beautiful Substrings II
- Count Connected Components in LCM Graph
- Count Primes
- Count the Number of Ideal Arrays
- Count Valid Paths in a Tree
- Count Ways to Make Array With Product
- Digit Operations to Make Two Integers Equal
- Distinct Prime Factors of Product of Array
- Find Greatest Common Divisor of Array
- Find the Count of Numbers Which Are Not Special
- Find the Largest Palindrome Divisible by K
- Find the Maximum Factor Score of Array
- Find the Number of Subsequences With Equal GCD
- GCD Sort of an Array
- Graph Connectivity With Threshold
- Greatest Common Divisor Traversal
- Insert Greatest Common Divisors in Linked List
- Kth Smallest Amount With Single Denomination Combination
- Largest Component Size by Common Factor
- Make K-Subarray Sums Equal
- Maximize Number of Nice Divisors
- Maximize Score After N Operations
- Maximum Element-Sum of a Complete Subset of Indices
- Maximum GCD-Sum of a Subarray
- Maximum Prime Difference
- Maximum Subarray With Equal Products
- Minimize Length of Array Using Operations
- Minimize the Maximum of Two Arrays
- Minimum Deletions to Make Array Divisible
- Minimum Division Operations to Make Array Non Decreasing
- Minimum Increments for Target Multiples in an Array
- Minimum Lines to Represent a Line Chart
- Minimum Number of Operations to Make All Array Elements Equal to 1
- Minimum Split Into Subarrays With GCD Greater Than One
- Minimum Subarrays in a Valid Split
- Mirror Reflection
- Most Expensive Item That Can Not Be Bought
- Most Frequent Prime
- Number of Beautiful Pairs
- Number of Common Factors
- Number of Different Subsequences GCDs
- Number of Pairs of Interchangeable Rectangles
- Number of Subarrays With GCD Equal to K
- Number of Subarrays With LCM Equal to K
- Prime In Diagonal
- Prime Pairs With Target Sum
- Prime Palindrome
- Prime Subtraction Operation
- Replace Non-Coprime Numbers in Array
- Simplified Fractions
- Smallest Divisible Digit Product II
- Smallest Even Multiple
- Smallest Value After Replacing With Sum of Prime Factors
- Sorted GCD Pair Queries
- Split the Array to Make Coprime Products
- The kth Factor of n
- Three Divisors
- Tree of Coprimes
- Ugly Number III
- X of a Kind in a Deck of Cards