Archive: algorithms
-
» Binary tree to singly and doubly linked list
-
» Detecting and removing cycle from linked list
-
» Find unique triplets that sum up to zero
-
» Number of ways to make change for an amount (coin change)
-
» Maximum and minimum sum subsequences at a distance M
-
» Segment trees
-
» RGBA to RGB conversion
-
» Separable kernel constituent vectors
-
» Coroutines Internals
-
» Number of even sum subarrays
-
» Count matrix paths from TopLeft to BottomRight
-
» Vector rotation
-
» Logistic regression
-
» Linear regression
-
» Multithreaded code wrapping
-
» Shortest squares sum
-
» Nested loops count estimation
-
» Encoding normalized floats to RGBA8 vectors
-
» Radial lens undistortion filtering
-
» Cellphone base covering problem
-
» Maximize gain by choosing numbers from array ends
-
» Inserting whitespaces between words
-
» Solutions for a linear equation
-
» Calculating binomial coefficients
-
» Balanced binary search tree from sorted list
-
» Minimum coin change
-
» Bitonic tour
-
» Select/Copy/Paste problem
-
» Longest increasing subsequence
-
» Length of longest valid substring
-
» Next smallest palindrome
-
» Formatting repeating decimals
-
» Function approximation
-
» Generating integer partitions
-
» Longest subset which sums to zero
-
» Linear recurrence relations
-
» Box stacking problem
-
» Maximum and maximum zero-sum subarray problems
-
» Dice throw problem
-
» Compile-time pi approximation
-
» Binary tree traversal techniques
-
» Counting boolean parenthesizations
-
» Minimum number of jumps
-
» Primes generation
-
» Longest common subsequence
-
» Interval scheduling
-
» Pattern matching
-
» Point in polygon problem
-
» Line segments intersection
-
» Edit distance problem
-
» Maximum flow and bipartite matching
-
» All pairs shortest path and transitive closure
-
» Shortest path
-
» Minimum spanning tree
-
» Powerset generation
-
» Articulation points
-
» Connected components in graphs
-
» Median of arrays
-
» Kth order statistic
-
» Counting roundtrip paths in a graph given a number of steps
-
» Gray code subsets generation
-
» Generating random permutations
-
» Permutations and combinations
-
» Optimal binary search tree
-
» Radix sort and linear sorting
-
» Knapsack problem
-
» Integer arithmetic using bit operations
-
» Matrix chain multiplication - MCOP