Mistakes to avoid in an interview.
In this chapter we shall see what are the mistakes to avoid in an interview. Coming late to interview: It doesn’t matter whatever the reasons…
House Robber Problem
In this tutorial we shall solve a very famous problem “House Robber” problem. This problem can be solved by using DP method. Problem…
Activity Selection Problem
In this chapter we shall learn on how to solve activity selection problem with the help of example and using greedy method. Problem Statement:…
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…