Comments (19)
@munendrasn The algorithm is generally known as Levenstein Distance, I believe.
from algorithms.
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.
from algorithms.
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.
from algorithms.
Hi!! I have some algorithms in mind. can i contribute to this repo?
from algorithms.
Sure! Let me know what algorithms do you have in mind and we can move forward from there.
from algorithms.
I can write Knuth–Morris–Pratt algorithm(KMP), Merge sort,Tower of Hanoi and Fenwick tree algorithms. what u say?
from algorithms.
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!
from algorithms.
Which of these can I add? Segment tree, strongly connected components (Kosaraju), binary indexed tree and longest common subsequence.
from algorithms.
@vedangmehta Kosaraju's already there, so is LCS. You can start with Segment Tree.
from algorithms.
I can't find LCS in DP section. I can see LIS though.
from algorithms.
Oh yeah! You're right. Sorry I confused the two. You can go ahead and add that too.
from algorithms.
Ok! I'll add both seg tree and LCS.
from algorithms.
@prakhar1989 , Can i add Edit Distance
to DP
section??
from algorithms.
@munendrasn: Can you talk a bit more about the algorithm? Probably a wiki link if possible?
from algorithms.
@prakhar1989 , https://en.wikipedia.org/wiki/Levenshtein_distance
from algorithms.
Cool. Sounds good. Do remember to add tests in the PR as well.
from algorithms.
Sure. @prakhar1989 , Also should I close this PR #38 ??
from algorithms.
Can i add modular exponentiation ?
from algorithms.
@prakhar1989 I've sent a PR for modular multiplicative inverse algorithm.
from algorithms.
Related Issues (11)
- Bubble Sort implementation not found HOT 1
- Miss "tests/edges.txt" in tests HOT 1
- get_max_spacing in clustering.py HOT 1
- Bubble sort in sorting.py HOT 2
- Queue implementation currently uses a list under the hood. It should be modified to use a deque to make it efficient. HOT 4
- AttributeError in trees/binarysearchtree.py HOT 2
- Error HOT 2
- There is no merge sort in the repo, Can i add Merge sort? HOT 1
- Fractional knapsack
- Bug in algorithm HOT 1
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from algorithms.