Reservoir Sampling
Reservoir sampling is a category of randomised algorithms for choosing a simple random sample, without replacement, of k items
Category: Mathematics
Generate Pythagorean Triples
Given an integer limit, generate all Pythagorean Triples with values smaller than limit.
Minimum Moves to Equal Array Elements – LeetCode Solution [Medium]
When we increment n – 1 elements, the relative difference between the highest number and all other numbers effectively decreases by 1.
Line Problem Solution | CodeChef [Easy]
Consider the 2D grid formed by integer points on the XY Plane. The position of the Sniper and the Target are lattice points in this grid. The bullet shot by the Sniper will follow a straight line trajectory from (x1, y1) to (x2, y2). The bullet goes no further than (x2, y2).
Lucy and Flowers | HackerRank Solution [Medium]
The number of possible Binary Search Trees with n keys is Catalan Number (Cn). You could learn about Catalan Number & Binomial Coefficient.
Program for Nth Catalan Number
Catalan numbers (Cn) are a sequence of natural numbers. Nth Catalan number has applications in many counting problems.
How to calculate Binomial Coefficient (nCr) in O(r) time complexity
The recomputations in calculating binomial coefficient (nCr) can be avoided by exploiting optimal substructure and overlapping subproblems
Sherlock and MiniMax | HackerRank Solution [Hard]
Given an integer range, for all M in that inclusive range, determine the minimum – abs(arr[i]-M) for all i
nCr table | HackerRank Solution [Medium]
Jim is doing his discrete maths homework which requires him to repeatedly calculate nCr(n choose r) for different values of n
Counting Bits O(n) Solution – LeetCode [Easy] | Brian Kernighan’s Algorithm
Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.