Math for Programmers questions and answers
Number theory, combinatorics and computational geometry. Page 6 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 301-360
- Counting subsets with given sizes of a set
- Counting the adjacent swaps required to convert one permutation into another
- Create 2d triangles from 2d points
- Create a random permutation of 1..N in constant space
- Create non-intersecting polygon passing through all given points
- Creating all strongly connected graphs with given in-degree with equal probability
- Cutting Stock Problem
- Cycle of maximum weight in a graph
- Data structure for handling intervals
- Data structure representing a two-value array with 3 operations
- Data structures for loaded dice?
- Datastructure and algorithm to detect collisions of irregular shaped moving objects
- De Bruijn-like sequence for 2n - 1 how is it constructed?
- Depth sorting rectangular polygons, all parts of model axes facing
- Designing function f(f(n)) == -n
- Detecting self crossing in closed Bezier curves
- Detecting Singularities in a Graph
- Detecting when matrix multiplication is possible
- determine if a point sits inside an arbitrary shape?
- Determine if two rectangles overlap each other?
- Determine non-convex hull of collection of line segments
- Determine points within a given radius algorithm
- Determine the combinations of making change for a given amount
- Determining Floating Point Square Root
- Determining if a sphere intersects an object or not
- Determining if two rays intersect
- deterministic and reversible permutation function to store a message
- Difference between 2 numbers
- Difference between a stochastic and a heuristic algorithm
- Difference between hamiltonian path and euler path
- difference of two sets of intervals
- Differences between backtracking and brute-force search
- Direct formula for summing XOR
- Discrete Bayesian network on Tensorflow Probability, Edward2, and Python
- Discrete logarithm algorithm
- Display a decimal in scientific notation
- Distance between hyperplanes
- Distance from a point to a polygon
- Distinct digit count
- Distribute points on a circle as evenly as possible
- Dividing a list of numbers in two groups such that numbers in one group don't have any factor common with the numbers in the other group
- Dividing a number into random unequal parts
- Dividing a plane of points into two equal halves
- Division of a convex hull into two separate parts
- Division without using '/
- Does a range of integers contain at least one perfect square?
- does the number -3999999991 mean anything logical?
- Dominoes matching algorithm
- Don't understand closest pair heuristic from The Algorithm Design Manual
- Dot product between two 3D tensors
- Dot product of two vectors in tensorflow
- Draw equidistant points on a spiral
- dynamic programming and the use of matrices
- Dynamic Programming Coin Change Problems
- Dynamic Programming Sum-of-products
- Easiest algorithm of Voronoi diagram to implement?
- Easy interview question got harder given numbers 1..100, find the missing number(s) given exactly k are missing
- Efficient algorithm for finding a common divisor closest to some value?
- efficient algorithm to find nearest point in a graph that does not have a known equation
- Efficient algorithm to find the largest rectangle from a set of points
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