Number Theory Interview Questions
76 real interview questions test Number Theory. Practice any of them in the code editor and get AI feedback on your solution.
- Junior13% (10)
- Mid/Senior43% (33)
- Staff43% (33)
Companies that ask Number Theory the most
Questions
- Count Primes17 companiesMid/Senior
- Add Digits10 companiesJunior
- The kth Factor of n8 companiesMid/Senior
- Closest Prime Numbers in Range6 companiesMid/Senior
- Find Greatest Common Divisor of Array5 companiesJunior
- Replace Non-Coprime Numbers in Array5 companiesStaff
- Find Triangular Sum of an Array5 companiesMid/Senior
- Insert Greatest Common Divisors in Linked List5 companiesMid/Senior
- Check If It Is a Good Array4 companiesStaff
- Count the Number of Ideal Arrays4 companiesStaff
- Prime Subtraction Operation4 companiesMid/Senior
- Minimize Length of Array Using Operations4 companiesMid/Senior
- Check If Digits Are Equal in String After Operations I4 companiesJunior
- Minimum Jumps to Reach End via Prime Teleportation4 companiesMid/Senior
- Mirror Reflection3 companiesMid/Senior
- Prime Palindrome3 companiesMid/Senior
- Ugly Number III3 companiesMid/Senior
- Minimum Deletions to Make Array Divisible3 companiesStaff
- Smallest Even Multiple3 companiesJunior
- Number of Common Factors3 companiesJunior
- Number of Subarrays With LCM Equal to K3 companiesMid/Senior
- Distinct Prime Factors of Product of Array3 companiesMid/Senior
- Smallest Divisible Digit Product II3 companiesStaff
- GCD of Odd and Even Sums3 companiesJunior
- Sum of Perfect Square Ancestors3 companiesStaff
- X of a Kind in a Deck of Cards2 companiesJunior
- Largest Component Size by Common Factor2 companiesStaff
- Number of Different Subsequences GCDs2 companiesStaff
- Three Divisors2 companiesJunior
- The Number of Good Subsets2 companiesStaff
- Count Array Pairs Divisible by K2 companiesStaff
- Count the Number of Square-Free Subsets2 companiesMid/Senior
- Make K-Subarray Sums Equal2 companiesMid/Senior
- Minimum Number of Operations to Make All Array Elements Equal to 12 companiesMid/Senior
- Apply Operations to Maximize Score2 companiesStaff
- Find the Largest Palindrome Divisible by K2 companiesStaff
- Minimum Division Operations to Make Array Non Decreasing2 companiesMid/Senior
- Find the Number of Subsequences With Equal GCD2 companiesStaff
- Check If Digits Are Equal in String After Operations II2 companiesStaff
- Balanced K-Factor Decomposition2 companiesMid/Senior
- Sum of Beautiful Subsequences2 companiesStaff
- Largest Prime from Consecutive Prime Sum2 companiesMid/Senior
- Count Sequences to K2 companiesStaff
- Simplified Fractions1 companyMid/Senior
- Graph Connectivity With Threshold1 companyStaff
- Count Ways to Make Array With Product1 companyStaff
- Tree of Coprimes1 companyStaff
- Maximize Score After N Operations1 companyStaff
- Maximize Number of Nice Divisors1 companyStaff
- GCD Sort of an Array1 companyStaff
- Number of Pairs of Interchangeable Rectangles1 companyMid/Senior
- Abbreviating the Product of a Range1 companyStaff
- Minimum Lines to Represent a Line Chart1 companyMid/Senior
- Minimize the Maximum of Two Arrays1 companyMid/Senior
- Check if Point Is Reachable1 companyStaff
- Split the Array to Make Coprime Products1 companyStaff
- Prime In Diagonal1 companyJunior
- Maximum Element-Sum of a Complete Subset of Indices1 companyStaff
- Count Valid Paths in a Tree1 companyStaff
- Count Beautiful Substrings I1 companyMid/Senior
- Count Beautiful Substrings II1 companyStaff
- Most Frequent Prime1 companyMid/Senior
- Maximum Prime Difference1 companyMid/Senior
- Sorted GCD Pair Queries1 companyStaff
- Find the Maximum Factor Score of Array1 companyMid/Senior
- Digit Operations to Make Two Integers Equal1 companyMid/Senior
- Maximum Subarray With Equal Products1 companyJunior
- Sum of Largest Prime Substrings1 companyMid/Senior
- Maximize Count of Distinct Primes After Split1 companyStaff
- Maximize Subarray GCD Score1 companyStaff
- Count Prime-Gap Balanced Subarrays1 companyMid/Senior
- Minimum Stability Factor of Array1 companyStaff
- Sum of GCD of Formed Pairs1 companyMid/Senior
- Minimum Operations to Transform Array into Alternating Prime1 companyMid/Senior
- Good Subsequence Queries1 companyStaff
- Minimize Array Sum Using Divisible Replacements1 companyMid/Senior