From 52bbc815204f8ea2135c3b63eef20dd6fd9033a8 Mon Sep 17 00:00:00 2001 From: Robert Benjamin Date: Tue, 29 Nov 2016 13:51:15 -0800 Subject: Fix minor spacing typo (#2586) --- dynamic-programming.html.markdown | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'dynamic-programming.html.markdown') diff --git a/dynamic-programming.html.markdown b/dynamic-programming.html.markdown index 94be22e9..7df367e7 100644 --- a/dynamic-programming.html.markdown +++ b/dynamic-programming.html.markdown @@ -9,7 +9,7 @@ contributors: ## Introduction -Dynamic Programming is a powerful technique used for solving a particular class of problems as we will see.The idea is very simple, If you have solved a problem with the given input, then save the result for future reference, so as to avoid solving the same problem again. +Dynamic Programming is a powerful technique used for solving a particular class of problems as we will see. The idea is very simple, If you have solved a problem with the given input, then save the result for future reference, so as to avoid solving the same problem again. Always remember! "Those who can't remember the past are condemned to repeat it" -- cgit v1.2.3 From c174cb0829e3b1e92c9cf86a8dc0c0f77b95295d Mon Sep 17 00:00:00 2001 From: ditam Date: Sun, 15 Oct 2017 20:21:07 +0200 Subject: add backticks to escape markdown formatting characters --- dynamic-programming.html.markdown | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'dynamic-programming.html.markdown') diff --git a/dynamic-programming.html.markdown b/dynamic-programming.html.markdown index 7df367e7..4db8e92e 100644 --- a/dynamic-programming.html.markdown +++ b/dynamic-programming.html.markdown @@ -26,7 +26,7 @@ The Longest Increasing Subsequence problem is to find the longest increasing sub First of all we have to find the value of the longest subsequences(LSi) at every index i with last element of sequence being ai. Then largest LSi would be the longest subsequence in the given sequence. To begin LSi is assigned to be one since ai is element of the sequence(Last element). Then for all `j` such that `j Date: Sun, 14 Oct 2018 05:59:24 +0530 Subject: Fix links --- dynamic-programming.html.markdown | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'dynamic-programming.html.markdown') diff --git a/dynamic-programming.html.markdown b/dynamic-programming.html.markdown index 4db8e92e..aed169fc 100644 --- a/dynamic-programming.html.markdown +++ b/dynamic-programming.html.markdown @@ -42,9 +42,9 @@ for i=0 to n-1 ### Some Famous DP Problems -- Floyd Warshall Algorithm - Tutorial and C Program source code:http://www.thelearningpoint.net/computer-science/algorithms-all-to-all-shortest-paths-in-graphs---floyd-warshall-algorithm-with-c-program-source-code -- Integer Knapsack Problem - Tutorial and C Program source code: http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---the-integer-knapsack-problem -- Longest Common Subsequence - Tutorial and C Program source code : http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---longest-common-subsequence +- Floyd Warshall Algorithm - Tutorial and C Program source code: [http://www.thelearningpoint.net/computer-science/algorithms-all-to-all-shortest-paths-in-graphs---floyd-warshall-algorithm-with-c-program-source-code]() +- Integer Knapsack Problem - Tutorial and C Program source code: [http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---the-integer-knapsack-problem]() +- Longest Common Subsequence - Tutorial and C Program source code : [http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---longest-common-subsequence]() ## Online Resources -- cgit v1.2.3 From 98f67a64fc62d9fec1515ccc220cc16e289d1d3a Mon Sep 17 00:00:00 2001 From: LukaxFeh Date: Tue, 30 Oct 2018 20:32:24 -0300 Subject: [Dynamic programming] Fixed links --- dynamic-programming.html.markdown | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'dynamic-programming.html.markdown') diff --git a/dynamic-programming.html.markdown b/dynamic-programming.html.markdown index aed169fc..f5f1743c 100644 --- a/dynamic-programming.html.markdown +++ b/dynamic-programming.html.markdown @@ -42,9 +42,9 @@ for i=0 to n-1 ### Some Famous DP Problems -- Floyd Warshall Algorithm - Tutorial and C Program source code: [http://www.thelearningpoint.net/computer-science/algorithms-all-to-all-shortest-paths-in-graphs---floyd-warshall-algorithm-with-c-program-source-code]() -- Integer Knapsack Problem - Tutorial and C Program source code: [http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---the-integer-knapsack-problem]() -- Longest Common Subsequence - Tutorial and C Program source code : [http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---longest-common-subsequence]() +- [Floyd Warshall Algorithm - Tutorial and C Program source code](http://www.thelearningpoint.net/computer-science/algorithms-all-to-all-shortest-paths-in-graphs---floyd-warshall-algorithm-with-c-program-source-code) +- [Integer Knapsack Problem - Tutorial and C Program source code](http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---the-integer-knapsack-problem) +- [Longest Common Subsequence - Tutorial and C Program source code](http://www.thelearningpoint.net/computer-science/algorithms-dynamic-programming---longest-common-subsequence) ## Online Resources -- cgit v1.2.3 From 3bc09477210f23f8a9a2f83af5c55cca55cde6cf Mon Sep 17 00:00:00 2001 From: Sumeet Mahajan Date: Wed, 13 Mar 2019 17:01:54 +0530 Subject: added more resources --- dynamic-programming.html.markdown | 2 ++ 1 file changed, 2 insertions(+) (limited to 'dynamic-programming.html.markdown') diff --git a/dynamic-programming.html.markdown b/dynamic-programming.html.markdown index f5f1743c..c73b1845 100644 --- a/dynamic-programming.html.markdown +++ b/dynamic-programming.html.markdown @@ -49,3 +49,5 @@ for i=0 to n-1 ## Online Resources * [codechef](https://www.codechef.com/wiki/tutorial-dynamic-programming) +* [InterviewBit](https://www.interviewbit.com/courses/programming/topics/dynamic-programming/) + -- cgit v1.2.3 From d03ff9338abb42ffc09a52af9b55f7addc1f88ba Mon Sep 17 00:00:00 2001 From: Miltiadis Stouras Date: Mon, 14 Oct 2019 13:49:03 +0300 Subject: Add some resources for Dynamic Programming --- dynamic-programming.html.markdown | 14 ++++++++++++-- 1 file changed, 12 insertions(+), 2 deletions(-) (limited to 'dynamic-programming.html.markdown') diff --git a/dynamic-programming.html.markdown b/dynamic-programming.html.markdown index c73b1845..5d260206 100644 --- a/dynamic-programming.html.markdown +++ b/dynamic-programming.html.markdown @@ -3,6 +3,7 @@ category: Algorithms & Data Structures name: Dynamic Programming contributors: - ["Akashdeep Goel", "http://github.com/akashdeepgoel"] + - ["Miltiadis Stouras", "https://github.com/mstou"] --- # Dynamic Programming @@ -48,6 +49,15 @@ for i=0 to n-1 ## Online Resources -* [codechef](https://www.codechef.com/wiki/tutorial-dynamic-programming) +* MIT 6.006: [Lessons 19,20,21,22](https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) +* TopCoder: [Dynamic Programming from Novice to Advanced](https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/) +* [CodeChef](https://www.codechef.com/wiki/tutorial-dynamic-programming) * [InterviewBit](https://www.interviewbit.com/courses/programming/topics/dynamic-programming/) - +* GeeksForGeeks: + * [Overlapping Subproblems](https://www.geeksforgeeks.org/dynamic-programming-set-1/) + * [Tabulation vs Memoization](https://www.geeksforgeeks.org/tabulation-vs-memoizatation/) + * [Optimal Substructure Property](https://www.geeksforgeeks.org/dynamic-programming-set-2-optimal-substructure-property/) + * [How to solve a DP problem](https://www.geeksforgeeks.org/solve-dynamic-programming-problem/) +* [How to write DP solutions](https://www.quora.com/Are-there-any-good-resources-or-tutorials-for-dynamic-programming-DP-besides-the-TopCoder-tutorial/answer/Michal-Danilák) + +And a [quiz](https://www.commonlounge.com/discussion/cdbbfe83bcd64281964b788969247253) to test your knowledge. -- cgit v1.2.3 From 140e87e6836012597c2b547f096b6afac86174ed Mon Sep 17 00:00:00 2001 From: Mario Viens Date: Sat, 29 Feb 2020 14:01:02 -0800 Subject: Fix whitespace to be consistent --- dynamic-programming.html.markdown | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'dynamic-programming.html.markdown') diff --git a/dynamic-programming.html.markdown b/dynamic-programming.html.markdown index 5d260206..3e3c0413 100644 --- a/dynamic-programming.html.markdown +++ b/dynamic-programming.html.markdown @@ -23,7 +23,7 @@ Always remember! ## Example of Dynamic Programming -The Longest Increasing Subsequence problem is to find the longest increasing subsequence of a given sequence. Given a sequence `S= {a1 , a2 , a3, a4, ............., an-1, an }` we have to find a longest subset such that for all `j` and `i`, `j