mauryahimanshu / must-know-algorithms-for-competitive-coding Goto Github PK

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

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

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. ⭐

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

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

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

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

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.

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.

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

Good Luck.

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

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.

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