Data Structures and Algorithms This repository contains my solutions to various Data Structures and Algorithms (DSA) questions related to Dynamic Programming. Dynamic Programming is a method used for solving optimization problems by breaking them down into simpler subproblems, storing the solutions of subproblems to avoid redundant calculations. It's a fundamental technique widely applied in fields like competitive programming, resource allocation, and problem optimization.
I am using the Coder Army Sheet for these questions here.
Contents: Introduction How to Use Contributing License Introduction In this repository, you'll find solutions to a variety of Dynamic Programming DSA questions. Each solution is implemented in C++ (or any preferred programming language) and organized into separate directories based on the type of problem for easy navigation. Topics include classic DP problems such as Knapsack, Longest Common Subsequence, Fibonacci variations, and Pathfinding algorithms.
How to Use Clone this repository to your local machine: bash Copy code git clone https://github.com/HaniRawat/DynamicProgramming.git Navigate to the directory: bash Copy code cd DynamicProgramming Open the file: Open the file containing the solution you're interested in using your preferred code editor to view the solution.
Run the solution: Run the solution using an appropriate compiler or interpreter for the chosen programming language, such as:
bash Copy code g++ filename.cpp -o solution ./solution Contributing Contributions to this repository are welcome! If you'd like to contribute a new solution, fix a bug, or improve an existing solution, feel free to open a pull request. Please adhere to the existing code style and ensure that your solution is well-documented.
License This repository is licensed under the MIT License. You can find more details in the LICENSE file.