mauryahimanshu / must-know-algorithms-for-competitive-coding

For Hacktoberfest 2020 Contribution

Must know Algorithms (C++ Only)

Nearly everything functional in computer science is an implementation of data structure along with certain algorithms

This repository will be used to help beginners to learn the workflow on github. Also this repo can also help you with Hacktoberfest. If you don't know about Hacktoberfest, checkout : Hacktoberfest by Digital Ocean

Contributing

• Guide : Step-by-step guide to contributing on GitHub

When contributing to this repository, please first create a new issue if it does not exist.

Important

Create the file only in its respective directory. If the directory does not exist create a new one. Also the maintainer will not able assign everybody to each issue. So, go ahead commit and create a new pull request for any open Issue. Please do not submit a pull request to an Issue for which someone has already submitted a pull request and waiting to be merged.

Pull Request Process

1. Ensure that every PR is linked with an issue, all standalone PRs will be rejected by the maintainers.
2. Discuss all the features and requirements in issue section before sending an PR.
3. It would be really appreciated if you try to look into previous created issue instead of a new one.
4. Use proper template and be describe all the changes that you are addressing in a PR.

---

Do Not forget to Star this repo. So that, it can help many beginners on Github.

Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.

must-know-algorithms-for-competitive-coding's Issues

0/1 KnapSack using Memoization Dynamic Programming

Prime Factorization

Aim : Create a function that returns a vector of all the prime factors of a postive Integer.
Difficulty : Easy
Addition Remark :

Good Luck.

Primality Test using Sieve of Eratosthenes

Aim : Implementation of Sieve of Eratosthenes
Difficulty : Medium
Addition Remark : Input a non-negative integer less than 10^6 and check whether the given integer is prime or not.

Good Luck.

Prim's Algorithm

Aim : To find the Minimum Spanning Tree of a graph using prim's algorithm
Difficulty : Medium

Minimum Spanning Tree: Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees. A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected and undirected graph is a spanning tree with weight less than or equal to the weight of every other spanning tree. The weight of a spanning tree is the sum of weights given to each edge of the spanning tree.

Depth First Search Algorithm

Aim: To traverse and possibly search a graph in depth first manner
Difficulty: Easy

Not counting in Hacktoberfest

PR is not counted in Hacktoberfest
It is maybe due to capital H in Hacktoberfest
Maybe changing it to hacktoberfest will help

Pleas add sorting algorithms

It'll help beginners get knowledge of algos, time and space complexities and where to implement which algo.

Breadth First Search Graph Algorithm

Aim: To traverse and possibly search the whole graph breadth wise
Difficulty: Easy

Welcome to Hacktoberfest by Digital Ocean

To contribute read the README.md file.
Also check out the guide mentioned in README.md file.
Also in short :

• If you want to contribute create a new issue if it does not exist.
  Note: Duplicate issues will be rejected so please search before creating an issue.

Only the pull request with an Issue number will be considered.

Template :

• For Issue-
  Aim :
  Difficulty Level :
  Additional Remarks :

---

• For Pull request-
  Issue No. (typing number attached with hash) : #
  Addtional Remarks :

---

---

Good Luck.

Bipartite Graph Algorithm

Aim: To check whether a graph is bipartite or Not.
Difficulty: Easy

Topological Sort

Aim: Given a Directed Acyclic Graph (DAG), find Topological Sort of the graph.
Difficulty: Easy

Dinic's Algorithm for maximum flow

Floyd Warshall Algorithm

Aim : Given a graph, find the shortest distance between every two vertices
Difficulty : Medium

Suggestions

Submit only Code only in C++.

New suggestions are gladly welcomed. 👍

If a folder does exist, do create one for each category.(Ex. Number Theory, Graph Theory(Easy, Medium, Hard), Trees, Recursion, etc).

Also, do not forget to star the repo. ⭐

Dijkstra Algorithm

Aim : Find the shortest path between a given vertex and all other vertices in a graph
Difficulty : Medium