Topic: mathematics-problem / Level: intermediate

• 1001. Write a program to compute the least common multiple (LCM) of two numbers.
• 1002. Create a function to check if a given string is a valid mathematical expression.
• 1003. Implement an algorithm to calculate the square root of a number using the Newton-Raphson method.
• 1004. Write a program to solve a quadratic equation and find its roots.
• 1005. Implement a function to find the power of a number raised to another number using recursion.
• 1006. Create a program to calculate the sum of two matrices.
• 1007. Write a function to find the largest prime factor of a number.
• 1008. Implement a program to find the number of ways to reach the nth step in a staircase problem.
• 1009. Create a function to find the GCD of three numbers.
• 1010. Write a program to check if a number is a strong number.
• 1011. Implement a function to generate all permutations of a string.
• 1012. Create a program to find the mode of a set of numbers.
• 1013. Write a program to find the area of a trapezoid.
• 1014. Implement an algorithm to solve the "N-Queens Problem."
• 1015. Create a program to find the maximum product of three numbers in an array.
• 1016. Write a function to count the number of trailing zeroes in the factorial of a number.
• 1017. Implement a program to calculate the binomial coefficient.
• 1018. Create a function to determine if a number is a Fibonacci number.
• 1019. Write a program to implement the Sieve of Eratosthenes to find all prime numbers up to a given limit.
• 1020. Implement a function to calculate the sum of digits of a factorial of a number.
• 1021. Create a program to check if a number is a palindrome in binary representation.
• 1022. Write a program to find the roots of a cubic equation.
• 1023. Implement a program to calculate the number of trailing zeroes in a factorial.
• 1024. Create a function to calculate the area under a curve using numerical integration.
• 1025. Write a program to find the longest common subsequence between two strings.
• 1026. Implement an algorithm to solve the "Knapsack Problem."
• 1027. Create a function to calculate the nth triangular number.
• 1028. Write a program to compute the greatest common divisor (GCD) using the Euclidean algorithm.
• 1029. Implement a program to calculate the binary representation of a number.
• 1030. Create a function to find the smallest prime number greater than a given number.
• 1031. Write a program to calculate the sum of the digits of a number raised to a power.
• 1032. Implement a function to generate the first n triangular numbers.
• 1033. Create a program to find the intersection of two arrays.
• 1034. Write a program to calculate the number of unique paths in a grid.
• 1035. Implement a program to compute the sum of the first n odd prime numbers.
• 1036. Create a function to implement a basic calculator that supports addition, subtraction, multiplication, and division.
• 1037. Write a program to compute the nth Catalan number.
• 1038. Implement a function to generate all combinations of a given string.
• 1039. Create a program to check if two numbers are coprime.
• 1040. Write a program to calculate the sum of the digits of a number raised to its own power.
• 1041. Implement a function to find the smallest prime factor of a number.
• 1042. Create a program to find the number of distinct prime factors of a number.
• 1043. Write a program to calculate the GCD of an array of numbers.
• 1044. Implement a function to find the maximum product of two elements in an array.
• 1045. Create a program to compute the factorial of a number using dynamic programming.
• 1046. Write a program to determine if a number is a perfect square using binary search.
• 1047. Implement a function to find the area of a circle given its diameter.
• 1048. Create a program to check if a number can be expressed as the sum of two squares.
• 1049. Write a program to implement a basic linear regression model.
• 1050. Implement a function to calculate the number of digits in a factorial of a number.

• More Levels

• Beginner
• Advanced