Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
Interview Questions›Topics›Number Theory

Number Theory Interview Questions

Master 71 number theory problems frequently asked in technical interviews. These questions test your understanding of number theoryconcepts and are essential for coding interview success.

71
Total Problems
10
Easy
34
Medium
27
Hard

Related Topics

MathArrayGreatest Common DivisorEuclidean AlgorithmHash TableDynamic ProgrammingGreedyCounting
#3608HardFrequency: 76.9%

Find the Number of Subsequences With Equal GCD

Asked at Infosys
ArrayMathDynamic ProgrammingNumber TheoryEuclidean AlgorithmGreatest Common Divisor
#1
Rank
#2301HardFrequency: 73.2%

Count Array Pairs Divisible by K

Asked at PayPal
ArrayHash TableMathCountingNumber TheoryEuclidean AlgorithmGreatest Common Divisor
#2
Rank
#2415HardFrequency: 67.6%

Count the Number of Ideal Arrays

Asked at Infosys
MathDynamic ProgrammingCombinatoricsNumber TheoryPrime FactorizationFermat's Little Theorem
#3
Rank
#4215HardFrequency: 67.6%

Good Subsequence Queries

Asked at Infosys
ArrayMathSegment TreeNumber Theory
#4
Rank
#3989HardFrequency: 62.5%

Sum of Beautiful Subsequences

Asked at Infosys
ArrayMathBinary Indexed TreeNumber Theory
#5
Rank
#3294MediumFrequency: 55.1%

Number of Self-Divisible Permutations

Asked at Salesforce
ArrayMathDynamic ProgrammingBacktrackingBit ManipulationNumber TheoryBitmask
#6
Rank
#2610MediumFrequency: 54.4%

Closest Prime Numbers in Range

Asked at TikTok
MathNumber TheoryPrimality TestSieve TheoryPrime Number Sieve
#7
Rank
#3244MediumFrequency: 53.4%

Minimize Length of Array Using Operations

Asked at Oracle
ArrayMathGreedyNumber Theory
#8
Rank
#204MediumFrequency: 47.3%

Count Primes

Asked at Microsoft
ArrayMathEnumerationNumber TheoryPrimality TestSieve TheoryPrime Number Sieve
#9
Rank
#2423HardFrequency: 44.7%

Minimum Deletions to Make Array Divisible

Asked at LinkedIn
ArrayMathSortingHeap (Priority Queue)Number TheoryEuclidean AlgorithmGreatest Common Divisor
#10
Rank
#4065HardFrequency: 44.7%

Count Sequences to K

Asked at LinkedIn
ArrayMathDynamic ProgrammingMemoizationNumber Theory
#11
Rank
#1585MediumFrequency: 43.6%

The kth Factor of n

Asked at Amazon
MathNumber TheoryPrime Factorization
#12
Rank
#258EasyFrequency: 43.3%

Add Digits

Asked at Microsoft
MathSimulationNumber Theory
#13
Rank
#2324MediumFrequency: 40.8%

Find Triangular Sum of an Array

Asked at Amazon
ArrayMathSimulationCombinatoricsNumber Theory
#14
Rank
#3949MediumFrequency: 35.1%

Minimum Number of Primes to Sum to Target

Asked at Amazon
ArrayMathDynamic ProgrammingNumber Theory
#15
Rank
#2307HardFrequency: 33.5%

Replace Non-Coprime Numbers in Array

Asked at Uber
ArrayMathStackNumber TheoryLeast Common MultipleGreatest Common Divisor
#16
Rank
#3273MediumFrequency: 33.3%

Most Expensive Item That Can Not Be Bought

Asked at Amazon
MathDynamic ProgrammingNumber Theory
#17
Rank
#3655MediumFrequency: 32.8%

Digit Operations to Make Two Integers Equal

Asked at Microsoft
MathGraph TheoryHeap (Priority Queue)Number TheoryShortest Path
#18
Rank
#1947HardFrequency: 31.3%

Number of Different Subsequences GCDs

Asked at Infosys
ArrayMathCountingNumber TheoryEuclidean AlgorithmGreatest Common Divisor
#19
Rank
#4242MediumFrequency: 29.1%

Sum of GCD of Formed Pairs

Asked at Amazon
ArrayMathTwo PointersSortingSimulationNumber Theory
#20
Rank
#1223HardFrequency: 27.8%

Graph Connectivity With Threshold

Asked at Uber
ArrayMathUnion-FindNumber Theory
#21
Rank
#3933MediumFrequency: 27.8%

Minimum Jumps to Reach End via Prime Teleportation

Asked at Uber
ArrayHash TableMathBreadth-First SearchNumber Theory
#22
Rank
#1936HardFrequency: 27.3%

Maximize Number of Nice Divisors

Asked at Microsoft
MathRecursionNumber Theory
#23
Rank
#2083EasyFrequency: 27.3%

Three Divisors

Asked at Microsoft
MathEnumerationNumber TheoryPrime FactorizationSieve Theory
#24
Rank
#2125HardFrequency: 26.5%

GCD Sort of an Array

Asked at Amazon
ArrayMathUnion-FindSortingNumber TheoryPrime FactorizationEuclidean AlgorithmGreatest Common Divisor
#25
Rank
#3768EasyFrequency: 26.5%

Check If Digits Are Equal in String After Operations I

Asked at Amazon
MathStringSimulationCombinatoricsNumber Theory
#26
Rank
#950EasyFrequency: 24.4%

X of a Kind in a Deck of Cards

Asked at Google
ArrayHash TableMathCountingNumber TheoryEuclidean AlgorithmGreatest Common Divisor
#27
Rank
#3210MediumFrequency: 23.6%

Count Beautiful Substrings I

Asked at Amazon
Hash TableMathStringEnumerationNumber TheoryPrefix Sum
#28
Rank
#3920HardFrequency: 23.6%

Minimum Stability Factor of Array

Asked at Amazon
ArrayMathBinary SearchGreedySegment TreeNumber Theory
#29
Rank
#4301MediumFrequency: 23.6%

Minimize Array Sum Using Divisible Replacements

Asked at Amazon
ArrayHash TableMathGreedyNumber Theory
#30
Rank
#989HardFrequency: 22.1%

Largest Component Size by Common Factor

Asked at Google
ArrayHash TableMathUnion-FindNumber TheoryPrime Factorization
#31
Rank
#3888HardFrequency: 20.9%

Maximize Subarray GCD Score

Asked at Google
ArrayMathEnumerationNumber Theory
#32
Rank
#897MediumFrequency: 20.3%

Prime Palindrome

Asked at Uber
MathNumber TheoryPrimality Test
#33
Rank
#1836HardFrequency: 20%

Count Ways to Make Array With Product

Asked at Amazon
ArrayMathDynamic ProgrammingCombinatoricsNumber TheoryPrime FactorizationFermat's Little Theorem
#34
Rank
#3208HardFrequency: 20%

Count Beautiful Substrings II

Asked at Amazon
Hash TableMathStringNumber TheoryPrefix Sum
#35
Rank
#2716MediumFrequency: 19.5%

Prime Subtraction Operation

Asked at Google
ArrayMathBinary SearchGreedyNumber Theory
#36
Rank
#1543MediumFrequency: 18%

Simplified Fractions

Asked at Google
MathStringNumber TheoryEuclidean AlgorithmGreatest Common Divisor
#37
Rank
#1728HardFrequency: 18%

Fancy Sequence

Asked at Google
MathDesignSegment TreeNumber TheoryFermat's Little Theorem
#38
Rank
#2491EasyFrequency: 18%

Smallest Even Multiple

Asked at Amazon
MathNumber Theory
#39
Rank
#1875HardFrequency: 16.4%

Tree of Coprimes

Asked at Google
ArrayMathTreeDepth-First SearchNumber Theory
#40
Rank
#2367MediumFrequency: 16.4%

Minimum Lines to Represent a Line Chart

Asked at Google
ArrayMathGeometrySortingNumber Theory
#41
Rank
#3314MediumFrequency: 16.4%

Most Frequent Prime

Asked at Google
ArrayHash TableMathMatrixCountingEnumerationNumber TheoryPrimality TestSieve TheoryPrime Number Sieve
#42
Rank
#2507EasyFrequency: 16.4%

Number of Common Factors

Asked at Google
MathEnumerationNumber TheoryEuclidean AlgorithmGreatest Common Divisor
#43
Rank
#3583HardFrequency: 16.4%

Sorted GCD Pair Queries

Asked at Google
ArrayHash TableMathBinary SearchCombinatoricsCountingNumber TheoryPrefix SumEuclidean AlgorithmGreatest Common Divisor
#44
Rank
#2753MediumFrequency: 16.4%

Minimum Number of Operations to Make All Array Elements Equal to 1

Asked at Google
ArrayMathNumber TheoryEuclidean AlgorithmGreatest Common Divisor
#45
Rank
#4085MediumFrequency: 16.4%

Largest Prime from Consecutive Prime Sum

Asked at Google
ArrayMathNumber Theory
#46
Rank
#3995EasyFrequency: 16.4%

GCD of Odd and Even Sums

Asked at Google
MathNumber Theory
#47
Rank
#2106EasyFrequency: 14.6%

Find Greatest Common Divisor of Array

Asked at Google
ArrayMathNumber TheoryEuclidean AlgorithmGreatest Common Divisor
#48
Rank
#2709MediumFrequency: 14.6%

Count the Number of Square-Free Subsets

Asked at Google
ArrayMathDynamic ProgrammingBit ManipulationNumber TheoryBitmask
#49
Rank
#3635HardFrequency: 12.6%

Smallest Divisible Digit Product II

Asked at Google
MathStringBacktrackingGreedyNumber Theory
#50
Rank
#2903MediumFrequency: 12%

Insert Greatest Common Divisors in Linked List

Asked at Microsoft
Linked ListMathNumber Theory
#51
Rank
#3001HardFrequency: 10.5%

Apply Operations to Maximize Score

Asked at Google
ArrayMathStackGreedySortingMonotonic StackNumber Theory
#52
Rank
#888MediumFrequency: 10.3%

Mirror Reflection

Asked at Amazon
MathGeometryNumber TheoryLeast Common MultipleGreatest Common Divisor
#53
Rank
#2129MediumFrequency: 10.3%

Number of Pairs of Interchangeable Rectangles

Asked at Amazon
ArrayHash TableMathCountingNumber Theory
#54
Rank
#1372HardFrequency: 8.1%

Check If It Is a Good Array

Asked at Google
ArrayMathNumber TheoryBézout's LemmaEuclidean AlgorithmGreatest Common DivisorExtended Euclidean Algorithm
#55
Rank
#3702EasyFrequency: 8.1%

Maximum Subarray With Equal Products

Asked at Google
ArrayMathSliding WindowEnumerationNumber Theory
#56
Rank
#3507MediumFrequency: 7.3%

Find the Count of Numbers Which Are Not Special

Asked at Microsoft
ArrayMathNumber Theory
#57
Rank
#1307MediumFrequency: 7.2%

Ugly Number III

Asked at Amazon
MathBinary SearchCombinatoricsNumber TheoryLeast Common MultipleEuclidean AlgorithmGreatest Common DivisorInclusion-Exclusion Principle
#58
Rank
#4277MediumFrequency: 5.5%

Minimum Operations to Transform Array into Alternating Prime

Asked at Google
ArrayMathTwo PointersBinary SearchSortingNumber Theory
#59
Rank
#3552HardFrequency: 5%

Find the Largest Palindrome Divisible by K

Asked at Google
MathStringDynamic ProgrammingGreedyNumber Theory
#60
Rank
#2609MediumFrequency: 5%

Distinct Prime Factors of Product of Array

Asked at Google
ArrayHash TableMathNumber TheoryPrime FactorizationEuclidean AlgorithmPrimality TestGreatest Common DivisorSieve TheoryPrime Number Sieve
#61
Rank
#3607MediumFrequency: 5%

Minimum Division Operations to Make Array Non Decreasing

Asked at Google
ArrayMathGreedyNumber Theory
#62
Rank
#2722EasyFrequency: 5%

Prime In Diagonal

Asked at Google
ArrayMathMatrixNumber Theory
#63
Rank
#3907MediumFrequency: 5%

Count Prime-Gap Balanced Subarrays

Asked at Google
ArrayMathQueueSliding WindowNumber TheoryMonotonic Queue
#64
Rank
#3774HardFrequency: 5%

Check If Digits Are Equal in String After Operations II

Asked at Google
MathStringCombinatoricsNumber Theory
#65
Rank
#3947MediumFrequency: 5%

Balanced K-Factor Decomposition

Asked at Google
MathBacktrackingNumber Theory
#66
Rank
#3957HardFrequency: 5%

Sum of Perfect Square Ancestors

Asked at Google
ArrayHash TableMathTreeDepth-First SearchCountingNumber Theory
#67
Rank
#2557MediumFrequency: 5%

Number of Subarrays With LCM Equal to K

Asked at Google
ArrayMathNumber Theory
#68
Rank
#3878HardFrequency: 5%

Maximize Count of Distinct Primes After Split

Asked at Google
ArrayHash TableMathSegment TreeNumber TheoryOrdered Set
#69
Rank
#2628MediumFrequency: 5%

Minimize the Maximum of Two Arrays

Asked at Amazon
MathBinary SearchNumber TheoryLeast Common MultipleInclusion-Exclusion Principle
#70
Rank
#2670MediumFrequency: 5%

Make K-Subarray Sums Equal

Asked at Amazon
ArrayMathGreedySortingNumber Theory
#71
Rank
View All Topics

Master Number Theory in Real Interviews

Get AI-powered assistance when solving number theory problems during your actual interviews.

Get Started Free

No credit card required

Interview Solver
  • Home
  • About
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Developers
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Refund & Cancellation
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.