This is a variant of the previous problem. Like previous coin change problem, we shall solve with help of Dynamic Programming. Problem Statement: You are given total amount and certain coin denomination. You need to get the total number of ways you make the change. …

Introduction: Kadane Algorithm is an efficient way to solve the maximum sub array problem. Explanation: So before we know about Kadane algorithm, first we shall look at that is the maximum sub array problem? You will be given with an array, you need to find the …

In this tutorial we shall learn about what is P, NP, NP hard, NP Complete problems. This is a complex topic. I have tried my best to make you understand in a easy way. First, full form of P and NP. P -> Polynomial Time …