Math for Programmers questions and answers
Number theory, combinatorics and computational geometry. Page 7 of 20.
Data Structures & Algorithms practice on Codemia
Step through 300 algorithm problems with animated visualisers that show the data structure changing as the code runs.
Answers 361-420
- Efficient Algorithm to obtain Points in a Circle around a Center
- Efficient Algorithms for Computing a matrix times its transpose
- Efficient calculation of Fibonacci series
- Efficient checking of whether a point is inside a large number of triangles in 2D
- Efficient combinations of N colored elements with restriction in the number of colors
- Efficient maths algorithm to calculate intersections
- Efficient method for finding KNN of all nodes in a KD-Tree
- Efficient method to get one number, which can''t be generated from any XORing combination
- Efficient minimal spanning tree in metric space
- Efficient Packing Algorithm for Regular Polygons
- Efficient way of calculating likeness scores of strings when sample size is large?
- Efficient way to compute geometric mean of many numbers
- Efficient way to find degrees of separation between two nodes in a graph
- Efficiently check if two numbers are co-primes relatively primes?
- Efficiently computing a - K / a K with improved accuracy
- Efficiently determine the parity of a permutation
- Efficiently finding the largest surrounding square in 2D grid
- Efficiently getting all divisors of a given number
- Efficiently summing log quantities
- Eigenvectors of a large sparse matrix in Tensorflow
- Elegant/Clean special case Straight-line Grid Traversal Algorithm?
- Empty set literal?
- Equation for testing if a point is inside a circle
- Estimating the digits occurrence probability inside a GUID
- Euler project 18 approach
- Evenly distributing n points on a sphere
- Evenly distributing n points on a sphere
- Expand a random range from 1–5 to 1–7
- Expectation Maximization coin toss examples
- Expectation Maximization coin toss examples
- Explain markov-chain algorithm in layman's terms
- Explain the implementation of Euler's Totient Implementation
- Expressing an integer as a series of multipliers
- Extend a line segment a specific distance
- Extending a line segment to fit into a bounding box
- Extremely fast method for modular exponentiation with modulus and exponent of several million digits
- Factorial Algorithms in different languages
- Factoring a number into roughly equal factors
- Fair division of a kingdom
- Fast accurate atan/arctan approximation algorithm
- Fast algorithm for polar - cartesian conversion
- Fast algorithm to find all points inside a rectangle
- Fast Algorithm to find number of primes between two numbers
- Fast algorithm to find the x closest points to a given point on a plane
- Fast algorithms for computing the factorial
- Fast calculation of floating 1/N if factorization of very large integer N is known
- Fast calculation of min, max, and average of incoming numbers
- Fast integer matrix multiplication with bit-twiddling hacks
- Fast Method for computing 3x3 symmetric matrix spectral decomposition
- Fast method to check if a Matrix is singular? non-invertible, det 0
- Fast modulo 3 or division algorithm?
- Fast n choose k mod p for large n?
- Fast permutation - number - permutation mapping algorithms
- Fast Prime Factorization Algorithm
- Fast prime factorization module
- Fast way to calculate n mod m where m is prime?
- Fast way to generate pseudo-random bits with a given probability of 0 or 1 for each bit
- Faster math algorithm sacrificing accuracy
- Faster weighted sampling without replacement
- Fastest algorithm for primality test
Course
Intermediate
27 lessons
15 hours
DSA Fundamentals
Master algorithmic patterns and data structures through hands-on LeetCode-style problems - from arrays and hashing to dynamic programming and advanced graphs.
View the course