Skip to content

Category Archives: Dynamic Programming

  Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems using recursion and storing the results of… Read More
The Fibonacci numbers are the numbers in the following integer sequence.0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …….. In… Read More
Total number of possible Binary Search Trees with n different keys (countBST(n)) = Catalan number Cn = (2n)! / ((n + 1)! * n!) For… Read More
Given a binary matrix, find out the maximum size square sub-matrix with all 1s.  For example, consider the below binary matrix.  Recommended Practice Largest square… Read More
Given an array arr[] of positive numbers, the task is to find the maximum sum of a subsequence with the constraint that no 2 numbers… Read More

Start Your Coding Journey Now!