Math for Programmers questions and answers
Number theory, combinatorics and computational geometry. Page 13 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 721-780
- How to count each digit in a range of integers?
- How to count integers between large A and B with a certain property?
- How to count possible combination for coin problem
- How to create the most compact mapping n → isprimen up to a limit N?
- How to detect if an ellipse intersectscollides with a circle
- How to determine if a Delaunay triangle is internal or external?
- How to determine if a point is in a 2D triangle?
- How to determine simplex time complexity ie Max flow
- How to determine whether two circular sectors overlap with each other
- How to display Runtime Statistics in Tensorboard using Estimator API in a distributed environment
- How to divide number into integer pieces that are each a multiple of n?
- How to efficiently calculate a row in pascal's triangle?
- How to efficiently determine if a set of points contains two that are close
- How to efficiently determine the normal to a polygon in 3D space?
- How to evaluate a math expression given in string form?
- How to evalute an exponential tower modulo a prime
- How to fastest check if point 3D is inside convex hull given by set of point
- How to fill a square with smaller squares/rectangles?
- How to find 4 points next to the intersection of two lines
- How to find all combinations of coins when given some dollar value
- How to find all grid points that correspond to non-reduced fractions in a square?
- How to find all grid squares on a line?
- How to find all partitions of a set
- How to find all permutations of a given word in a given text?
- How to find all possible subsets of a given array?
- How to find all taxicab numbers less than N?
- How to find all vertex-disjoint paths in a graph?
- How to find convex hull in a 3 dimensional space
- How to find if the second hand of a clock lies in the larger area or smaller one
- How to find integer nth roots?
- How to find largest triangle in convex hull aside from brute force search
- How to find out Geometric Median
- How to find pairs with product greater than sum
- How to find patterns lines, circles,... from a list of points?
- How to find probability distribution and parameters for real data?
- How to find the closest point on a right rectangular prism 3d rectangle
- How to find the fixed points of a simple mod function elegantly?
- How to find the intersection point between a line and a rectangle?
- how to find the least number of operations to compute xn
- How to find the maximum number of unique unit fractions that sum up to one
- How to find the number of values in a given range divisible by a given value?
- How to find the smallest number with just 0 and 1 which is divided by a given number?
- How to find the units digit of a certain power in a simplest way
- How to find two most distant points?
- How to force Apache Flink using a modified operator placement?
- How to generate a given number of size N pairings from a list with minimum overlap between pairings?
- How to generate a permutation?
- How to generate a power set of a given set?
- How to generate a random permutation in Java
- How to generate a subdivided icosahedron?
- How to generate all multiplicative partitions of a number if I have a list of primes/exponents?
- How to generate all permutations of a string in PHP?
- How to generate all the permutations of a multiset?
- how to generate Narcissistic numbers faster?
- How to generate random graphs?
- How to generate random numbers biased towards one value in a range?
- How to generate the power-set of a given List?
- How to get a normal distribution within a range in numpy?
- How to get all algebraic associative operations on a finite set by efficient algorithm?
- How to get all possible 2N combinations of a list’s elements, of any length
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