shivanshugarg12800 / algo_gt

This is the Master Repository for all the different algorithms in the world of DSA, be it in any language C++, Java, Python etc.....

Hello, folks!

I'm currently pursuing B.Tech in Information Technology from Maharaja Agrasen Institute of Technology, Delhi. Being an IT student, I have tried hands on different technologies and here is a brief summary of what I've done so far and planning to do

• Competitive Programmer in C++ with not so good achievements yet 😅, you can go have a look at my coding profiles featured down here 👇

       

• The internet and different content available on the web fascinated me so much to learn the most in-demand skill of nowadays. I have sound knowledge MERN Stack of Web development.

Languages and Technologies:

                          

📈 GitHub Stats

Connect with me 😄

        

algo_gt's Issues

N Queen Problem

Is your feature making a change to an existing problem/algorithm
yes

If you are making changes, please describe the type of change in brief else NA
N queen problem using Backtracking Concept in java language under a new folder called Recursion.

Describe in brief about what new problem/algorithm addition
The idea is to place queens one by one in different columns, starting from the leftmost column. When we place a queen in a column, we check for clashes with already placed queens. In the current column, if we find a row for which there is no clash, we mark this row and column as part of the solution. If we do not find such a row due to clashes then we backtrack and return false

Add Sliding window questions in ArrayString folder

Is your feature making change to an existing problem/algorithm
no

If you are making changes, please describe the type of change in brief else NA
Java/Minimum_sliding_questions

Describe in brief about what new problem/algorithm addition
find-maximum-minimum-sum-subarray-size-k
Link : https://www.geeksforgeeks.org/find-maximum-minimum-sum-subarray-size-k/

Implement pow(x, n), which calculates x raised to the power n

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Print all distinct subsets of a given set

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

FindKthBithInNthString java file

Is your feature making change to an existing problem/algorithm
yes

If you are making changes, please describe the type of change in brief else NA
I will add a problem of leetcode named findkthbitinnthstring in java folder.

Describe in brief about what new problem/algorithm addition
this problem uses recursion.

please assign this to me @shivanshugarg12800

Recaman’s sequence

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

LCMofTWOINTEGERS

Is your feature making change to an existing problem/algorithm
no

If you are making changes, please describe the type of change in brief else NA
NA

Describe in brief about what new problem/algorithm addition
problem to find LCM of two integers.

Spiral Matrix

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Add Stack directory in Java folder and interview bit questions.

Is your feature making a change to an existing problem/algorithm
no

If you are making changes, please describe the type of change in brief else NA
Java/Stacks

Describe in brief about what new problem/algorithm addition
Nearest Smaller Element
https://www.interviewbit.com/problems/nearest-smaller-element/

Heap Sort

Is your feature making change to an existing problem/algorithm
answer in yes or no
No

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.
NA

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.
Heap Sort one the efficient sorting algorithm.

Zig-Zag Traversal of a Binary Tree

Is your feature making change to an existing problem/algorithm
yes

If you are making changes, please describe the type of change in brief else NA
I want to provide a java code for the implementation of binary trees using Zig-Zag traversal in a new folder called Trees.

Describe in brief about what new problem/algorithm addition
This problem can be solved using two stacks. Assume the two stacks are current: current level and next level. We would also need a variable to keep track of the current level order(whether it is left to right or right to left).

Create Tower of Hanoi - Recursion

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Quick Sort

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Check if a number is Palindrome

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

..

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Conway's game of life

Is your feature making change to an existing problem/algorithm
No

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A very famous game created by John Horton Conway. It is a zero-player game. It is a fundamental part of DSA.

Add Heapsort implementation using array

Is your feature making change to an existing problem/algorithm
no

If you are making changes, please describe the type of change in brief else NA
folder= C++/ SearchingSorting

Describe in brief about what new problem/algorithm addition
Heapsort implementation

Prims algorithm

Is your feature making change to an existing problem/algorithm
answer in yes or no
No
If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.
No
Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.
Prim's algorithm, is one of the algorithm to find a minimum spanning tree.

Add a double-ended queue code in python

Is your feature making change to an existing problem/algorithm
no

If you are making changes, please describe the type of change in brief else NA
NA

Describe in brief about what new problem/algorithm addition
Add a double-ended queue code in python.

Tower of Hanoi

Tower of Hanoi is a mathematical puzzle which shows the process of how counting could be seen as a recursive process, involving two solutions one recursive and one binary.

Rod Cutting Problem (DP)

Is your feature making change to an existing problem/algorithm
No

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
Given the price of different sub-lengths of a rod, find the optimal way to cut the rod to get the maximum price

Sample issue

Is your feature making change to an existing problem/algorithm
No

If you are making changes, please describe the type of change in brief else NA
Adding the XYZ algorithm in the abc folder

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Binary to Gray code using recursion

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Find the Winner of the Circular Game - 1823 Leetcode

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Add recursive algorithms

• Rope cutting problem
• Josephus problem
• Fibonacci series
• Subset-sum problem

Reverse a stack using Recursion - Interview question

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Adding String-substring Question in ArrayString Folder

Is your feature making change to an existing problem/algorithm
no

If you are making changes, please describe the type of change in brief else NA
folder= C++/ArrayString

Describe in brief about what new problem/algorithm addition
In this question We have to find number of Substrings that starts with vowel and ends with consonants , vis a vis.
problem link= [https://www.interviewbit.com/problems/vowel-and-consonant-substrings/]

Dungeon Game 174 LeetCode

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Dijsktra algorithm in graph

Is your feature making a change to an existing problem/algorithm
yes

If you are making changes, please describe the type of change in brief else NA
Dijkstra's Algorithm Implementation in java language will come under the graph folder.

Describe in brief about what new problem/algorithm addition
Given a graph and a source vertex in the graph, find the shortest paths from the source to all vertices in the given graph.Dijkstra's Algorithm is used to solve this problem.

Modifying some files for better efficiency

Is your feature making change to an existing problem/algorithm
Yes

If you are making changes, please describe the type of change in brief else NA
I am modifying some files for better efficiency and every one is free to add some new features or modify.

Python Code for the existing algorithms

Is your feature making change to an existing problem/algorithm
Yes

If you are making changes, please describe the type of change in brief else NA
The algorithms present are available in c++ and java, I would like to add the python code for the algorithms.

Describe in brief about what new problem/algorithm addition
Python code for all the algorithms

Quickselect Algorithm

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Longest Substring Without Repeating Characters

Is your feature making a change to an existing problem/algorithm
yes

If you are making changes, please describe the type of change in brief else NA
Given a string s, find the length of the longest substring without repeating characters. This problem will be added in java language.

Describe in brief about what new problem/algorithm addition
the idea is, keep a hashmap that stores the characters in a string as keys and their positions as values, and keep two pointers that define the max substring. move the right pointer to scan through the string, and meanwhile update the hashmap. If the character is already in the hashmap, then move the left pointer to the right of the same character last found. Note that the two pointers can only move forward.

Add Stack directory in Java folder and Geek for geeks questions

Is your feature making change to an existing problem/algorithm
no

If you are making changes, please describe the type of change in brief else NA
Java/Stacks

Describe in brief about what new problem/algorithm addition
Maximum Rectangular Area in a Histogram
Link to the problem: https://www.geeksforgeeks.org/largest-rectangle-under-histogram/

Bounded-Knapsack Unbounded-knapsack DP

Is your feature making change to an existing problem/algorithm
NO

If you are making changes, please describe the type of change in brief else NA
NA

Describe in brief about what new problem/algorithm addition
Knapsack and Unbounded Knapsack are two basic strategies for solving questions of DP. Here the problem is of type: we have to select values from n bags having different values each. We have to decide which bag to choose k bags out of n so that our bag gets maximum value. This problem requires optimization and have recursive calls so require DP.

Merge two sorted lined list

Is your feature making change to an existing problem/algorithm
answer in yes or no
No

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.
NA

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.
Merge sorted linked list, it is also one of the most asked questions in placements.
Coded the recursive solution for the same.

Trie implementation in C++

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Decode String - Leetcode 394

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Smaller numbers to left

Is your feature making change to an existing problem/algorithm
Yes

If you are making changes, please describe the type of change in brief else NA
I will add a problem of leetcode smaller numbers in java folder.

Describe in brief about what new problem/algorithm addition
Here we use merge sort algorithm to find the number of smaller numbers to right to number in given array.

Please assign this to me @shivanshugarg12800

Find all interleaving of given strings

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Add Stack directory in Java folder and Geeks for geeks questions.

Is your feature making a change to an existing problem/algorithm
no

If you are making changes, please describe the type of change in brief else NA
Java/Stacks

Describe in brief about what new problem/algorithm addition
Stock span problem
Input:7
100 80 60 70 60 75 85
Output: 1 1 1 2 1 4 6
Link to the problem: https://www.geeksforgeeks.org/the-stock-span-problem/

Tower of Hanoi

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Fibonacci Number

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Decimal to binary number using recursion

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Binary Search Algorithm

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Flood Fill Algorithm

Is your feature making change to an existing problem/algorithm
answer in yes or no

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
A clear and concise description about the problem.

Sieve of Eratosthenes

Hello, Can I add Sieve of Eratosthenes in C++ and python?

Optimal Merge Pattern

Optimal merge pattern: When two or more sorted files are to be merged all together to form a single file, the minimum computations are done to reach this file are known as Optimal Merge Pattern.
It is one of the most asked algorithm questions in the technical round of placements.

Strassen’s matrix multiplication algorithm

Is your feature making change to an existing problem/algorithm
No

If you are making changes, please describe the type of change in brief else NA
A clear and concise description of what you want to happen.

Describe in brief about what new problem/algorithm addition
Adding Strassen’s matrix multiplication algorithm to multiply two matrices

Tower of Hanoi

Tower of Hanoi which is a classic puzzle. It can be easily solved by using Recursion.