- This repository is inspired by @mission-peace. Much credit to him in helping me understand the algorithms and approaches to nearly all of these problems. In many cases, these are Go implementations of his Java solutions. I would highly encourage you to check out his YouTube, GitHub, and/or Facebook.
| Problem | Type |
|---|---|
| Coin Change | Dynamic Programming |
| Coin Change II | Dynamic Programming |
| Concatenated Words | Dynamic Programming |
| Longest Common Subsequence | Dynamic Programming |
| Longest Common Substring | Dynamic Programming |
| Longest Palindromic Subsequence | Dynamic Programming |
| Longest Palindromic Substring | Manacher's Algorithm |
| Partition Equal Subset Sum | Dynamic Programming |
| Sorting | Sorting Algorithms |
| Word Break | Dynamic Programming |
| Word Break II | Memoization + DFS |