Rohit Gawanderohit253.hashnode.dev·Oct 25, 2024Chapter 41: Dynamic Programming (Part 2)Introduction In this chapter, we dive deeper into Dynamic Programming, focusing on several classic problems and strategies associated with Knapsack-type problems. These problems, widely known for their use of recursion, memoization, and tabulation, h...DiscussDSA(Data Structure and Algorithm) In JAVADSA

Rohit Gawanderohit253.hashnode.dev·Oct 16, 2024Chapter 40: Dynamic Programming (Part 1)Introduction to Chapter : Dynamic Programming (DP) is a powerful technique for solving problems that involve overlapping subproblems and optimal substructure. It allows us to optimize recursive solutions by storing results of subproblems, preventing ...Discuss·29 readsDSA(Data Structure and Algorithm) In JAVADynamic Programming

Sanam Palsuledynamic-programming101.hashnode.dev·Oct 15, 2024Pattern 1 : Fibbonacci like DPThis pattern is used where each decision depends on 1 or 2 previous states, just like Fibonacci sequence! Climbing Stairs: Leetcode Link You can either climb 1 step or 2 steps at a time. Find how many distinct ways you can reach the top of a staircas...Discuss·10 likes·27 readsDynamic Programming

Eshtiak Ahmadtsp.hashnode.dev·Oct 7, 2024The Travelling Salesman ProblemTravelling Salesman Problem (TSP) is a very common problem used everyday in our life. The problem is basically travelling to all the vertices at once starting from a single source, and return back to the source using the shortest possible routes. For...Discussalgorithms

JAY VINCHHIforCOPS IIT BHUblogs.copsiitbhu.co.in·Sep 25, 2024Josephus ProblemThe Josephus problem is a fascinating mathematical puzzle involving people standing in a circle, where every k-th person is eliminated until only one remains. Named after Flavius Josephus, this problem dates back to ancient history and has significan...Discuss·56 likes·412 readsProgramming Blogs

Shams Nahidblog.shams-nahid.com·Sep 12, 2024House Robber: From recursion to memoization and ultimately space-optimized solutionOne of the most popular dynamic programming problems is the famous house robber. If we narrow down the category, it is the pick or not pick problem. Based on the basics of house robber problem, a few more problems are available are out there by addin...DiscussNode.js & JavaScriptDynamic Programming

Shams Nahidblog.shams-nahid.com·Sep 10, 2024Fibonacci Number: From recursion to memoization and ultimately space-optimized solutionLet’s evaluate the Classic Dynamic Programming problem, Fibonacci Number in a crispy way. We will start solving the problem from a recursive solution and later step by step we will use memoization and space optimization. The Fibonacci Number or Fibon...DiscussNode.js & JavaScriptJavaScript

Fatima Jannetmahia.hashnode.dev·Aug 30, 2024Complex Dynamic Programming ExercisesNOTE ON THIS SECTION These problems are CHALLENGING AND ADVANCED compared to the earlier ones. DO NOT feel discouraged if they are difficult. This section is for those who enjoy pain and misery. You DO NOT need to attempt these problems unless you wa...Discuss·3 likes·30 readsPython Data Structure and Algorithm - DSADynamic Programming

Fatima Jannetmahia.hashnode.dev·Aug 30, 2024It's Dynamic Programming, Lazy Coder's Best Friend!Did you know that dynamic programming is a very old concept (the name was given by Bellman) and the word "programming" here has nothing to do with writing code? Instead, it focuses on finding the optimal solution. Believe it or not, dynamic programmi...Discuss·87 readsPython Data Structure and Algorithm - DSADynamic Programming

Shashwat Nathmagmastorm.hashnode.dev·Aug 17, 2024DSA Comprehensive Topic ListNote:This isn't a Competitive Programming guide so number theory,game theory,segment trees aren’t mentioned in detail this is to prepare you for majority of DSA that is good for you to be acquainted with for interviews or any other purpose. This Arti...Discuss·32 readsDSA