Dynamic Programming: Sum Over Subset
A small yet cool algorithm, that helps iterate over numbers whose bits are a subset of its parents.
A small yet cool algorithm, that helps iterate over numbers whose bits are a subset of its parents.
Due to popular demand, let's deal with graph theory, from the bottom-up! (DP joke, sorry)
Implement the mathematical sieve of eratosthenes to identify the primality of numbers in O(nlognloglogn)!
A quick and clever algorithm to exponentiate in logarithmic order of the exponent!
Identify a change in state of a bivalued function! This goes beyond the 'find-in-array' idea.
Perform Range Updates In Logarithmic Time With This Data Structure! Pre-Requisite: Segment Trees