Nikhil Ramtekegit-command.hashnode.dev·Nov 12, 2024Chapter 1: Embarking on Your DSA Journey with JavaWelcome to the first chapter of our deep dive into Data Structures and Algorithms (DSA) using Java. In this series, we'll cover a wide range of fundamental and advanced DSA concepts, essential for acing technical interviews at top tech companies like...Discussadvancedsa
Rohit Gawanderohit253.hashnode.dev·Nov 9, 2024Chapter 46: Dynamic Programming (Part 6) - DSA SeriesWelcome to Chapter 46 of my Data Structures and Algorithms (DSA) Series! In this chapter, we dive into essential dynamic programming concepts focused on matrix operations and complex problem-solving techniques. Dynamic programming is all about breaki...Discusstabulation
Rohit Gawanderohit253.hashnode.dev·Nov 9, 2024Title: Chapter 45: Dynamic Programming (Part 5) – Wildcard Matching, Catalan's Number, Counting BSTs, and Mountain RangesIntroduction Welcome to Part 5 of the Dynamic Programming series! In this chapter, we'll tackle challenging problems that involve pattern matching, combinatorics, and counting structures. Topics include: Wildcard Matching (explanation and code) Cat...DiscussDSA(Data Structure and Algorithm) In JAVAcatalan
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·33 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·416 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
