DataStructure and Algorithms

Your answer can include below points: I make sure that the decision I make will benefit the team and project. I list down pros and cons of the…

To answer these type of question, you need to answer carefully. Saying too much or saying too little will hurt your chances of getting the…

In this tutorial we shall solve a very famous problem “House Robber” problem. This problem can be solved by using DP method. 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:…

In this tutorial we shall learn about job sequencing with deadline problem. We shall solve this problem with the help of Greedy Approach.…

This is a variant of the previous problem. Like previous coin change problem, we shall solve with help of Dynamic Programming. 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…

In this chapter we shall solve Travelling Salesman Problem with help of dynamic programming. Problem statement: A salesman will start from a…

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…

Introduction: Kadane Algorithm is an efficient way to solve the maximum sub array problem. Explanation: So before we know about Kadane…