5 Commits

Author	SHA1	Message	Date
Paolo Grisoli	8a13efde83	Update examples for Zig (#287) ... * update zig in chapters 1-6 * fix zig dijkstras algo * fix zig greedy algo * fix longest_common_subsequence in zig * cleanup * test: use testing allocator	2024-12-07 07:29:48 -06:00
spainn	11a2de7473	Update 01_longest_common_subsequence.py (#277) ... The original code was creating a 4x5 grid instead of 5x4. I also made it display by row. Co-authored-by: WhileRested <148598154+WhileRested@users.noreply.github.com>	2024-03-22 15:03:28 -05:00
spainn	5d068870bf	Update 02_longest_common_substring.py (#276) ... The original code did not work correctly out of the box. It generated a (4,5) grid instead of a (5,4) grid as the book's answer grid shows. Also on line 10 of my code I changed `dp_table[i-1][i-1] + 1` to `dp_table[i-1][j-1] +1`. I also updated the display to display by row. Co-authored-by: WhileRested <148598154+WhileRested@users.noreply.github.com>	2024-03-22 15:02:03 -05:00
Mikhail	7d16656674	Add a solution to the problem on Kotlin (#269) ... * Solution. Longest Common Subsequence	2024-03-22 14:51:00 -05:00
Aditya Bhargava	933acafaf3	reorg and add code for second edition	2023-08-09 08:20:19 -05:00