Introduction
It is exciting to learn some new algorithm through mock interview. I like to ask the question what is your favorite algorithm.
It is the first time in a week I heard two time NP complete problem.
Algorithm
Here is the algorithm I can do some study.
Follow up
Dynamic programming - Set 25 (subset sum problem)
https://www.geeksforgeeks.org/perfect-sum-problem-print-subsets-given-sum/
Subset sum dynamic programming - similar to deletion distance dynamic programming, regular expression matching problem.
https://gist.github.com/jianminchen/ea004cdf37689d4c2c090dcec638f1c3
Subset sum problem
https://gist.github.com/jianminchen/57704617cd684d8dd61bd5ae93d0b621
No comments:
Post a Comment