Dynamic program practice from geeksforgeeks in JAVA
-
Updated
Feb 17, 2019 - Java
#
optimal-substructure
Here are 5 public repositories matching this topic...
Implementation of the 0-1 Knapsack Problem
java algorithm algorithms memo dynamic array optimal bottom-up arrays dynamic-programming knapsack-problem knapsack memorization integer-knapsack binary-knapsack optimal-substructure rucksack rucksack-problem memorization-table
-
Updated
May 20, 2017 - Java
Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)
memoization algorithm algorithms memo dynamic needleman-wunsch optimal pseudocode dynamic-programming patullo noah noah-patullo memorization optimal-substructure optimality algorithm-design needlemanwunsch needleman wunsch patulo
-
Updated
Jan 5, 2019 - Java
Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java
dynamic scheduling optimal binary-search-tree recursive dynamic-programming interval compatible patullo noah noah-patullo iterative optimal-substructure weighted patulo pattullo weighted-interval-scheduling interval-scheduling find-solution finish-time
-
Updated
May 28, 2017 - Java
Primitive calculator using iterative dynamic programming approach
-
Updated
Aug 4, 2022 - MATLAB
Improve this page
Add a description, image, and links to the optimal-substructure topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the optimal-substructure topic, visit your repo's landing page and select "manage topics."