Open bmoussa opened 8 years ago
Hi @bmoussa,
Feel free to send in your contributions to this repo. Do you have something in mind that you want to implement? If you don't have a specific algorithm in mind, you can improve this repo by adding testcases for existing algorithms.
Let me know if you need help with this.
Thank you So for a first contribution I think adding an algorithm in the dp folder. This algorithm that I would call "check.py" will check whether the elements of an array are consecutive.
Hi!! I have some algorithms in mind. can i contribute to this repo?
Sure! Let me know what algorithms do you have in mind and we can move forward from there.
I can write Knuth–Morris–Pratt algorithm(KMP), Merge sort,Tower of Hanoi and Fenwick tree algorithms. what u say?
KMP sounds great. I wanted to add more string algorithms to this repo and KMP sounds like a good way to go. After KMP you can pick up Rabin-Karp and then Boyer-Moore!
Also do remember to add tests as it makes the code more robust.
Looking forward to your PR!
Which of these can I add? Segment tree, strongly connected components (Kosaraju), binary indexed tree and longest common subsequence.
@vedangmehta Kosaraju's already there, so is LCS. You can start with Segment Tree.
I can't find LCS in DP section. I can see LIS though.
Oh yeah! You're right. Sorry I confused the two. You can go ahead and add that too.
Ok! I'll add both seg tree and LCS.
@prakhar1989 , Can i add Edit Distance
to DP
section??
@munendrasn: Can you talk a bit more about the algorithm? Probably a wiki link if possible?
@munendrasn The algorithm is generally known as Levenstein Distance, I believe.
@prakhar1989 , https://en.wikipedia.org/wiki/Levenshtein_distance
Cool. Sounds good. Do remember to add tests in the PR as well.
Sure. @prakhar1989 , Also should I close this PR #38 ??
Can i add modular exponentiation ?
@prakhar1989 I've sent a PR for modular multiplicative inverse algorithm.
Hi I want to contribute to this project by adding some python algorithme.This is my first contribution so let me know if I did something wrong!