Topic: mathematics-problem / Level: intermediate

• 1951. Create a program to check if two strings are anagrams.
• 1952. Write a program to find the GCD of three numbers using the Euclidean algorithm.
• 1953. Implement a function to find the maximum product of any two integers in an array.
• 1954. Create a program to compute the sum of squares of digits in a number.
• 1955. Write a program to check if a number is a palindromic prime.
• 1956. Implement a function to calculate the area of a triangle using Herons formula.
• 1957. Create a program to determine if two numbers are coprime.
• 1958. Write a program to find the longest palindromic substring in a string.
• 1959. Implement a function to find the sum of the digits of a number.
• 1960. Create a program to check if a number can be expressed as a sum of two squares.
• 1961. Write a program to compute the sum of the first n triangular numbers.
• 1962. Implement a function to calculate the maximum product of three integers in an array.
• 1963. Create a program to find the area of a polygon given its vertices.
• 1964. Write a program to check if a number is a Keith number.
• 1965. Implement a function to find the GCD of two fractions.
• 1966. Create a program to calculate the sum of all odd numbers in an array.
• 1967. Write a program to compute the number of perfect squares less than a given number.
• 1968. Implement a function to check if a number is a strong composite number.
• 1969. Create a program to determine if a number is a Fibonacci number.
• 1970. Write a program to check if a number is a strong prime.
• 1971. Implement a function to calculate the average of prime numbers in a list.
• 1972. Create a program to find the maximum sum of a contiguous subarray of size k.
• 1973. Write a program to check if two strings are anagrams.
• 1974. Implement a function to compute the sum of the digits of a number until it is a single digit.
• 1975. Create a program to find the GCD of three numbers.
• 1976. Write a program to calculate the area of a triangle using base and height.
• 1977. Implement a function to find the maximum product of any two integers in an array.
• 1978. Create a program to compute the sum of the first n even numbers.
• 1979. Write a program to check if a number is a palindromic prime.
• 1980. Implement a function to check if a number is a strong composite number.
• 1981. Create a program to determine if a number can be expressed as a sum of two squares.
• 1982. Write a program to find the longest increasing subsequence in an array.
• 1983. Implement a function to calculate the average of odd numbers in a list.
• 1984. Create a program to find the area of a rectangle given its dimensions.
• 1985. Write a program to compute the maximum product of any two integers in an array.
• 1986. Implement a function to find the sum of the digits of a number.
• 1987. Create a program to check if two strings are anagrams.
• 1988. Write a program to compute the sum of cubes of the first n natural numbers.
• 1989. Implement a function to find the GCD of two fractions.
• 1990. Create a program to calculate the area of a triangle given its height and base.
• 1991. Write a program to check if a number is a Keith number.
• 1992. Implement a function to find the maximum product of three integers in an array.
• 1993. Create a program to determine if a number is a perfect number using its divisors.
• 1994. Write a program to compute the sum of the digits of a number until it is a single digit.
• 1995. Implement a function to calculate the GCD of two numbers using recursion.
• 1996. Create a program to check if a number is a strong prime.
• 1997. Write a program to compute the average of prime numbers in a list.
• 1998. Implement a function to check if a number can be expressed as a sum of two squares.
• 1999. Create a program to find the sum of the first n odd numbers using recursion.
• 2000. Write a program to calculate the sum of the first n triangular numbers.

• More Levels

• Beginner
• Advanced