Reading Time: 3 minutes   Consider an array of size N and given a size K we need to find maximum elements of all subarrays of size K in […]

Reading Time: 5 minutes   Classical Greedy Problem Continuing with our Greedy Strategy we examine a classical problem of Knapsack. The problem is relatively simple, Given N […]

Reading Time: 3 minutes   If you did read the last previous post of Chapter 2 you’ll notice that greedy algorithm make a choice and then stick […]

Reading Time: 4 minutes   Greedy Algorithms As the name suggests, greedy algorithms work by making a decision and then sticking to it. Greedy algorithms doesn’t […]

Reading Time: 3 minutes   Overcoming Fear of Algorithms When most of us hear computer and programming algorithms for the first time, or even say after […]