This algorithm uses Relaxation, to find the shortest path between the source vertex and other vertices. It gradually expands the search space until the shortest path to the destination node is found.
You are given an integer array coins representing coins and an integer amount. Return the number of combinations that make up that amount.
You are given an integer vector coins[n] representing coins of different denominations and an integer amount representing a total amount of money.
Floyd-Warshall algorithm helps in finding the shortest path between all pairs of vertices in a graph.
The number of possible Binary Search Trees with n keys is Catalan Number (Cn). You could learn about Catalan Number & Binomial Coefficient.
Catalan numbers (Cn) are a sequence of natural numbers. Nth Catalan number has applications in many counting problems.
The recomputations in calculating binomial coefficient (nCr) can be avoided by exploiting optimal substructure and overlapping subproblems
Jim is doing his discrete maths homework which requires him to repeatedly calculate nCr(n choose r) for different values of n
Given two strings p and q of equal length, what’s the longest string that can be constructed such that it is a child of both?
Given two strings and an integer, determine the length of the longest common substrings of the two strings that differ in no more than k positions.