-
Notifications
You must be signed in to change notification settings - Fork 1k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Dynamic Programming/Winter of code #1455
Comments
I want to take Longest common subsequence and Longest increasing subsequence in python. Please assign me the task. |
Can I take Egg dropping puzzle in python? |
assigned @itsKrypton and @atriadhiakri2000 |
I would like to take (Count Ways to nth stair) in Java And Python |
I would like to take egg dropping puzzel in Cpp.Please assign. |
I would like to take Unique BST in Python. (Catalan Approach) . |
I would like to work on unique BSTs in C++, java, C |
Hello! |
assigned @jyoti-2 |
Unique_BST.py added under DP Issue-#1455
I have included Time and space complexity, Comments, output , description. Please let me know if any changes are required.
Added the solution for Count ways to N'th Stair. issue HarshCasper#1455
Added solution to Staircase Problem in Readme issue HarshCasper#1455
Added solution for Count ways to nth stair issue HarshCasper#1455
I would like to work on Kadane's algorithm in Java, Please assign |
Egg Dropping Puzzle |
Solved: Count ways to Nth Stair in Java and Python (issue #1455)
@iamrajiv @shraddhavp @HarshCasper What about the rest can i be assigned to them ? |
I have included Time and space complexity, Comments, output , description. Please let me know if any changes are required.
🚀 Feature
(A clear and concise description of what the feature is.)
Add the following problems:
Have you read the Contributing Guidelines on Pull Requests?
(Write your answer here.)
YES
Motivation
(Please outline the motivation for the proposal.)
Dynamic programming is used when the given problem can be divided into similar sub-problems, so that their results can be re-used. Before solving the current subproblem, dynamic algorithm will try to examine the results of the previously solved subproblems. Mostly, these algorithms are used for optimization.
Pitch
(Please explain why this feature should be implemented and how it would be used.)
Since Dynamic Programing is quite commonly asked interview .
Since the core idea is to use the previously calculated data we can use it for databases caching common queries in memory, through dedicated cache tiers storing data to avoid DB access, webservers store common data like configuration that can be used across requests.
The text was updated successfully, but these errors were encountered: