Example Test Cases for Stanford's Algorithms Coursera Specialization
Role in this project:
Backend Developer Contributions:233 commits, 13 PRs, 97 pushes in 3 years
Contributions summary:Beau primarily contributed to the development of test case generators for various algorithms and data structures problems, specifically within the context of Stanford's Algorithms Coursera specialization. They focused on generating input files for testing algorithms like the Knapsack problem, all-pairs shortest path, clustering, Huffman coding, and two-sum. The user also added a shell-based and Java-based tester to facilitate the assessment of the correctness of the algorithms.
testcasetest-casesstanfordalgorithms-stanfordstanford-algs
A collection of little tools that may help a TypeScript developer throughout the weekend afternoons.
Contributions:13 PRs, 52 pushes, 19 branches in 1 year 9 months
typescript