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
Category: Dynamic Programming
Common Child | Algorithms | HackerRank Solution [Medium]
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?
Substring Diff | HackerRank (Algorithms) | Longest Common Substring
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.
Assembly-Line Scheduling
Assembly line scheduling is a classic problem in production optimization, often encountered in manufacturing industries.
Fibonacci Numbers Solution (O(1) auxiliary space)
To find the nth fibonacci number, we need not store previous Fibonacci numbers in an array. We could use two temporary variables instead of an array to store previous fibonacci numbers
Pascal’s Triangle
In mathematics, Pascal’s triangle is a triangular array of the binomial coefficients. It can also be viewed as: each number in Pascal’s triangle is the sum of the two numbers directly above it.
Number of ways to climb a stair having n steps – LeetCode Solution [Easy]
You are climbing a staircase. It has n steps upto the top. Each time you can either climb 1 step or 2 steps. You’ve to find the number of ways to climb the stair.
Subset with a given sum and number of subsets
You are given an array of non-negative integers, you have to find the number of subsets having sum equal to the given sum. Subset needs not to be contiguous.
Tower of Babylon Solution – SPOJ.com
Given n different types of blocks. Each one of them may be duplicated as many times as you like. Each type has a height y, a width x and a depth z.
Matrix-chain multiplication
We are given a sequence (chain) (M1, M2, M3…Mn) of n matrices to be multiplied and we need to find the most efficient way to multiply these matrices together.