Job Sequencing with deadline Problem
In this tutorial we shall learn about job sequencing with deadline problem. We shall solve this problem with the help of Greedy Approach.…
Total number of ways to get denomination of coins.
This is a variant of the previous problem. Like previous coin change problem, we shall solve with help of Dynamic Programming. Problem…
Minimum Coin Change Problem
In this tutorial we shall learn how to solve coin change problem with help of an example and solve it by using Dynamic Programming. Problem…
Travelling salesman problem with implementation
In this chapter we shall solve Travelling Salesman Problem with help of dynamic programming. Problem statement: A salesman will start from a…
Sliding Window technique
Introduction: This technique can be applied in different ways. It can be applied on strings and also on integers. Below are the 2 ways in…
Kadane Algorithm explanation with implementation in C++
Introduction: Kadane Algorithm is an efficient way to solve the maximum sub array problem. Explanation: So before we know about Kadane…
Sieve Of Eratosthenes
In this chapter we shall learn about below topics: 3.1 Introduction. 3.2 Working of the algorithm 3.3 Understanding using an example 3.4…
Tower of Hanoi
In this chapter we shall learn about below topics: 2.1 Introduction. 2.2 Problem Statement 2.3 Understanding using an example 2.4…
Introduction to P, NP, NP hard, NP Complete
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…
0/1 knapsack problem tutorial with implementation
In this chapter we shall learn about below topics: 2.1 Introduction to 0/1 Knapsack problems. 2.2 Understanding 0/1 Knapsack with an example…