ProDeveloperTutorialonJanuary 19, 2025 Count number of bits to be flipped to convert A to B Problem Statement: You are given 2 integers A and B. You need to findout the number of bits to be flipped to convert A to B. Example Input : a…
ProDeveloperTutorialonJanuary 19, 2025 Find the two non repeating numbers. Problem Statement: You are given an array of repeating numbers(twice), but two numbers are not repeating. You need to find out those numbers.…
ProDeveloperTutorialonJanuary 19, 2025 Dynamic Programming: Equal Sum partition Problem Statement: You are given an array. You need to return true if you are able to divide the array into 2 subsets such that the sum of the…
ProDeveloperTutorialonJanuary 19, 2025 Dynamic Programming: Unbounded Knapsack Problem Problem Statement: You are given 2 arrays. Value array and corresponding weight associated with it. You need to calculate the maximum amount…
ProDeveloperTutorialonJanuary 19, 2025 Dynamic Programming: Subset sum problem Problem Statement: You are given a non-negtive integers and a sum, you need to check if there is a subset with the sum equal to the given sum.…
ProDeveloperTutorialonJanuary 19, 2025 Dynamic Programming: Get the nth catalan number Problem Statement: You are given an integer “n”, you need to get the “nth” catalan number. What is a Catalan Number? A…
ProDeveloperTutorialonJanuary 19, 2025 Dynamic Programming: Permutation Coefficient Problem Statement: you are given 2 numbers n & k, you need to find permutation coefficient. What is Permutation Coefficient? Permutation…
ProDeveloperTutorialonJanuary 19, 2025 Dynamic Programming: Binomial Coefficiet Problem Problem Statement: You are given 2 values, n & k. You need to find the binomial coefficient of the values. Binomial Coefficient is…
ProDeveloperTutorialonJanuary 19, 2025 0 1 Knapsack Problem using Dynamic Programming Solution Before we start with with the solution. Let us understand the basic of DP in series of points as below: 1. DP will be built on top of…
ProDeveloperTutorialonJanuary 19, 2025 Detect a cycle in a undirected graph Problem Statement: You are given a undirected graph. You need to find out if the graph contains cycle or not. Example Solution We can use DFS…