Lakshay

Hey there, here is my profile readme file as per this repository contributing guidelines.

Dijkstra’s Shortest Path Algorithm

11

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.

Kruskal’s Minimum Spanning Tree Algorithm

4

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

Implement KMP Algorithm for Pattern Searching

3

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.

The Knight’s tour problem

6

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

3

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.

Add a few standard problems solved using monotonic stack

3

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.