Practice problems across 75+ categories
Practice problems frequently asked at Number Theory • 76 problems | 11 Easy | 33 Medium | 32 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 46 | Minimum Number of Operations to Make All Array Elements Equal to 1 | Medium | ArrayMathNumber Theory |
| 47 | Minimum Split Into Subarrays With GCD Greater Than One | Medium | ArrayMathDynamic Programming |
| 48 | Minimum Subarrays in a Valid Split | Medium | ArrayMathDynamic Programming |
| 49 | Mirror Reflection | Medium | MathGeometryNumber Theory |
| 50 | Most Expensive Item That Can Not Be Bought | Medium | MathDynamic ProgrammingNumber Theory |
| 51 | Most Frequent Prime | Medium | ArrayHash TableMath |
| 52 | Number of Beautiful Pairs | Easy | ArrayHash TableMath |
| 53 | Number of Common Factors | Easy | MathEnumerationNumber Theory |
| 54 | Number of Different Subsequences GCDs | Hard | ArrayMathCounting |
| 55 | Number of Pairs of Interchangeable Rectangles | Medium | ArrayHash TableMath |
| 56 | Number of Self-Divisible Permutations | Medium | ArrayMathDynamic Programming |
| 57 | Number of Subarrays With GCD Equal to K | Medium | ArrayMathNumber Theory |
| 58 | Number of Subarrays With LCM Equal to K | Medium | ArrayMathNumber Theory |
| 59 | Prime In Diagonal | Easy | ArrayMathMatrix |
| 60 | Prime Pairs With Target Sum | Medium | ArrayMathEnumeration |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
