Java Solutions to problems on LintCode/LeetCode
-
Updated
Oct 1, 2020 - Java
{{ message }}
Java Solutions to problems on LintCode/LeetCode
My solutions for different online judges: UVa, LightOJ, SPOJ, Codeforces, Codechef, Atcoder, Timus, URI etc.
Dynamic programming is used where we have problems, which can be divided into similar sub-problems, so that their results can be re-used. Mostly, these algorithms are used for optimization.
This is final task of design and analysis of algorithm. It's about implementation of brute force, greedy, and dynamic programming on knapsack problem.
Mixed Dynamic-Programming Solutions -Java
CareerCup,Leetcode
Data structure and algorithms in C++
Implementation of Dynamic Programming Algorithms (Edit-Distance, Expectation-Maximization algorithm) in C++, Python
Add a description, image, and links to the dynamicprogramming topic page so that developers can more easily learn about it.
To associate your repository with the dynamicprogramming topic, visit your repo's landing page and select "manage topics."