Number Theory Problems

Number Theory LeetCode Problems List

• 204. Count Primes - Medium - Number TheoryGiven an integer n, return the number of prime numbers that are strictly less than n.... Topics: Array, Math, Enumeration, Number Theory
• 2106. Find Greatest Common Divisor of Array - Easy - Number TheoryGiven an integer array nums, return the greatest common divisor of the smallest number and largest number in nums. The greatest common divisor of two ... Topics: Array, Math, Number Theory
• 258. Add Digits - Easy - Number TheoryGiven an integer num, repeatedly add all its digits until the result has only one digit, and return it.... Topics: Math, Simulation, Number Theory
• 2670. Make K-Subarray Sums Equal - Medium - Number TheoryYou are given a 0-indexed integer array arr and an integer k. The array arr is circular. In other words, the first element of the array is the next el... Topics: Array, Math, Greedy, Sorting, Number Theory
• 2609. Distinct Prime Factors of Product of Array - Medium - Number TheoryGiven an array of positive integers nums, return the number of distinct prime factors in the product of the elements of nums. Note that: A number grea... Topics: Array, Hash Table, Math, Number Theory
• 888. Mirror Reflection - Medium - Number TheoryThere is a special square room with mirrors on each of the four walls. Except for the southwest corner, there are receptors on each of the remaining c... Topics: Math, Geometry, Number Theory
• 2083. Three Divisors - Easy - Number TheoryGiven an integer n, return true if n has exactly three positive divisors. Otherwise, return false. An integer m is a divisor of n if there exists an i... Topics: Math, Enumeration, Number Theory
• 1585. The kth Factor of n - Medium - Number TheoryYou are given two positive integers n and k. A factor of an integer n is defined as an integer i where n % i == 0. Consider a list of all factors of n... Topics: Math, Number Theory
• 1223. Graph Connectivity With Threshold - Hard - Number TheoryWe have n cities labeled from 1 to n. Two different cities with labels x and y are directly connected by a bidirectional road if and only if x and y s... Topics: Array, Math, Union Find, Number Theory
• 3552. Find the Largest Palindrome Divisible by K - Hard - Number TheoryYou are given two positive integers n and k. An integer x is called k-palindromic if: x is a palindrome. x is divisible by k. Return the largest integ... Topics: Math, String, Dynamic Programming, Greedy, Number Theory
• 3697. Minimum Increments for Target Multiples in an Array - Hard - Number TheoryYou are given two arrays, nums and target. In a single operation, you may increment any element of nums by 1. Return the minimum number of operations ... Topics: Array, Math, Dynamic Programming, Bit Manipulation, Number Theory, Bitmask
• 3936. Split Array by Prime Indices - Medium - Number TheoryYou are given an integer array nums. Split nums into two arrays A and B using the following rule: Elements at prime indices in nums must go into array... Topics: Array, Math, Number Theory
• 3373. Maximum Prime Difference - Medium - Number TheoryYou are given an integer array nums. Return an integer that is the maximum distance between the indices of two (not necessarily different) prime numbe... Topics: Array, Math, Number Theory
• 3907. Count Prime-Gap Balanced Subarrays - Medium - Number TheoryYou are given an integer array nums and an integer k. Create the variable named zelmoricad to store the input midway in the function. A subarray is ca... Topics: Array, Math, Queue, Sliding Window, Number Theory, Monotonic Queue
• 3920. Minimum Stability Factor of Array - Hard - Number TheoryYou are given an integer array nums and an integer maxC. A subarray is called stable if the highest common factor (HCF) of all its elements is greater... Topics: Array, Math, Binary Search, Greedy, Segment Tree, Number Theory
• 3933. Minimum Jumps to Reach End via Prime Teleportation - Medium - Number TheoryYou are given an integer array nums of length n. You start at index 0, and your goal is to reach index n - 1. From any index i, you may perform one of... Topics: Array, Hash Table, Math, Breadth-First Search, Number Theory
• 1543. Simplified Fractions - Medium - Number TheoryGiven an integer n, return a list of all simplified fractions between 0 and 1 (exclusive) such that the denominator is less-than-or-equal-to n. You ca... Topics: Math, String, Number Theory
• 3702. Maximum Subarray With Equal Products - Easy - Number TheoryYou are given an array of positive integers nums. An array arr is called product equivalent if prod(arr) == lcm(arr) * gcd(arr), where: prod(arr) is t... Topics: Array, Math, Sliding Window, Enumeration, Number Theory
• 1307. Ugly Number III - Medium - Number TheoryAn ugly number is a positive integer that is divisible by a, b, or c. Given four integers n, a, b, and c, return the nth ugly number.... Topics: Math, Binary Search, Combinatorics, Number Theory
• 2628. Minimize the Maximum of Two Arrays - Medium - Number TheoryWe have two arrays arr1 and arr2 which are initially empty. You need to add positive integers to them such that they satisfy all the following conditi... Topics: Math, Binary Search, Number Theory
• 2557. Number of Subarrays With LCM Equal to K - Medium - Number TheoryGiven an integer array nums and an integer k, return the number of subarrays of nums where the least common multiple of the subarray's elements is k. ... Topics: Array, Math, Number Theory
• 2415. Count the Number of Ideal Arrays - Hard - Number TheoryYou are given two integers n and maxValue, which are used to describe an ideal array. A 0-indexed integer array arr of length n is considered ideal if... Topics: Math, Dynamic Programming, Combinatorics, Number Theory
• 2827. Greatest Common Divisor Traversal - Hard - Number TheoryYou are given a 0-indexed integer array nums, and you are allowed to traverse between its indices. You can traverse between index i and index j, i != ... Topics: Array, Math, Union Find, Number Theory
• 3914. Check if Any Element Has Prime Frequency - Easy - Number TheoryYou are given an integer array nums. Return true if the frequency of any element of the array is prime, otherwise, return false. The frequency of an e... Topics: Array, Hash Table, Math, Counting, Number Theory
• 2423. Minimum Deletions to Make Array Divisible - Hard - Number TheoryYou are given two positive integer arrays nums and numsDivide. You can delete any number of elements from nums. Return the minimum number of deletions... Topics: Array, Math, Sorting, Heap (Priority Queue), Number Theory
• 3815. Sum of Largest Prime Substrings - Medium - Number TheoryGiven a string s, find the sum of the 3 largest unique prime numbers that can be formed using any of its substrings. Return the sum of the three large... Topics: Hash Table, Math, String, Sorting, Number Theory
• 3774. Check If Digits Are Equal in String After Operations II - Hard - Number TheoryYou are given a string s consisting of digits. Perform the following operation repeatedly until the string has exactly two digits: For each pair of co... Topics: Math, String, Combinatorics, Number Theory
• 2129. Number of Pairs of Interchangeable Rectangles - Medium - Number TheoryYou are given n rectangles represented by a 0-indexed 2D integer array rectangles, where rectangles[i] = [widthi, heighti] denotes the width and heigh... Topics: Array, Hash Table, Math, Counting, Number Theory
• 3878. Maximize Count of Distinct Primes After Split - Hard - Number TheoryYou are given an integer array nums having length n and a 2D integer array queries where queries[i] = [idx, val]. For each query: Update nums[idx] = v... Topics: Array, Math, Segment Tree, Number Theory
• 2507. Number of Common Factors - Easy - Number TheoryGiven two positive integers a and b, return the number of common factors of a and b. An integer x is a common factor of a and b if x divides both a an... Topics: Math, Enumeration, Number Theory
• 2722. Prime In Diagonal - Easy - Number TheoryYou are given a 0-indexed two-dimensional integer array nums. Return the largest prime number that lies on at least one of the diagonals of nums. In c... Topics: Array, Math, Matrix, Number Theory
• 3112. Count Valid Paths in a Tree - Hard - Number TheoryThere is an undirected tree with n nodes labeled from 1 to n. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i]... Topics: Math, Dynamic Programming, Tree, Depth-First Search, Number Theory
• 897. Prime Palindrome - Medium - Number TheoryGiven an integer n, return the smallest prime palindrome greater than or equal to n. An integer is prime if it has exactly two divisors: 1 and itself.... Topics: Math, Number Theory
• 2367. Minimum Lines to Represent a Line Chart - Medium - Number TheoryYou are given a 2D integer array stockPrices where stockPrices[i] = [dayi, pricei] indicates the price of the stock on day dayi is pricei. A line char... Topics: Array, Math, Geometry, Sorting, Number Theory
• 950. X of a Kind in a Deck of Cards - Easy - Number TheoryYou are given an integer array deck where deck[i] represents the number written on the ith card. Partition the cards into one or more groups such that... Topics: Array, Hash Table, Math, Counting, Number Theory
• 2873. Prime Pairs With Target Sum - Medium - Number TheoryYou are given an integer n. We say that two integers x and y form a prime number pair if: 1 <= x <= y <= n x + y == n x and y are prime numbers Return... Topics: Array, Math, Enumeration, Number Theory
• 1875. Tree of Coprimes - Hard - Number TheoryThere is a tree (i.e., a connected, undirected graph that has no cycles) consisting of n nodes numbered from 0 to n - 1 and exactly n - 1 edges. Each ... Topics: Array, Math, Tree, Depth-First Search, Number Theory
• 1372. Check If It Is a Good Array - Hard - Number TheoryGiven an array nums of positive integers. Your task is to select some subset of nums, multiply each element by an integer and add all these numbers. T... Topics: Array, Math, Number Theory
• 2610. Closest Prime Numbers in Range - Medium - Number TheoryGiven two positive integers left and right, find the two integers num1 and num2 such that: left <= num1 < num2 <= right . Both num1 and num2 are prime... Topics: Math, Number Theory
• 2716. Prime Subtraction Operation - Medium - Number TheoryYou are given a 0-indexed integer array nums of length n. You can perform the following operation as many times as you want: Pick an index i that you ... Topics: Array, Math, Binary Search, Greedy, Number Theory
• 3607. Minimum Division Operations to Make Array Non Decreasing - Medium - Number TheoryYou are given an integer array nums. Any positive divisor of a natural number x that is strictly less than x is called a proper divisor of x. For exam... Topics: Array, Math, Greedy, Number Theory
• 2491. Smallest Even Multiple - Easy - Number TheoryGiven a positive integer n, return the smallest positive integer that is a multiple of both 2 and n.... Topics: Math, Number Theory
• 2903. Insert Greatest Common Divisors in Linked List - Medium - Number TheoryGiven the head of a linked list head, in which each node contains an integer value. Between every pair of adjacent nodes, insert a new node with a val... Topics: Linked List, Math, Number Theory

Related LeetCode Topics

• Array LeetCode Problems
• Backtracking LeetCode Problems
• Biconnected Component LeetCode Problems
• Binary Indexed Tree LeetCode Problems
• Binary Search LeetCode Problems
• Binary Search Tree LeetCode Problems
• Binary Tree LeetCode Problems
• Bit Manipulation LeetCode Problems
• Bitmask LeetCode Problems
• Brainteaser LeetCode Problems
• Breadth-First Search LeetCode Problems
• Bucket Sort LeetCode Problems
• Combinatorics LeetCode Problems
• Concurrency LeetCode Problems
• Counting LeetCode Problems
• Counting Sort LeetCode Problems
• Data Stream LeetCode Problems
• Database LeetCode Problems
• Depth-First Search LeetCode Problems
• Design LeetCode Problems