manan025 / ds-algo-zone

This repository contains codes for various data structures and algorithms in C, C++, Java, Python, C#, Go, JavaScript and Kotlin.

Overview

• The goal of this project is to have codes for various data structures and algorithms - in C, C++, Java, Python, C#, Go, JavaScript and Kotlin.
• Feel free to contribute in any way you want.
• Make sure to follow the contribution guidelines listed below.

Content

• We currently have 8 folders for 8 programming languages - C, C++, Java, Python, C#, Go, JavaScript and Kotlin.
• Do not create folders in your submissions, unless specifically told to do so.

YOU CANNOT CREATE A PR DIRECTLY. YOU NEED TO BE ASSIGNED AN ISSUE. IF THE ISSUE DOES NOT EXIST, CREATE ONE, ASK FOR IT IN YOUR PREFERRED PROGRAMMING LANGUAGE AND WAIT FOR IT TO BE ASSIGNED TO YOU. NOT FOLLOWING THIS WILL BE CONSIDERED A VIOLATION AND YOUR PR WILL BE MARKED INVALID. WHILE CREATING AN ISSUE, PLEASE FOLLOW THE FORMAT, ELSE, THE ISSUE WILL BE CLOSED.

Contribution Guidelines {For a more detailed explanation read How to Contribute?}

• Issues will be assigned on a first come, first serve basis. The person who creates the issue gets the first priority. And then, issues are assigned based on who commented first. You just have to comment on the issue, asking to be assigned and the programming language you should be assigned in, and it will be done if found fit.
• You cannot work on any issue that is not assigned to you.
• If you have anything else in mind, FEEL FREE TO CREATE AN ISSUE and please wait for it to be assigned to you. If assigned to you, then you can start working on it and create a PR.
• All PRs must be made from a Branch. Create a separate branch for every Issue you are working upon and then create a PR.
• In your code file, add (Inside a multiline comment) Sample Input and Output at the end of the file along with Time and Space Complexity.
• Every time you add a file via a Pull Request also update the README.md file for that particular language in Alphabetical Order in the same PR. You'll find a README.md file in each language folder.
• Plagiarism is highly discouraged and a plagiarized PR won't be accepted at all and will be marked as spam.
• PR should be created within a week of you being assigned to it.
• At no point of time, you can claim more than 4 issues i.e. you can have at max 4 working issues, for this repository, at any point of time.

Where to upload the files

PLEASE READ THIS

• Your files should be uploaded directly into the corresponding folder (e.g. if you wrote code for a Data Structure in C-Plus-Plus, it goes inside the C-Plus-Plus folder and so on)
• Edit the corresponding README.md file to add the link to your code in the corresponding section (GitHub Markdown Guide)
• Under no circumstances create new folders within the language folders to upload your code unless specifically told to do so.

Don't know how to create a PR? Refer this: Steps to create a PR

Maintainers for this project (Refer this for Instructions specific to Maintainers)

• Manan - @manan025

Special Thanks to @sukritishah15 for other resources.

License

This project follows the MIT License.

SHOW SOME LOVE BY LEAVING A ⭐

ds-algo-zone's Issues

Partition equal subset sum

🚀 Feature

writing code for partition equal subset sum problem

Have you read the Contribution Guidelines?

Yes

Pitch

Contributing to the DP portion

Assignees

(Do not make changes in this section until asked to do so)
C - @Yash091
C# -
C++ - @Palak-2109
Go -
Java -
Javascript -
Kotlin -
Python - @ajaynair710

Selection Sort

🚀 Feature

Selection Sort - an algorithm used to sort an array.

Have you read the Contribution Guidelines?

Yes

Pitch

Basic Sorting Algorithm

Assignees

(Do not make changes in this section until asked to do so)
C - @omjasharma
C# -
C++ - @Sahilnegi-code
Go - @gopheramit
Java - @Jvs21
Javascript - @pabloescoder
Kotlin -
Python - @SOURAB-BAPPA

Jump Search

🚀 Feature

Jump Search is a searching algorithm for sorted arrays. The basic idea is to check fewer elements (than linear search) by jumping ahead by fixed steps or skipping some elements in place of searching all elements.

Have you read the Contribution Guidelines?

YES

Pitch

In Jump search, Instead of traversing the whole array one by one in linear fashion, we traverse the array by jumping ahead with fixed size steps to find the required element in less number of steps.It has an advantage in terms of Time complexity over Linear search.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @J-e-e-t
Go -
Java -
Javascript -
Kotlin -
Python -

Djikstra's Algorithm

🚀 Feature

Implement Djikstra's Algorithm to find the single source shortest path in graph.

Have you read the Contribution Guidelines?

yes

Pitch

Using set and unordered map and distance vector.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @vedant-jain03
Go -
Java - @jfernancordova
Javascript -
Kotlin -
Python - @yashikajotwani12

Topological Sorting

🚀 Feature

Topological Sorting is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering. Topological Sorting for a graph is not possible if the graph is not a DAG.

Have you read the Contribution Guidelines?

YES

Pitch

Topological Sorting is advanced algorithm mainly used for scheduling jobs from the given dependencies among jobs

Assignees

(Do not make changes in this section until asked to do so)
C - @arihantthriwe
C# - @codesanta142
C++ - @Yash091
Go -
Java -
Javascript -
Kotlin -
Python -

0/1 Knapsack

🚀 Feature

Implementing 0/1 knapsack in cpp and analysing its complexities

Have you read the Contribution Guidelines?

Yes

Pitch

DP plays an important role during CP. Therefore, adding it.

Assignees

(Do not make changes in this section until asked to do so)
C - @Yash091
C# -
C++ - @AmbikeshArman
Go -
Java - @vinayakj592
Javascript -
Kotlin -
Python - @Aaryan8751

Bi-partite Graph

🚀 Feature

the graph such that we can divide the graph into 2 different subset or we can color every node of the graph such that two adjacent node should not have same color.

Have you read the Contribution Guidelines?

Yes

Pitch

using dfs and unordered map

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @vedant-jain03
Go -
Java -
Javascript -
Kotlin -
Python -

Linear Search

🚀 Feature

Linear Search - search for the element matching each element in the array.

Have you read the Contribution Guidelines?

Yes

Pitch

Basic Searching Algorithm

Assignees

(Do not make changes in this section until asked to do so)
C - @shashank-suresh
C# -
C++ - @jagritvats
Go - @gopheramit
Java - @Jvs21
Javascript - @lokeshn011101
Kotlin - @NeerajKumar201
Python - @krishna16sharma

Vertical Traversal of Binary tree

🚀 Feature

We will be printing a binary tree in vertical order.
Input:

Output: 4,2,1,5,3,6
Explanation:
As we can see there are 5 vertical lines which can pass through the tree -
1st vertical line - 4
2nd vertical line - 2
3rd vertical line - 1,5
4th vertical line - 3
5th vertical line - 6

Have you read the Contribution Guidelines?

Yes

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @tm2k23
Go -
Java - @ishika22
Javascript -
Kotlin - @sumanthtatipamula
Python - @prakharshukla48

Union-Find Data Structure (UFDS)

🚀 Feature

Union-Find Data Structure (also known as Disjoint Set Union) is a fast data structure to add, merge, or find a the head of a set.

Have you read the Contribution Guidelines?

Yes

Pitch

UFDS can be used to find cycles, connected components, and many more.

Assignees

Python - @CrapTheCoder
C++ - @jaisat

Floyd's alogorithm

🚀 Feature

This algorithm helps us to detect and remove cycles from a linked list

Have you read the Contribution Guidelines?

Yes

Pitch

This can be obtained by using 2 nodes - fast and slow which can detect loops and also remove them if present

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @yashikajotwani12
Go -
Java - @ishika22
Javascript -
Kotlin -
Python - @vedant-jain03

Stack implementation using array

🚀 Feature

Implement stack in c using array and perform various stack operations.

Have you read the Contribution Guidelines?

Yes

Pitch

One of the basic data structures when getting started with dsa

Assignees

C - @KMayank02
C# -
C++ - @saiteja-2731
Go -
Java - @nithintata
Javascript - @prasanna16-12
Kotlin - @sumanthtatipamula
Python - @Rushijaviya

Insertion in Linked List

🚀 Feature

Insertion In a Linked List

Have you read the Contribution Guidelines?

YES

Pitch

Important Topic - Asked in many company's interviews

Assignees

(Do not make changes in this section until asked to do so)
C - @nakullondhe
C# - @DoyelA
C++ - @saloni33
Go -
Java - @CC-KEH
Javascript -
Kotlin -
Python -

DFS and BFS Traversal in Undirected Graphs

🚀 Feature

DFS and BFS traversal in an Undirected Graph

Have you read the Contribution Guidelines?

YES

Pitch

Since it is the backbone of graph theory, so it would be extremely important to include this file

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @Mudit018
Go -
Java -
Javascript -
Kotlin -
Python -

Longest substring without repeating characters

Hey, I am participating in hacktoberfest, I world like to contribute Longest substring without repeating characters problem for string ,could you please assigned it to me.

Insertion Sort

🚀 Feature

Insertion Sort - an algorithm used to sort an array.

Have you read the Contribution Guidelines?

Yes

Pitch

Basic Sorting Algorithm

Assignees

(Do not make changes in this section until asked to do so)
C - @anushkarthik05
C# -
C++ - @jagritvats
Go - @gopheramit
Java - @Onkar627
Javascript - @jagritvats
Kotlin - @shauryam-exe
Python - @Rushijaviya

DFS and BFS in a 2D grid

🚀 Feature

DFS and BFS traversal in a 2d grid

Have you read the Contribution Guidelines?

YES

Pitch

As DFS and BFS are the backbones of graphs and they are especially important in 2d grids.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @Mudit018
Go -
Java - @jfernancordova
Javascript -
Kotlin -
Python -

Could work on adding few More Searching and sorting algo

Fibonacci Series

🚀 Feature

Fibonacci series -> Every element is the sum of the previous 2 elements and the first 2 elements are 0 and 1 respectively.

Have you read the Contribution Guidelines?

Yes

Pitch

Brute force algorithm

Assignees

(Do not make changes in this section until asked to do so)
C - @JatinKumarMahaldar
C# - @DoyelA
C++ - @tm2k23
Go - @gopheramit
Java - @SUDHANSHKESHARWANI
Javascript - @ADV1K
Kotlin - @Diegoslourenco
Python - @Noxbolt

Segment Tree

🚀 Feature

A segment tree is a data structure used to store information about array segments and answer segment queries efficiently.

Have you read the Contribution Guidelines?

Yes

Pitch

The important and advanced algorithm used in competitive programming.

Assignees

(Do not make changes in this section until asked to do so)
C - @Mudit018
C# -
C++ - @saloni33
Go -
Java -
Javascript -
Kotlin -
Python -

Gold mine problem using DP

🚀 Feature

Find out the maximum amount of gold, miner can collect using DP. A gold mine of m*n dimensions is given, each element contains a positive integer which is the amount of gold. Initially miner starts from first column but, from any row. Then start moving towards the cell diagonally up right or right or diagonally down right.

Have you read the Contribution Guidelines?

Yes

Pitch

This is a very popular question of DP, asked in many interviews. Please assign this task to me for JAVA.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @anushkarthik05
Go -
Java - @nikhil072000
Javascript -
Kotlin -
Python -

Merge Sort for Arrays

🚀 Feature

Merge Sort - a popular sorting algorithm to sort arrays.

Have you read the Contribution Guidelines?

Yes

Pitch

Basic Sorting Algorithm

Assignees

(Do not make changes in this section until asked to do so)
C - @Yasas4D
C# -
C++ - @vinayakj592
Go - @parth93QA
Java - @Jvs21
Javascript - @Onkar627
Kotlin -
Python - @Yasas4D

unbounded knapsack

🚀 Feature

Adding codes and explanation of unbounded knapsack using top down array-DP in cpp

Have you read the Contribution Guidelines?

yes

Pitch

DP plays an important role during competitive programming. Thus, thought to add this one.

Assignees

@Palak-2109 - C++
@lokeshn011101 - Javascript
@sudhir512kj - Python

Insertion And Deletion of Node in Binary Search Tree

🚀 Feature

Insertion And Deletion of Node in Binary Search Tree

Have you read the Contribution Guidelines?

Yes

Pitch

Because Binary search trees are implemented efficiently and operations like insertion, deletion are quite faster.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @saloni33
Go - @gopheramit
Java -
Javascript -
Kotlin -
Python -

Linked list is palindrome

🚀 Feature

Check if a singly linked list is palindrome

Have you read the Contribution Guidelines?

Yes

Pitch

I would like to contribute the program for check if a singly linked list is palindrome in java, could you please assign it to me.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# - @Sachin-Liyanage
C++ - @yashikajotwani12
Go -
Java - @sachin4627
Javascript -
Kotlin -
Python - @sudhir512kj

Tarjan's algorithm for SCC

🚀 Feature

Tarjan's algorithm is used to find the single connected component in a directed graph.

Have you read the Contribution Guidelines?

YES

Pitch

This is an efficient and advanced algorithm for finding SCC.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @Yash091
Go -
Java -
Javascript -
Kotlin -
Python -

Pascal's Triangle

🚀 Feature

Print n rows of Pascal's Triangle

Have you read the Contribution Guidelines?

Yes

Pitch

Assignees

(Do not make changes in this section until asked to do so)
C - @JatinKumarMahaldar
C# - @Osama-aj
C++ - @tm2k23
Go - @axlts
Java - @vinayakj592
Javascript - @jdrodriguezh
Kotlin -
Python - @Yasas4D

N Queen Problem Backtracking

🚀 Feature

We need to place N chess queens on an N×N chessboard so that no two queens attack each other.

Have you read the Contribution Guidelines?

Yes

Pitch

This is a very common problem which uses the concept of backtracking. Initially we can mark a box as taken and if in further steps we find that the queen might be attacked, we can backtrack and remove our queen from that position.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @vedant-jain03
Go -
Java - @ishika22
Javascript -
Kotlin - @sgaurav37533
Python - @Abhiram-Joshi

Quick Sort

🚀 Feature

Sorting algorithm - QuickSort

Have you read the Contribution Guidelines?

Yes

Pitch

Standard sorting algorithm

Assignees

(Do not make changes in this section until asked to do so)
C - @JatinKumarMahaldar
C# - @Sachin-Liyanage
C++ - @wimanshaherath
Go - @gopheramit
Java - @vinayakj592
Javascript - @Athi223
Kotlin - @sumanthtatipamula
Python - @tejasanand

Binary Tree Recursive Traversals ( Inorder , Preorder , Postorder )

🚀 Feature

I would like to add all 3 traversals of the binary tree recursively

Have you read the Contribution Guidelines?

Yes

Assignees

(Do not make changes in this section until asked to do so)
C - @Mudit018
C# -
C++ - @tm2k23
Go -
Java - @jfernancordova
Javascript - @prasanna16-12
Kotlin -
Python - @prakharshukla48

Row with minimum number of 1's

🚀 Feature

Given a 2D binary matrix A of dimensions NxM, determine the row that contains a minimum number of 1's.

Have you read the Contribution Guidelines?

Yes

Pitch

It is one of the famous problem asked in Amazon interview, in which we need to find the row minimum number of 1s in a matrix

Assignees

@AparnaJuhi - C++
@Anurag-Bhatt - Java
@mtwn105 - Javascript
@Rushijaviya - Python
@sumanthtatipamula - Kotlin

Min number of 1s in java

🚀 Feature

The java program find the row with least number of rows and print them along with their elements

Have you read the Contribution Guidelines?

YES

ISSUE

ISSUE #9 solved

Maximum Sum Increasing Subsequence

🚀 Feature

Maximum Sum Increasing Subsequence (Dp)

Have you read the Contribution Guidelines?

Yes

Pitch

Implementing this by using Dynamic Programming Approach

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @yashikajotwani12
Go -
Java - @LalithyaManasaPatri
Javascript -
Kotlin -
Python - @vedant-jain03

Kaden's Algorithm

🚀 Feature

Kaden's algorithm

Have you read the Contribution Guidelines?

Yes

Pitch

.

Assignees

(Do not make changes in this section until asked to do so)
C - @ravi0213
C# -
C++ - @yashikajotwani12
Go -
Java - @sachin4627
Javascript - @KajalBhalghare
Kotlin -
Python - @sudhir512kj

K stacks in a single array

🚀 Feature

I would like to add an algorithm that implements K stacks in a single array

Have you read the Contribution Guidelines?

Yes

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @tm2k23
Go -
Java -
Javascript -
Kotlin -
Python -

Longest Substring Without Repeating Characters

🚀 Feature

Given a string s, find the length of the longest substring without repeating characters.

Example 1:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.

Example 2:
Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:
Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Example 4:
Input: s = ""
Output: 0

Have you read the Contribution Guidelines?

yes

Pitch

• 0 <= s.length <= 5 * 104
• s consists of English letters, digits, symbols and spaces.

Assignees

@SOURAB-BAPPA - Python
@saiteja-2731 - C++
@siddharthgangwar25 - C
@nithintata - Java
@Devenkapoor7303 - Javascript
@CarleenSinton - C#

Level Order Traversal in Binary Search Tree

🚀 Feature

Level Order Traversal in Binary Search Tree (BST)

Have you read the Contribution Guidelines?

Yes

Pitch

This is issued to solve many questions in competitive coding and is more efficient.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @saloni33
Go -
Java - @ishika22
Javascript -
Kotlin -
Python -

Bubble Sort

🚀 Feature

Implement Bubble Sort. Do add Sample Input/Output, Time and Space Complexity at the bottom of the file (inside a comment).

Have you read the Contribution Guidelines?

Yes

Pitch

A very basic and standard sorting algorithm.

Assignees

@TarushS - Python
@SOURAB-BAPPA - C
@LalithyaManasaPatri - Java
@lokeshn011101 - Javascript
@shauryam-exe - Kotlin
@dvir019 - C#

sieve of eratosthenes

🚀 Feature

Sieve of eratosthenes is the algorithm to find all the prime numbers less than or equal to a given integer n.

Have you read the Contribution Guidelines?

Yes

Pitch

Many companies focus on more advanced algorithms and sieve of eratosthenes is used frequently in many questions and is also an advanced algorithm.

Assignees

(Do not make changes in this section until asked to do so)
C - @gaurav1058
C# - @Osama-aj
C++ - @Yash091
Go - @lucblassel
Java - @sachin4627
Javascript -
Kotlin -
Python - @Noxbolt

DNF SORT

🚀 Feature

DNF sort

Have you read the Contribution Guidelines?

yes

Pitch

3 random number can be sorted in linear time that does not consume any extra space

Assignees

(Do not make changes in this section until asked to do so)
C - @tm2k23
C# -
C++ - @SurendarSingh
Go -
Java -
Javascript -
Kotlin -
Python - @99anjali

Morris Traversal of Binary Trees O(1) Space ( Inorder , Preorder )

🚀 Feature

I would like to add morris traversal of binary trees which is done in O(1) space

Have you read the Contribution Guidelines?

Yes

Pitch

=> No recursion
=> No stacks
=> O(1) Space

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @tm2k23
Go -
Java -
Javascript -
Kotlin -
Python -

Kadane’s Algorithm: Largest Sum Contiguous Subarray

🚀 Feature

Implement Kadane’s Algorithm to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum.

Have you read the Contribution Guidelines?

Yes

Pitch

Uses O(1) space and takes O(n) time.

Assignees

(Do not make changes in this section until asked to do so)
C - @anshkush92college
C# -
C++ - @tm2k23
Go -
Java - @Jvs21
Javascript -
Kotlin -
Python - @anushkarthik05

Binary Search

🚀 Feature

Implement Binary Search taking array as input and finding a element taken as input.

Have you read the Contribution Guidelines?

Yes

Pitch

One of the most used searching algorithm.

Assignees

@Palak-2109 - C++
@Safwan310 - Java
@SOURAB-BAPPA - Go
@TarushS - Python
@mendoza - Javascript
@codenipun - Kotlin
@shashank-suresh - C

Euclid Algorithm for GCD (Greatest common divisor)

🚀 Feature

(Write down a clear and concise description of what the feature is.)

Have you read the Contribution Guidelines?

(Write your answer here.)
Yes , I read all the guidlines .

Pitch

(Please explain why this feature should be implemented and how it would be used.)
It is the best way of finding the Greatest Common Divisor .
Euclid Algo -> According to this algorithm if b is smaller than a.
gcd(a,b) = gcd(a-b, b)
Let g be GCD of a and b
a = gx , b = gy and GCD(x,y) = 1
(a-b) = g(x-y)

Assignees

(Do not make changes in this section until asked to do so)
C - @Ashutoshpandey-coder
C# -
C++ - @tm2k23
Go -
Java - @Ashutoshpandey-coder
Javascript -
Kotlin -
Python - @Noxbolt

Tower of Hanoi (Recursive,Non-Recursive)

🚀 Feature

Tower of Hanoi Algo. Using Recursive and Non-Recursive 3 discs
(Write down a clear and concise description of what the feature is.)

Have you read the Contribution Guidelines?

(Yes.)

Pitch

Since it is asked in a lot of interviews. It is important to know about it and I have codes working up to 3 disc.
Assign this to me for C.

Assignees

Recursive

C - @LikhithaTadikonda
C# -
C++ - @Mudit018
Go - @nakullondhe
Java - @jdrodriguezh
Javascript - @SurendarSingh
Kotlin -
Python - @TarushS

Non Recursive

C - @LikhithaTadikonda
C# -
C++ - @Kshma29
Go -
Java - @Onkar627
Javascript -
Kotlin -
Python - @jAY1jS

Kruskal's Minimum Spanning Tree

🚀 Feature

Find the Minimum Spanning Tree using Kruskal's algorithm

Have you read the Contribution Guidelines?

Yes

Pitch

Kruskal's minimum spanning tree is used to find the minimum sum tree of an undirected graph, which has many practical uses (such as in maps)

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @CrapTheCoder
Go -
Java - @jfernancordova
Javascript -
Kotlin -
Python -

Palindrome Check

🚀 Feature

Will check if the string is palindrome i.e. if the original string is the same as the string after reversing.

Have you read the Contribution Guidelines?

Yes

Pitch

Basic algorithm

Assignees

C - @anushkarthik05
C# - @mtwn105
C++ - @Anurag331
Go - @SOURAB-BAPPA
Java - @pabloescoder
Javascript - @Onkar627
Kotlin - @cb4d
Python - @ajaynair710

Kaden's algorithm

Hey, I am Participating in hacktoberfest, I would like to contribute Kaden's algorithm, Could you please assigned it to me.
Thank you!

Merging Two Sorted Linked lists

🚀 Feature

Merge two sorted linked lists

Have you read the Contribution Guidelines?

Yes

Pitch

Important and basic operation with linked list.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @Sakshi2020037
Go -
Java - @sachin4627
Javascript -
Kotlin -
Python -

Shortest Path in Unweighted Graph using BFS

🚀 Feature

Shortest path from one node to another node in an unweighted graph using Breadth First Search.

Have you read the Contribution Guidelines?

Yes

Pitch

Complexity of this algorithm: O(V+E)
Complexity of Dijkstra algorithm: O(V^2) when unoptimized, or O(V + E log V) when optimized using Priority Queue.

This algorithm is faster than the popular Dijkstra Algorithm, and is also far simpler, as it only uses a Breadth First Search.