EdocGram
Home
(current)
Topics
EdocAI
Code Editor
HTML
Javascript
PHP
Python
Python AI Code Editor
More
Contact
About
Privacy Policy
Terms and Conditions
Log In
Topic
View
More
Topic
Hashing
Linked List
Queue
Stack
Backtracking
Dynamic Programming
Graph Theory
Bit Manipulation
Mathematics
Sliding Window Technique
Divide And Conquer
Matrix Manipulation
Two Pointers
Tree
Topic: mathematics-problem / Level: advanced
2001. Implement a program to find the maximum subarray sum using the Kadanes algorithm in a 2D array.
2002. Create a function to calculate the determinant of a matrix.
2003. Write a program to solve linear equations using matrix operations.
2004. Implement the Fast Fourier Transform (FFT) algorithm for polynomial multiplication.
2005. Create a program to compute the binomial coefficients using Pascals Triangle.
2006. Write a program to find the minimum spanning tree using Prims or Kruskals algorithm.
2007. Implement a function to find the shortest path in a weighted graph using Dijkstras algorithm.
2008. Create a program to compute the discrete logarithm of a number.
2009. Write a program to find all the prime factors of a number using Pollards rho algorithm.
2010. Implement a function to calculate the GCD of multiple numbers using the iterative approach.
2011. Create a program to generate all possible subsets of a given set.
2012. Write a program to find the greatest common divisor of two polynomials.
2013. Implement a function to find the k-th smallest element in an unsorted array using Quickselect.
2014. Create a program to determine the number of ways to make change for a given amount using dynamic programming.
2015. Write a program to calculate the number of unique paths in a grid with obstacles using dynamic programming.
2016. Implement a function to find the longest increasing subsequence using dynamic programming.
2017. Create a program to compute the maximum flow in a flow network using the Ford-Fulkerson method.
2018. Write a program to find the eigenvalues and eigenvectors of a matrix.
2019. Implement a function to calculate the modular exponentiation.
2020. Create a program to determine the convex hull of a set of points using the Graham scan algorithm.
2021. Write a program to implement the FFT for signal processing.
2022. Implement a function to compute the factorial of a large number using arrays or strings.
2023. Create a program to find the longest common subsequence of two strings using dynamic programming.
2024. Write a program to calculate the power set of a given set using recursion.
2025. Implement a function to check if a number is a prime using the Miller-Rabin primality test.
2026. Create a program to find the median of two sorted arrays.
2027. Write a program to solve the "0/1 Knapsack Problem" using dynamic programming.
2028. Implement a function to compute the area of a polygon given its vertices using the Shoelace formula.
2029. Create a program to check if a number is a Carmichael number.
2030. Write a program to find the smallest number that can be expressed as the sum of two cubes in two different ways.
2031. Implement a function to calculate the square root of a number using the Newton-Raphson method.
2032. Create a program to find the maximum area of a rectangle in a histogram.
2033. Write a program to compute the number of unique paths from the top-left to the bottom-right of a grid.
2034. Implement a function to generate the first n terms of the Fibonacci sequence using memoization.
2035. Create a program to find the intersection of two sets.
2036. Write a program to check if a matrix is symmetric.
2037. Implement a function to calculate the binomial expansion of (a + b)^n.
2038. Create a program to find the largest square submatrix of all 1s in a binary matrix.
2039. Write a program to find the sum of two numbers using the Russian Peasant algorithm.
2040. Implement a function to compute the Zeta function values at a given integer.
2041. Create a program to determine if a given string is a valid number.
2042. Write a program to calculate the expected value of a random variable.
2043. Implement a function to find the next lexicographical permutation of a sequence.
2044. Create a program to compute the inverse of a matrix using Gaussian elimination.
2045. Write a program to check if a number is a perfect number.
2046. Implement a function to find the maximum product of a contiguous subarray in a circular array.
2047. Create a program to compute the sum of all prime numbers below a given limit.
2048. Write a program to find the longest common prefix among an array of strings.
2049. Implement a function to find the number of trailing zeros in the factorial of a number.
2050. Create a program to compute the nth Catalan number.
Previous
1
2
...
20
Next
More Levels
Beginner
Intermediate
Aniket The Programmer
This website is managed by aniket the programmer :)
Website
Instagram