Algorithms

This repository contains a couple of some of the common algorithms on DSA. So feel free to contribute algorithms which are not already there.

How to contribute

Fork the repository from the bottom right corner and visit to your forked repository.
Clone the repository in your terminal using command git clone <url>.
After cloning, create a branch git checkout -b <branch-name>.
Make contribution to the repo and add all changes using git add . or git add <filename>.
Create a commit with a commit message git commit -m <commit-msg>.
After commiting, push the changes to origin using command git push origin <branch-name>.
Create a pull request and wait for your pull request to be merged.

Things to keep in mind while contributing

Make sure the algorithm you are contributing is not already there in the repo otherwise your PR will not be merged.
Also include problem statement in your algorithm file.
Contribute in the correct folder only.

Name		Name	Last commit message	Last commit date
Latest commit History 344 Commits
.vscode		.vscode
Algorithms		Algorithms
Basic Calculator website		Basic Calculator website
CPP_Basics		CPP_Basics
DataStructuresUsingClasses		DataStructuresUsingClasses
Dynamic-Programming-Package		Dynamic-Programming-Package
11. Container With Most Water		11. Container With Most Water
111.minimum-depth-of-binary-tree.cpp		111.minimum-depth-of-binary-tree.cpp
16. 3Sum Closest.java		16. 3Sum Closest.java
1812. Determine Color of a Chessboard Square		1812. Determine Color of a Chessboard Square
215.kth-largest-element-in-an-array.cpp		215.kth-largest-element-in-an-array.cpp
234.palindrome-linked-list.cpp		234.palindrome-linked-list.cpp
236.lowest-common-ancestor-of-a-binary-tree.cpp		236.lowest-common-ancestor-of-a-binary-tree.cpp
57.LFU Cache.cpp		57.LFU Cache.cpp
958.check-completeness-of-a-binary-tree.cpp		958.check-completeness-of-a-binary-tree.cpp
Algorithms_Reverse_a_linked_list.cpp		Algorithms_Reverse_a_linked_list.cpp
Alien_dictionary.cpp		Alien_dictionary.cpp
BANKERS-ALGO.cpp		BANKERS-ALGO.cpp
BUCKETSORT.py		BUCKETSORT.py
BellmanFord.cpp		BellmanFord.cpp
BinaryTree.c		BinaryTree.c
CONTRIBUTING.md		CONTRIBUTING.md
Divisibility_by_2^n.cpp		Divisibility_by_2^n.cpp
Equal_Binary_Subsequences.cpp		Equal_Binary_Subsequences.cpp
Heap.cpp		Heap.cpp
If-else statment.cpp		If-else statment.cpp
Kth largest.cpp		Kth largest.cpp
LCS_dp.cpp		LCS_dp.cpp
Largest_Rectangle_in_Histogram.cpp		Largest_Rectangle_in_Histogram.cpp
Level Order Binary Tree Traversal		Level Order Binary Tree Traversal
Palindrome_Partition.cpp		Palindrome_Partition.cpp
Peak Index of an Mountain Array.cpp		Peak Index of an Mountain Array.cpp
QueueStacks.c		QueueStacks.c
README.md		README.md
SparseMat.cpp		SparseMat.cpp
Substrings of length k with k-1 distinct elements.java		Substrings of length k with k-1 distinct elements.java
SwapNodesInPairs.c		SwapNodesInPairs.c
Two Sum		Two Sum
Two_Knights.cpp		Two_Knights.cpp
XOR Encryption by Shifting Plaintext.cpp		XOR Encryption by Shifting Plaintext.cpp
ascii.cpp		ascii.cpp
cabFinder.cpc.txt		cabFinder.cpc.txt
combinationSum.cpp		combinationSum.cpp
cutting_a_rod.cpp		cutting_a_rod.cpp
doubly_linked_list.cpp		doubly_linked_list.cpp
fibo.py		fibo.py
gold_min_problem.cpp		gold_min_problem.cpp
kthSmallestElement.cpp		kthSmallestElement.cpp
leapyear.c		leapyear.c
longest-palindromic-subsequence.cpp		longest-palindromic-subsequence.cpp
number-of-weak-characters-in-the-game.java		number-of-weak-characters-in-the-game.java
palindrome.cpc.txt		palindrome.cpc.txt
prims's_algo.cpp		prims's_algo.cpp
radixsort.c		radixsort.c
simple_sieve.cpp		simple_sieve.cpp
sortbubble.cpp		sortbubble.cpp
subset_sum_problem.cpp		subset_sum_problem.cpp
threedice.cpp		threedice.cpp
treetraversal.cpp		treetraversal.cpp

giyasht/Algorithms

Folders and files

Latest commit

History

Repository files navigation

Algorithms

How to contribute

Things to keep in mind while contributing

About

Topics

Resources

Stars

Watchers

Forks

Languages