Topic Difficulty
Hard Number Theory OA Questions
Practice 21+ hard Number Theory coding questions from real online assessments. Filter by company, solve in the OAHelper editor, and prepare for company-wise OAs.
Ordered Unit Fraction Pairs Summing To One Over N Factorialpoint72HardMosaic Band With an Exact Pattern PeriodmeltwaterHardMaximum Student Pairings After K ChangesmathworksHardWays to Reach Each Target Powernk securitiesHardPrime PairssprinklrHardRandom Divisor Reduction StepstrilogyHardState of the Art Paint CombinationsoptumHardEqualizing Packet Bins for a Uniform Splitde shawHardK-th Smallest Shipment AmounttekionHardCoprime Split of an ArraygoogleHardMeridian Station Stamped ManifestsadobeHardAncient Library — Longest Perfect-Square Artifact SequenceadobeHardAlternating Boosts to Level the TowersaristaHardCo-prime Subtree AnalysisuberHardNumber of Prime PartitionsthoughtworksHardFactor Lower BoundinfoedgeHardSerial Numbers with Digit Sum Condition S(k·n)=k·S(n)amazonHardHackerland Prime Index AllocationlinkedinHardPrime Jump Navigationindusind bankHardLexicographically Minimal Array Segment ProductinfosysHardSalesforce Record BalancingsalesforceHardUber Zone ClustersuberHard2. Count Good PathshandsonHardPrime Jump NavigationcoinswitchHardThe Order of DivisorswalmartHardFamily DinnerinnovacerHardAlchemist's ArrayinmobiHardResource Allocation ChallengerubrikHardHelp Your Master 2medianetHardMorty's Galactic AdventurerubrikHardDonationkotakHardDonationkotakHardConnected componentshilabsHardNumbers and cardsdevrevHardDivisor powertrimbleHardOmega Prime SubsetsmedianetHardInfection SequencesoracleHardMinimum Delivery TimeamazonHardLock CodetypefaceHardDecrypt Code LockubsHardDecrypt Code LockpaypalHardTrinity Shot ProblemphonepeHardMaximum Sum of Good SubarrayinfosysHardSum of Beauty of Increasing SubsequencesinfosysHardCover Them AlloracleHardLICPSexperianHardBinary Search Failure ProbabilitytrilogyHardHelp Your Master 2medianetHardMatrix Pass-codemedianetHardAvengers - The secret Path of PrimesphonepeHard