lakshaysk106 / algorithms

🌱Contribute in Hacktoberfest 2022 by contributing Data Structures and Algorithms Code in any programming language. Create your own issues. ✨Star it 🍴Fork it and Contribute to it <3

HACTOBERFEST 2022 🎯

Special Note For Everyone 🎃

'''
Always make more than 4 pull requests. If you have made only 4 pull requests to different
projects and if one of those projects is excluded from the Hacktoberfest event, then that
pull request will not be counted, leaving you with only 3 valid pull requests if those projects
are not excluded.

If you fail to make 4 valid pull requests, you won't be eligible for swags or t-shirts.

I recommend that you make pull requests to your own repository, as this is a very safe option
for you. Just ensure that your repository has the Hacktoberfest topic.
'''

Data Structures and Algorithms Repository

✨Star it :fork_and_knife:Fork it and Contribute to it <3

Getting started

• Fork this repository (Click the Fork button in the top right of this page, click your Profile Image)
• Clone your fork down to your local machine

https://github.com/LakshaySK106/Algorithms.git

• Create a branch

git checkout -b branch-name

• Make your changes (choose from any task below)
• Commit and push

git add .
git commit -m 'Commit message'
git push origin branch-name

• Create a new pull request from your forked repository (Click the New Pull Request button located at the top of your repo)
• Wait for your PR review and merge approval!
• Star this repository if you had fun!

Contributing🌱

Before creating a PR or issue, please do the following:
Check the [Contribution](CONTRIBUTING.md) Guide.<br>

Contributors

License

By contributing, you agree that your contributions will be licensed under its MIT License.

algorithms's Issues

Add Std. Problems to Recursion

Add Implementation and problems statement of Josephus Problem in recursion

Implement Floyd Warshall Algorithm

Objective: To implement Floyd Warshall Algorithm in your preferred language with the best possible Time and Space complexity.

Add it to the existing "Greedy Algo" directory otherwise create it.

Dijkstra’s Shortest Path Algorithm

Objective: To implement Dijkstra’s Shortest Path Algorithm in your preferred language with the best possible Time and Space complexity.

Add it to the existing "Greedy Algo" directory otherwise create it.

Quick_Sort program in C

I want to add Quick program in C language. Please assign this issue to me.

Implement BFS for graph

Objective: Implement BFS traversal for a connected graph

Add Staircase Problem to Recursion

Add the Staircase problem to recursion and state its implementation and problem statement

Tug Of War Problem

I can code the famous Tug Of War problem efficiently. Problem statement - Given a set of n integers, divide the set in two subsets of n/2 sizes each such that the absolute difference of the sum of two subsets is as minimum as possible. Please assign @LakshaySK106

Implementations of different Data Structures

Objective: Add implementations of different Data Structures(Stack, Queue, Circular Queue, Tree, Binary Tree, Binary Search Tee, B-Tree, B+ Tree, Fibonacci Heap, Priority Queue, Threaded Binary Tree, Trie, Graphs, Disjoint Set, etc.

AVOID DUPLICATES
CREATE NEW DIRECTORY "Data Structure" >> "Language Folder(Cpp, Python, Java, etc)" IF NOT EXISTS.

Rat in a maze

Objective: WAP to solve Rat in a Maze problem using backtracking

DP word break problem

Please assign this problem to me.

Binary Insertion Sort

Objective: WAP for implementation of binary insertion sort

Round Robin Scheduling in C

I want to add code in round robin scheduling algorithm in C language. Please assign me this issue.

Implement DFS for graph

Objective: Implement DFS traversal for a connected graph

Implement Kosaraju’s algorithm

Problem statement:

You are given an unweighted directed graph having 'V' vertices and 'E' edges. Your task is to count the number of strongly connected components (SCCs) present in the graph.

A directed graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of a graph are the subgraphs which are themselves strongly connected.

N Queen Problem

Objective: WAP to solve N Queen Problem in your preferred language with the best possible Time and Space complexity.

Add it to the existing "Backtracking" directory otherwise create it.

Implement iterative Merge Sort Algorithm

Objective: WAP for iterative merge sort algorithm with best time and space complexity.

Add Kosaraju's Algorithm for finding strongly connected components

Hi, I can add code for Kosaraju 's algo in Cpp. Please assign @LakshaySK106

Selection Sort

Objective: WAP for implementation of Selection Sort using C++

Algorithm for Randomising an Array

Implementation of an Algorithm to randomize an array. #Fisher-Yates Shuffling Algorithm

Prim’s Minimum Spanning Tree (MST) Algorithm

Objective: To implement Prim’s Minimum Spanning Tree (MST) Algorithm in your preferred language with the best possible Time and Space complexity.

Add it to the existing "Greedy Algo" directory otherwise create it.

kadanes algorithm

want to add and algorithm which is used to find the maximum sum subarray .

The Knight’s tour problem

Objective: WAP to solve The Knight’s tour problem in your preferred language with the best possible Time and Space complexity.

Add it to the existing "Backtracking" directory otherwise create it.

Hamiltonian Cycle problem

Objective: WAP to solve Hamiltonian Cycle Problem in your preferred language with the best possible Time and Space complexity.

Add it to the existing "Backtracking" directory otherwise create it.

Implement KMP Algorithm for Pattern Searching

Objective: WAP for the implementation of KMP(Knuth Morris Pratt) pattern searching algorithm.

Add this algorithm to the Searching directory inside the respective language folder.

palindrome linked list

Kruskal’s Minimum Spanning Tree Algorithm

Objective: To implement Kruskal’s Minimum Spanning Tree Algorithm in your preferred language with the best possible Time and Space complexity.

Add it to the existing "Greedy Algo" directory otherwise create it.

Add a few standard problems solved using monotonic stack

Objective: Create a new directory "Stack" and inside it create a new folder respective to your programming language. Add all your codes to this folder.

Huffman Coding

Objective: WAP to implement Huffman coding algorithm with O(N log N)time complexity and O(N) space complexity.