summaryrefslogtreecommitdiff
path: root/AlgoDesignAndTechniqueEdxJava/tests/LCS3Test.java
diff options
context:
space:
mode:
authorHaidong Ji2018-12-25 11:12:42 -0600
committerHaidong Ji2018-12-25 11:12:42 -0600
commit1c6c9657a6432fc1d7069ddf8dd106f7a614fbed (patch)
tree563c54d66a88a1878de02934c7aa5a33fed45379 /AlgoDesignAndTechniqueEdxJava/tests/LCS3Test.java
parentc4ef43d3e77450b45bb7fb988bff0923ef8276fe (diff)
Longest Subsequence (betwee 2) done!
This one is pretty tricky. I solved it after reading online: http://www.cs.umd.edu/~meesh/351/mount/lectures/lect25-longest-common-subseq.pdf https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/ To find a good test case that reveals the bug, I tried stress testing (in commented out code), but the naive but correct algo is so inefficient that I didn't have enough patience to let it finish. Anyway, good practice of stress testing anyway.
Diffstat (limited to 'AlgoDesignAndTechniqueEdxJava/tests/LCS3Test.java')
0 files changed, 0 insertions, 0 deletions