Data-Structures-and-Algorithms
Data-Structures-and-Algorithms copied to clipboard
Implementation of Dynamic Programming
- Longest Common Subsequence
- Longest Increasing Subsequence
- Edit Distance
- Minimum Partition
- Ways to Cover a Distance
- Longest Path In Matrix
- Subset Sum Problem
- Optimal Strategy for a Game
- 0-1 Knapsack Problem
- Boolean Parenthesization Problem
- Shortest Common Supersequence
- Matrix Chain Multiplication
- Partition problem
- Rod Cutting
- Coin change problem
- Word Break Problem
- Maximal Product when Cutting Rope
- Dice Throw Problem
- Box Stacking
- Egg Dropping Puzzle
Issue-Label Bot is automatically applying the label feature_request
to this issue, with a confidence of 0.60. Please mark this comment with :thumbsup: or :thumbsdown: to give our bot feedback!
Links: app homepage, dashboard and code for this bot.
Hey , i can implement longest common subsequence(python), can you assign me this
I would like to work on all in C++
Guys you can take any problem you want as long as its implementation doesn't exist.
Added 01-kanpasack bottom up and top down DP . Do check PR #137
i would like to work on the coin change problem using c++
i would like to work on the coin change problem using c++
you can take it as its implementation doesn't exist.
Sir please assign this issue to me
Why you should assign this to me? i am current rated 5 star at codechef with rating of 2153 and rated expert at codeforces with rating of 1776 https://codeforces.com/profile/navjotdadwal https://www.codechef.com/users/navjot1234 So i can handle and solve this issue
@navjotdadwal assigned.
May I please be assigned issue 12, Matrix Chain Multiplication using Python(if language not allowed, then using C++). It hasn't been solved.
May I please be assigned issue 12, Matrix Chain Multiplication using Python(if language not allowed, then using C++). It hasn't been solved.
assigned.
Please review my code https://github.com/The-Streamliners/Data-Structures-and-Algorithms/pull/264
hey , I am new to open source development , I would love to work on all of that , can you please assign these to me