Aditya Verma (Youtube) DP Playlist Codes/Solutions.

Sharing my 30 days long journey 💜 of Dynamic Programming 💫 🔥 . This would not be possible without Aditya Verma's DP series 🙏 👇 👇

This repo will contain the coding DSA problem solved by me as part of my #100daysofalgo challenge taken up by me on Linkedin

Data structure and algorithms are two of the most important aspects of computer science. Data structures allow us to organize and store data, while algorithms allow us to process that data in a meaningful way.

This repo consists codes of Aditya Verma - Dynamic Programming Playlist

Here are some of my Data structures and algorithms created in Java Programming Language using IntelliJ IDE.

Contains the code of different DP problems. ie. 0/1 knapsack, unbounded-knapsack, Fibonacci, and different variations of similar problems.

This repository is all about various concepts related Dynamic Programming.It also contains solutions to problems from various online judges, organized by topic.

Code samples that demonstrate the algorithms learnt during the course. Used as a preparation (not only ;)) for the exam.

Important Algorithms for coding interviews 📚

Parallel Programming exercise

My DP Concepts

Implementations of most algorithms learnt in the course UE18CS311

My Data-Structures and Algorithms codes for CSE 203 Course.

In this repository i am going to keep some of the important notes and programs which are most useful while Coding.

📈 Welcome to the Design and Analysis of Algorithms Repository! 📚✨ Immerse yourself in a meticulously curated knowledge pool on algorithmic design and analysis. 🌐💡 Explore the intricacies of crafting efficient algorithms and navigating problem-solving strategies. 🚀🔍 Master the art of algorithmic exploration in this dynamic space! 👨‍💻🧮

An OOP project which can simulate six different types of dynamic programming based problems

Optimum chain matrix product using dynamic programming.

Matrix chain multiplication (or Matrix Chain Ordering Problem, MCOP) is an optimization problem that can be solved using dynamic programming. Given a sequence of matrices, the goal is to find the most efficient way to multiply these matrices. The problem is not actually to perform the multiplications, but merely to decide the sequence of the mat…