This is a repository to get Algorithms and data-structures in many languages.
Everybody is welcomed to contribute to this repo.
The goal of this project is to help the beginners with their contributions in Open Source. We aim to achieve this collaboratively, so feel free to contribute in any way you want, just make sure to follow the contribution guidelines. You can contribute to it in either of the following ways: You can choose atleast any one option below or can add any algorithm or data-structure you like:
- Beginners:
- A simple algorithm you know in any language.
- Add any easy comptitive programming question you like.
- Intermediate:
- Add any algorithm you like.
- Add any data-structure implementation.
- Add any interview question as comment and solution in any language.
- Experienced:
- Add any important algorithm in any language.
- Add any game in your favorite programming language!
- Add any Hard Problem from competitve programming website.
- Add any interview question as comment and solution in any language.
- Add any important algorithm in any language.
- You must be assigned to an issue before this steps.
- Fork this repo.
- Clone the repo or type this commands.
git clone https://github.com/<your_username_here>/algorithms.git cd design-blocks
- Start writing you code, when done with the code part type this commands.
git add . git commit -m "<what_you_have_contributed>" git push
- Then make a PR to this repo and wait for the merge.
- That's it you have contributed to open source.
- If you enjoyed this you can do it again with another code.
Hacktoberfest is a month long virtual festival event to celebrate open source contributions presented by Digital Ocean and DEV. It is the easiest way to get into open source!
During the entire month of October 2020, all you have to do is contribute to any open source projects and open at least 4 pull requests. Yes, any project and any kind of contributions.
The Hacktoberfestโs simple plain objective is: Support open source and earn a limited edition T-shirt! But, itโs not just about the t-shirts or stickers. Its about supporting open source. Its about celebrating open source, and giving it back. If youโve never contributed to open source before, this is the perfect time to get started because Hacktoberfest provides a large list of available contribution opportunities.
Hacktoberfestยฎ is open to everyone in our global community. Whether youโre a developer, student learning to code. You can contribute to anything from code to simple fix, new feature to grammar mistake.
Contributing to open-source is easy.
- Please read the contributing guideline before any PR.
- Fork the repository
- Improve current program by
- improving codes and features
- adding new feature
- add any algorithm you like
- by adding any data-structure implementation yout like.
- improving the documentation
- you can also optimise somebody's code
- Push your work and Create a Pull Request
Click here for more explanation
The only exception would be if the project maintainer chooses to mark your pull request as โinvalidโ. Even if your pull requests arenโt accepted, they should still count toward your 4 pull requests necessary to earn the shirt.
Any pull request made to a public repo on GitHub will count. The pull request must contain commits you personally made yourself โ not automated commits from bots.
You can contribute to any open source project hosted on Github.com and contribute anything between October 1 to October 31 midnight in 2020. You will find plenty of issues labeled with hacktoberfest or good-first-issue etc on Github. These will be the simple ones most probably and easy to fix.
Directory Tree
algorithms/
โโโ algorithms/
โ โโโ c-sharp/
โ โ โโโ algorithmsInfo.md
โ โโโ cpp/
โ โ โโโ BinarySearch.cpp
โ โ โโโ bogosort.cpp
โ โ โโโ BubbleSort.cpp
โ โ โโโ DFT.cpp
โ โ โโโ HeapSort.cpp
โ โ โโโ InsertionSort.cpp
โ โ โโโ kadane's Algorithm.cpp
โ โ โโโ Kruskal's Minimum Spanning Tree.cpp
โ โ โโโ LongestIncreasingSubsequence.cpp
โ โ โโโ LongestPalindromeSubstring.cpp
โ โ โโโ MergeSort.cpp
โ โ โโโ SelectionSort.cpp
โ โ โโโ algorithmsInfo.md
โ โโโ java/
โ โ โโโ BinarySearch.java
โ โ โโโ BubbleSort.java
โ โ โโโ DFS.java
โ โ โโโ DijkstraAlgorithm.java
โ โ โโโ InterpolationSort.java
โ โ โโโ algorithmsInfo.md
โ โโโ javascript/
โ โ โโโ BubbleSort.js
โ โ โโโ LinearSearch.js
โ โ โโโ algorithmsInfo.md
โ โโโ other/
| | โโโ TypeScript/
| โ โ โโโ BogoSort.ts
โ โ โโโ algorithmsInfo.md
โ โโโ python/
โ โโโ BinarySearch.py
โ โโโ BreadthFirstSearch.py
โ โโโ BubbleSort.py
โ โโโ LinearSearch.py
โ โโโ MergeSort.py
โ โโโ algorithmsInfo.md
โโโ data structures/
โ โโโ c-sharp/
| | โโโ dsInfo.md
โ โโโ cpp/
| | โโโ BST.cpp
| | โโโ LinkedList.cpp
| | โโโ dsInfo.md
โ โโโ java/
| | โโโ dsInfo.md
โ โโโ javascript/
| | โโโ dsInfo.md
โ โโโ other/
| | โโโ dsInfo.md
โ โโโ python/
| โโโ dsInfo.md
โโโ others/
| โโโ PythonSMTP_Skeleton.py
| โโโ SnakeGame.py
โโโ questions/
โ โโโ c-sharp/
| | โโโ queInfo.md
โ โโโ cpp/
| | โโโ Edit Distance.cpp
| | โโโ TwoSum.cpp
| | โโโ queInfo.md
โ โโโ java/
| | โโโ queInfo.md
โ โโโ javascript/
| | โโโ queInfo.md
โ โโโ other/
| | โโโ queInfo.md
โ โโโ python/
| โโโ queInfo.md
โโโ templates/
โโโ cpp/
| โโโ templateHelp.md
โโโ java/
| โโโ templateHelp.md
โโโ other/
| โโโ templateHelp.md
โโโ python/
| โโโ templateHelp.md
โโโ templateHelp.md
Algorithm | CPP | Java | Python | JavaScript | Golang | C# | Other |
---|---|---|---|---|---|---|---|
Binary Search | โ | โ | โ | ||||
Bogo Sort | โ | TS โ | |||||
Breadth First Search | โ | ||||||
Breadth First Traversal | |||||||
Bubble sort | โ | โ | โ | โ | |||
Counting Sort | |||||||
Depth First Search | โ | ||||||
Depth First Traversal | โ | ||||||
Dijkstra Algorithm | โ | ||||||
Finite Automata | |||||||
Heap Sort | โ | ||||||
Huffman Coding | |||||||
Insertion Sort | โ | ||||||
Interpolation Search | โ | ||||||
K-NN | |||||||
K Centers Problem | |||||||
Kadane's Algorithms | โ | ||||||
KMP Algorithm | |||||||
Kruskalโs Minimum Spanning Tree Algorithm | โ | ||||||
Linear Search | โ | โ | |||||
Longest Common Subsequence | |||||||
Longest Increasing Subsequence | โ | ||||||
Longest Palindromic Substring | โ | ||||||
Merge Sort | โ | โ | |||||
Naive Search | |||||||
Quick Sort | |||||||
Radix Sort | |||||||
Selection Sort | โ | ||||||
Sieve of Eratosthenes | |||||||
Suffix Array | |||||||
Shell Sort |
Questions | CPP | Java | Python | JavaScript | Golang | C# | Other |
---|---|---|---|---|---|---|---|
Binomial Coefficient | |||||||
BellmanโFord Algorithm | |||||||
Coin Change | |||||||
Count ways to reach the nโth stair | |||||||
Cutting a Rod | |||||||
Edit Distance | โ | ||||||
Egg Droping Puzzle | |||||||
Four Sum | |||||||
Knapsack Problem | |||||||
Largest Sum Contiguous Subarray | |||||||
m Coloring Problem | |||||||
Pascalโs Triangle | |||||||
Matrix Chain Multiplication | |||||||
Maximum sum rectangle in a 2D matrix | |||||||
Min Cost Path | |||||||
Palindrome Partitioning | |||||||
Partition problem | |||||||
Subset Sum | |||||||
Tiling Problem | |||||||
The Knightโs tour problem | |||||||
Three Sum | |||||||
Two Sum | โ | ||||||
Variations of LIS | |||||||
Word Wrap Problem |
Data Structure | CPP | Java | Python | JavaScript | Golang | C# | Other |
---|---|---|---|---|---|---|---|
AVL Tree | |||||||
Binary Search Tree | โ | ||||||
Binary Tree | |||||||
Doubly Linked List | |||||||
Graph | |||||||
Heap | |||||||
Linked List | โ | ||||||
Queue | |||||||
Stack | |||||||
Trie |
you can add more algorithms, data-structure and cp problems if you like to in the readme file, after you have been assigned to any issue
Language | Steps |
---|---|
C++ | g++ <filename.cpp> |
Java | javac <filename.java> |
Python | python <filename.py> |
JavaScript | node <filename.js> |
Golang | go run <filename.go> |
C# | mcs <filename.cs> |
please provide some explanation to the code you write in form of comments.
add at least any one among whatever(algoritms, ds, questions) you know.