Timeline for Minimise given size using dynamic programming
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jun 26, 2018 at 14:19 | vote | accept | Itay4 | ||
| Jun 26, 2018 at 13:54 | answer | added | Gassa | timeline score: 2 | |
| Jun 26, 2018 at 13:42 | comment | added | Simon Prins | I can give you some advice to get on your way. First step to solving this as a dynamic program is defining the problem in such a way that solving a smaller version of that problem allows you to quickly find the solution to the larger problem. The dynamic programming solution to finding the edit distance of two strings has some similarities with this problem, so you could have a look at that for ideas: geeksforgeeks.org/dynamic-programming-set-5-edit-distance | |
| Jun 26, 2018 at 12:36 | history | asked | Itay4 | CC BY-SA 4.0 |