lakhankumawat/learncpp

Learn Cpp from Beginner to Advanced ✅ Practice 🎯 Code 💻 Repeat 🔁 One step solution for c++ beginners and cp enthusiasts.

Some Helpful Resources

Youtube channels	Github Repos	Best Coding Playgrounds
CppNuts	Codecademy	Leetcode
The Cherno	johnmcfarlane/begin(C++)	HackerRank
ChiliTomatoNoodle	ratansingh98/CPP-Learning	CodeChef
Bo Qian	sahilbansal17/Get_Better_at_CP_in_2_Months	CodeForces

Coding IDE's	Algorithms	Useful articles
CodeBlocks	Visualisze algorithms through animations	Learn CPP
VS Code	CP Algorithms	CF Blog : Resources for cpp

What's Inside 🗃

• Advanced Data Structures
• Array
• Backtracking
• Bit Manipulation
• Disjoint Set Union
• Divide And Conquer Algorithms
• Dynamic Programming
• Extra
• Graph Algorithms
• Graphs
• Greedy Algorithms
• HashMap
• HashTable
• Heap
• Linked List
• Mathematical Algorithms
• Miscellaneous
• Priority Queue
• Problem Statements and Solution
• Queue
• Recursion
• STL
• Searching Algorithms
• Sets
• Sorting Algorithms
• Stack
• String Algorithms
• Strings
• Template
• Tree
• Trie

Read the following steps before contributing.

Follow Steps	Get Started

Algorithms

	Follow these steps
New Algorithm	'Please see if the algorithm is already present'
What to include	"Your algorithm should be efficiently written with proper code / comments / time complexity / space complexity / link to gfg or any other documentation on top in code file"
Where to include	please commit your algorithm in the correct folder or discuss[here](https://github.com/Lakhankumawat/LearnCPP/discussions/7)before committing to where to include`
README	"Please check whether your directory has a README file, if there is then edit your algorithm name with a link, otherwise create a new one " how your README should look like

Problem Statement

	Follow these steps
New Problem Statement	'Please see if the problem is present already? If it is do not commit your own '
What to include	"Your problem statement solution should be efficiently written with proper code / comments / time complexity / space complexity / link to problem statement in code file"
Where to include	Most of the Problem Statements are insidehereplease commit your problem solution in the correct folder or discuss here before committing for where to include
README	"Please check whether your directory has a README file, if there is then edit your algorithm name with a link, otherwise create a new one " how your README should look like
Additional Context	"There are three levels of problem statement" 1-Level 1 `likewise 2-Level 2 & 3-Level 3, please include your problem statement with a solution in the right level you prefer

To add programs using STL, follow the same approach as Algorithms

Readme

Fond of designing README this section will be helpful to you

	Follow these steps
🆕 New README	'Please see if there is no README in any folder if no? Then please design it, if yes? Then please edit it accordingly to your contribution and follow the guidelines '
🤔 What to include	"Your README should be efficiently and written / link to problem statement in README at the top" see exmaple
✅ Must Contain	1. and explain in brief about addition 2. An Image of addition i.e how it works 3. Mention the Pseudo Code 4. Time and Space Complexities 5. Advantages 6. Disadvantages
🪧 Where to include	Inside the folder where programs are residing, discuss here before committing to where to include

Why contribute?

• If you find any errors or bugs then please report them by creating an issue.
• If you can provide a more efficient solution or implementation of the algorithm then make sure to contribute.
• If you want to implement an algorithm, data structure etc.., which is not yet there, then you can open up a PR regarding the same.
• Link to discussion forum

Want to contribute?

• Take a look at contributing guidelines if you're interested in helping!
• Refer GitHub Flow.

🌟 Stargazers Over Time 🌟

Project Maintainers ❤️

LakhanKumawat ᵖ⁺ 💻 👀 📆	Nikita Sharma 💻 👀 🚧	SK MIRAJ 💻 👀 🚧	Gunjan 💻 👀 🚧	Siddhi Bhanushali 💻 👀 🚧	Pooja Mangal 👀	TRIDIB BAG 👀
Aditi 👀	Vilsi Jain 👀

• Array

#	Problem Statement & Explanation	Solution
1	Array Operations	Solution
2	Antispiral Matrix	Solution
3	Counting Divisibl eSubstrings	Solution
4	First Negative in Every Window	Solution
5	Maximum Sum Subarray	Solution
6	Missing and Repeating Number	Solution
7	Peak in 1D Array	Solution
8	Prefix Sum	Solution
9	Reversing of Array	Solution
10	Sort an Array of 0's 1's and 2's	Solution
11	Best Time to Buy and Sell Stock	Solution
12	Symmetric Matrix	Solution
13	Trace and Normal	Solution

• Backtracking

#	Problem Statement & Explanation	Solution
1	Hamiltonian Cycle	Solution
2	N-Queen	Solution
3	Rat in Maze	Solution
4	Subset Sum	Solution
5	The Knight’s Tour Problem	Solution

• Bit Manipulation

#	Problem Statement & Explanation	Solution
1	Bit Manipulation	Solution
2	Cout Set Bits	Solution
3	Swapping 2 Numbers	Solution

• Disjoint Set Union

#	Problem Statement & Explanation	Solution
1	Disjoint Set Union	Solution

• Dynamic Programming

#	Problem Statement & Explanation	Solution
1	Rod Cutting	Solution
2	Equal Sum Partition Problem	Solution
3	Shortest Common Super-sequence	Solution
4	Trapping Rain Water Problem	Solution
5	Longest Common Subsequence Problem	Solution
6	Egg Dropping Puzzle	Solution
7	Climbing Stairs	Solution
8	Min Cost Climbing Stairs	Solution
9	Unique Paths	Solution
10	Unique Paths II	Solution
11	Minimum Falling Path Sum	Solution
12	Knapsack with Duplicate Items	Solution
13	Minimum number of deletions and insertions required	Solution
14	Coin Change	Solution
15	Kadane's Algorithm	Solution
16	0-1 KnapSack	Solution
17	Traveling Sales Person	Solution
18	Subset Sum	Solution
19	Minimun Insertions form Palindrome	Solution

• Extra

#	Problem Statement & Explanation	Solution
1	Turtle	Solution
2	Projectile	Solution
3	Design	Solution

• Graph Algorithms

#	Problem Statement & Explanation	Solution
1	Multistage Graph Shortest Path	Solution
2	Bellman Ford	Solution
3	Floyd Warshall	Solution
4	Dijsktra Single Source Shortest Path	Solution

• Graphs

#	Problem Statement & Explanation	Solution
1	Articulation Points	Solution
2	Graph Coloring	Solution
3	Check Bipartite	Solution
4	Add and delete edge of directed graph in an adjacency matrix	Solution
5	create and display an adjacency matrix	Solution
6	Adjacency List	Solution
7	Adjacency List Using Hashmap	Solution
8	Prims	Solution
9	Prims using Priority Queue	Solution
10	Kruskal	Solution
11	kruskal DSU	Solution
12	Ford Fulkerson	Solution
13	Breadth First Search	Solution
14	Depth First Search	Solution

• Greedy Algorithms

#	Problem Statement & Explanation	Solution
1	Optimal Merge Pattern	Solution
2	Huffman Coding	Solution
3	Fractional KnapSack	Solution
4	Job Scheduling	Solution
5	Busyman Problem	Solution

• HashMap

#	Problem Statement & Explanation	Solution
1	HashMaps	Solution
2	Map	Solution
3	Multimap	Solution
4	UnorderedMap	Solution
5	UnorderedMaps CustomHashmaps OperatorOverloading	Solution
6	Set	Solution
7	Unordered Set	Solution

• Heap

#	Problem Statement & Explanation	Solution
1	k largest	Solution
2	Min Heap	Solution
3	Max Heap	Solution
4	Heapify	Solution
5	Heap Sort	Solution

• Linked List

#	Problem Statement & Explanation	Solution
1	Singly Linked List	Solution
2	Removing Duplicates	Solution
3	Searching in a linked list	Solution
4	Reverse a Linked List	Solution
5	Middle element of the linked list	Solution
6	Palindrome linked list	Solution
7	Segregate Even Odd	Solution
8	Merge K Sorted LinkedList	Solution
9	LRU Cache	Solution
10	Circular Linked Lists	Explanation
11	Reverse a Doubly Linked List	Solution

• Mathematical Algorithms

#	Problem Statement & Explanation	Solution
1	SegmentedSieve	Solution
2	Armstrong number	Solution
3	Eulid Greatest Common Divisor	Solution
4	Prime Sum	Solution
5	Factorial Larger Numbers	Solution
6	Juggler Sequence	Solution

• Miscellaneous

#	Problem Statement & Explanation	Solution
1	Exception Handling	Solution
2	Lambda Functions	Solution
3	Friend Class	Solution
4	Friend Function	Solution

• Priority Queue

#	Problem Statement & Explanation	Solution
1	Priority Queue	Solution
2	Priority Queue STL Comparator	Solution

• Problem Statements and Solution

#	Problem Statement & Explanation	Solution
1	Aggressive Cows	Solution
2	Pair with given sum in sorted doubly linked list	Solution
3	Maximum of all Subarrays of size k	Solution
4	Lowercase to Uppercase	Solution
5	Counting Frequencies	Solution

• Queue

#	Problem Statement & Explanation	Solution
1	Queue Using Linked List	Solution
2	Queue Using Array	Solution
3	[Queue STL]	Solution
4	Circular Queue Using LinkedList	Solution
5	Reverse Queue	Solution
6	Circular Queue Using Array	Solution

• Recursion

#	Problem Statement & Explanation	Solution
1	Inversion Count	Solution
2	Replace PI	Solution
3	Tower of Hanoi	Solution
4	Calculating GCD and LCM by Recursion	Solution
5	Taylor series by Horner's rule	Solution
6	Types of Recursion	Solution

• STL

#	Problem Statement & Explanation	Solution
1	Pairs STL	Solution
2	Lists-Operation	Solution
3	Lists	Solution
4	Multiset	Solution
5	Sets	Solution
6	Vector	Solution

• Searching Algorithms

#	Problem Statement & Explanation	Solution
1	Linear Search	Solution
2	Binary Search	Solution
3	Search Element in a Rotated Sorted Array	Solution

• Sets

#	Problem Statement & Explanation	Solution
1	Cartesian Product of two Set	Solution
2	Union of two sets	Solution

• Sorting Algorithms

#	Problem Statement & Explanation	Solution
1	Bubble Sort	Solution
2	Insertion Sort	Solution
3	Quick Sort	Solution
4	Merge Sort	Solution
5	Counting Sort	Solution
6	Bucket Sort	Solution
7	DNF Sort	Solution
8	Selection Sort	Solution

• Stack

#	Problem Statement & Explanation	Solution
1	Infix to postfix conversion	Solution
2	Redundant Parenthesis	Solution
3	Stack ADT using Linked List	Solution
4	Converting decimal number to binary	Solution
5	Stacks Without STL	Solution
6	Stacks STL	Solution
7	Next Greater Element	Solution
8	Bracket Balancing Using Stack	Solution

• String Algorithms

#	Problem Statement & Explanation	Solution
1	KMP	Solution

• Strings

#	Problem Statement & Explanation	Solution
1	Strings	Solution
2	String Toknizer	Solution
3	String Sorting	Solution
4	String Reverse	Solution
5	String Comparison	Solution
6	Longest Word In Sentence	Solution
7	String Palindrome	Solution

• Template

#	Problem Statement & Explanation	Solution
1	Class Template	Solution
2	Function Template	Solution

• Tree

#	Problem Statement & Explanation	Solution
1	Ceil Value in BST	Solution
2	Check Valid BST	Solution
3	Floor Value in BST	Solution
4	BST	Solution
5	AVL	Solution
6	Array to Bst	Solution
7	Construct BST From Preorder Travsersal	Solution
8	Height of the binary tree	Solution
9	Largest Bst in a Binary Tree	Solution
10	Diameter of Binary Tree	Solution
11	Number of leaf nodes in binary tree	Solution
12	FenwickTree	Solution
13	Iterative Preorder and Postorder Traversal of Generic Tree	Solution
14	Level order traversal in a Genric Tree	Solution
15	Mirror of a Genric Tree	Solution
16	Diameter of a Genric Tree	Solution
17	Minimum distance between two nodes in a Genric Tree	Solution
18	Construct and Display Genric Tree	Solution
19	Diagonal Traversal	Solution
20	Morris Traversal	Solution
21	Preorder Traversal	Solution
22	Postorder Traversal	Solution
23	Inorder Traversal	Solution
24	Levelorder Traversal	Solution

Contributors ✨

Thanks goes to these wonderful people (emoji key):

LakhanKumawat ᵖ⁺ 💻 👀 📆	Chetas Shree Madhusudhan 💻	Nikita Sharma 💻 👀	Ujjwal Bansal 💻	Supratim2000 💻	Puneet Kaur 💻	StarEditorBoy 💻
Parthib Sarkar 💻	rutujaingole 💻	Suhotra Dey 💻	SATYAM KUMAR 💻 💡	Aastik Sharma 💻	Shivani Thorve 💻	Ikko Ashimine 👀 💻
All Contributors 💻	gaurangSaraswat-07 💻	Anurag Kumar Singh 💻	Divyansh Singh 💻	VaishnaviMandloi 💻	Aditya Kumar Singh 💻	aditim26 💻
IZHAR AHMAD 💻	Priyanshu Saxena 💻	Mrudula-Kulkarni 💻	Sahil Horo 💻	ShruthiKartik 💻	Aneesh Tripathi 💻	Md Nazish Arman 💻
SHUBHAM LAKHERA 💻	aparnamittal 💻	Rahul Sharma 💻	Jayanth MKV 💻	Sidharth Sarangi 💻	Rahul kumar 💻	Purvak Baliyan 💻
Mohammad Ruman 💻	Vinaya Sree Modem 💻	Maithili Kharabe 💻	Shashank Venkat 💻	Janhavi Kale 💻	TRIDIB BAG 💻	Sebin Francis 💻
Kalash Singhal 💻	Bhavneet Singh 💻	Jyoti Singh 💻	Aisha 💻	Bhumika Tewary 💻	arzitmahajan 💻	PeritusDeveloper 💻
Prashant Raj 💻	Ritika Garg 💻	Shweta Bhagat 💻	Abhilipsa Sahoo 💻	Akshat Agarwal 💻	Uhini Mukherjee 💻	Pragati Verma 💻
Dewanshi Paul 💻	Arun G Nayak 💻	Sukriti 💻	Sarthak S Kumar 📖	Deeptarshi Biswas 💻	PRANSHU JAIN 💻	Hend Ahmed 💻
Shatakshi-Choudhary 💻	Aly Eyad 💻	Michael Ehab 💻	Shraddha 💻	Sanya Gera 💻	Utkarsh Saxena 💻	Ayushi Bisht 💻
Mirette Amin 💻	Lakshay Narula 💻	Supriya Kumari 💻	Gaurav Patel 💻	NISHKARSH SAXENA 💻	Purva-Gharat 💻	Yasmeen ElKararty 💻
Chahat Mittal 💻	riya singh 💻	arushi_garg 💻	Shiwangi Kumari 💻	Ayush Rudani 💻	mugdhaPandey 💻	Rahul Barnwal 💻

This project follows the all-contributors specification. Contributions of any kind are welcome!

Happy Coding !!

---

© LearnCPP 2022
All Rights Reserved

Developed with ❤️ in India 🇮🇳

learncpp's Issues

H-Heaps

Challanges

• Min Heap with insertion deletion
• Max Heap with inserion deletion
• Heap Sort
• Heapify

You are allowed to make separate files if you want to make a concise contribution.

Floyd-Warshall Algorithm

Programming Paradigm : Dynamic Programming

Floyd–Warshall algorithm is used for finding shortest paths between every pair of vertices in a directed weighted graph with positive or negative edge weights (but with no negative cycles).

Find the middle element of Linked List

Description

I will add all the approaches to find the middle element of Linked List along with their Time & Space Complexity.

I want to work on this issue under GSSOC'22.

Domain

Data Structure

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Two Sum Leetcode

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Solution:

class Solution {
public:
vector twoSum(vector& nums, int target) {
vector v, ans;
int l = 0, r = nums.size() - 1, n1, n2;
v = nums;
sort(nums.begin(), nums.end());
while(l < r)
{
if(nums[l] + nums[r] > target) r--;
else if(nums[l] + nums[r] < target) l++;
else{
n1 = nums[l], n2 = nums[r];
break;
}
}
for(int i = 0; i < v.size(); i++)
{
if(v[i] == n1 || v[i] == n2)
{
ans.push_back(i);
}
if(ans.size() == 2)
break;
}
return ans;
}
};

Organise Algorithms

Organise Algorithms in Day-100(Algorithms) section according to their types .

• Like All the algorithms which are there in Dynamic Programming should be in DP folder.

• All With Greedy approach in G-Greedy folder.

• And with Graphs in their respective folders.

• Add time complexities , space complexities to algorithms .

Binary Search

Description

I will rewrite a clean standard code for binary search on a popular containers such as arrays, vectors, sets.. etc and it's enhancement because the current code is abit confusing.
( ADDITION )
I will ADD another standard code for "binary search the answer" problems with a standard example for it.
I will also explain time and space complexities in each case.
I am a competitive programmer who had used binary search in many problems , assign it to me.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Flatten a binary tree into linked list

Description

1. Recursively flatten the left and right subtree.

2. Store the left tail and right tail i.e.t he last elements of left and right subtree respectively.

3. Store right subtree in temporary variable and make the left subtree as right subtree.

4. Join right subtree with left tail.

5. Return the right tail recursively.

Domain

Data Structure

Type of Contribution

Documentation

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Pattern Searching using Finite Automata Algorithm

Description

In Finite Automata algorithm, a Finite Automata is constructed in the form of a 2D array after the pattern is pre-processed. Once the Finite Automata in built, it can be traversed from the first state along with the input text for pattern recognition. The next state of the finite automata is decided by the next letter of the input text. The pattern is found if the
the finite automata reaches the final state.

@Lakhankumawat I'm a GSSoC 2022 participant. Please assign this issue to me.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Vectors

Description

Vectors are essential data structures for both in competietive coding and interviews. I'd like to add another section of vectors in this.

I am a GSSOC'22 contributor and I would like to contribute please assign this to me. Thankyou.

Domain

Standard Template Library

Type of Contribution

Addition, Enhancement

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

[ADD] Implement two stacks in an array

Create a data structure twoStacks that represents two stacks. Implementation of twoStacks should use only one array, i.e., both stacks should use the same array for storing elements.

Describe the solution you'd like
Method 1 (Divide the space in two halves)

Describe alternatives you've considered
Method 2 (A space efficient implementation)

Additional context
Add any other context or screenshots about the feature request here.

Linked list

I would like to implement operation on singly linked list (insert at begin, insert at end, insert at specific position, delete from begin, delete from specific position, delete from end, traverse), Circular singly linked list (insert at begin, insert at end, insert at specific position, delete from begin, delete from specific position, delete from end, forward traverse, backward traverse). Please assign me with this issue. Thank you.

[ADD] Kadanes Algorithm

Hii there , Greeting's of the day
Kadane's algo is one of the most important problem we face and came across in the dynamic problem as well as in the greedy algorithm , ,,,
.

The flow of the repository is : LearnCpp/D-DynamicProgramming/
Plss consider this algo as assign this to me ..

GSSOC'22

Thank's and regard's 🤞

B-Tree Algorithm in Tree Folder

B-Tree is a self-balancing search tree. When the number of keys is high, the data is read from disk in the form of blocks. Disk access time is very high compared to the main memory access time. The main idea of using B-Trees is to reduce the number of disk accesses. This is highly used for the data base management and other places where large data is to be stored.
I would like to contribute this with C- Program.
@Lakhankumawat will you please assign this issue to me ?
I'm GSSoC 2022 Participant.

Time Complexity
Search - O(log n)
Insert - O(log n)
Delete - O(log n)

Reverse a Linked List in CPP

Description

Hi
I am a contributor at GSSOC'22, and I would like to contribute in CPP this problem statement, I will even add explanation and time comp and space comp and test cases.
Can you please assign this issue to me?

Than you

Domain

Data Structure

Type of Contribution

Addition, Documentation

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Segmented Sieve Problem

Description

In this problem you have to print all primes from given interval. As it is a range query problem, we will be using segment tree as the name suggests.
@Lakhankumawat please assign me this issue.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

[ADD] Manacher's Algorithm For (Longest Palindromic Substring)

Description

Hey @Lakhankumawat sir I want to add the Explanation as well as the clean code for this Algorithm which is not raised by anyone till now.
Please assign this to me !!

• I'm a GSsoC'2022 participant as well.

###Thank You

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Adding counting sort to the SortingAlgorithms

Counting sort is one of the most efficient sorting algorithms which sorts a list of items in O(n). So, I would like to add this algorithm to the existing SortingAlgorithms. So, I request you to please assign me this issue.

📄README

Aim

• To add readme to all folders

What to include in readme

• Everything that is so far written in folder for e.g if there is Algorithms folder then add details to each algorithms .
• Details can be added in form such that link to some documentation of a particular algorithm or some kind of useful information below that algo.
• Refer README to follow styling purposes.
• Make tables in your README too

String matching algorithm : Naive and KMP

Description

String matching is a very useful in real life scenarios like spell checking, plagiarism detection etc.
I would like to implement two (exact) string matching algorithms : Naive approach and KMP Algorithm.
@Lakhankumawat Please assign this issue to me.

The underlying concept of the algorithms :

1. Naive Algorithm : Brute-force approach. It creates a window of length of the smaller string (to be searched) on larger string (searching on), and then compare that window to the smaller string, if match found, great. Otherwise, it moves the window ahead by 1. A disadvantage is that it does not make use of the knowledge that if a string match had happened before (the window always move ahead by 1). Time Complexity : O((n-m+1)*m)
2. KMP (Knuth Morris Patt) Algorithm : Simply put, backtracking on the string to be searched never happens. The basic idea here is that when we find a mismatch after a few matches, we are going to exploit this information, and this helps avoid matching characters that we know anyway are going to match. Time Complexity : O(n+m)

// n and m are length of strings

Domain

Algorithm

Type of Contribution

Addition, Documentation

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

[Adding] Middle element of the Singly LInked-list

Hey ,Greeting's of the day
I want to add a new code file which calculates the middle element of the linked list .. to the repository .i.e .

LearnCPP/P-Problem Statements & Solution/1-Level 1/MiddleElement_Singly_LInkedlist.cpp

........
Plss assign this issue to me .. under ### GSSOC'22

Thank's regard 🤞

Arrays in C++

Description

An array is a collection of elements of the same type placed in contiguous memory locations that can be individually referenced by using an index to a unique identifier.
I would like to contribute to this project.
Hello @Lakhankumawat, I am a GSSOC'22 contributor. I am eager to contribute, please consider the issue and assign me to this project.
Thank you.

Domain

CPP

Type of Contribution

Documentation

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Vertical order traversal of a binary tree

Description

I wish to implement vertical order traversal of a binary tree using level order traversal.
@Lakhankumawat Can you please assign this to me under GSSoC'22 ?

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Longest Common Subsequence in D-Dynamic Programming

Description

The longest common subsequence (LCS) is a common dynamic programming problem . LCS is defined as the longest subsequence that is common to all the given sequences, provided that the elements of the subsequence are not required to occupy consecutive positions within the original sequences.
@Lakhankumawat Can you please assign this issue to me ,I would like to work on it.
I'm a GSSoC 2022 participant.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Adding Kruskal's Algorithm in Graph Algorithms Folder

@Lakhankumawat Please assign this issue to me

Inheritance and its implementation

Description

Frequent use of code written once, it is reusability.
One superclass can be used for the number of subclasses in a hierarchy.
No changes to be done in all base classes; just do changes in parent class only.
Inheritance is used to generate more dominant objects.

Domain

CPP

Type of Contribution

Addition, Documentation, Others

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Linked List

Linked list is non-primitive linear data structure. It consist of node, wherein each node consists of two parts : 1) data 2) link to the next node. Types of Linked Lists are singly linked list, doubly linked list, circular singly linked list, circular doubly linked list.
I would like to contribute to this project.
Hello @Lakhankumawat, I am a GSSOC'22 contributor. I am eager to contribute, please consider the issue and assign me with this project. Thank you.

Knapsack using 1 D array

Description

Usually for knapsack 2 D arrays are used, but here, it will be using 1 D array which will optimise the space complexity to a huge extent.

@Lakhankumawat please assign me this issue.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Adding DFS Algorithm in Graph Algorithms Folder

Please assign this issue to me.

Prim's Minimal Spanning Tree Algorithm

Description

Hi there. I wish to contribute the Greedy Algorithm Documentation for this algorithm.
Kindly assign me this issue.

Domain

Algorithm

Type of Contribution

Others

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Problems on Linked List Data Structure

Description

Hello there! I'm a GSSOC'22 contributor.
Description of my issue:
I found that in 'P-Problem Statements & Solution' folder there are no problem statements on the linked list. So, I will add beginner-level problems along with their solution on Linked List.

Domain

Data Structure

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Gift Wrapping Algorithm

Description

Gift Wrapping Algorithm is used to find the convex hull (smallest convex polygon that covers set of points) of a given set of points. In this algorithm, the leftmost point is taken and then the next point to be connected to the hull is chosen if all the points are to the right of the line formed by joining the previous and the chosen point. This point is found in O(n) time complexity. This algorithm has a complexity of O(nm), where n is the number of given points and m is the number of points on the convex hull.

@Lakhankumawat I'm a GSSoC 2022 participant. Please assign this issue to me.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Delete A node in linked list CPP

Description

Hi
I am a contributor at GSSOC'22, and I would like to contribute in CPP this problem statement, I will even add explanation and time comp and space comp and test cases.
Can you please assign this issue to me?

Domain

Data Structure

Type of Contribution

No response

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Adding BFS Algorithm in Graph Algorithms Folder

@Lakhankumawat Please assign this issue to me.

Z algorithm

Description

Z algorithm is used to find all pattern occurrences in a text(string) by using a Z array in linear space and linear time, O(n+m) where the length of the text is n and of the pattern is m.

@Lakhankumawat Please consider the issue and assign it to me. Thank you.
I'm a GSSoC 2022 participant.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Pull Request and Issue Templates .🎯

If you are experienced in making PR and ISSUE Templates then feel free to grab this issue

Challanges

• Make More Beginner Friendly Issue Template of Issue Form
• Make More Beginner Friendly Pull Request Template

Refactor Contributing.md you and add fields for mentors , contributors

You can take help from Here

Kadane's Algorithm in Dynamic Programming Folder

Kadane's algorithm is an iterative dynamic programming algorithm in which we search for a maximum sum contiguous subarray within a one-dimensional numeric array.
@Lakhankumawat will you please assign this issue to me ?
I'm GSSoC 2022 Participant.

Stock Buy And Sell

Description

Stock Buy And Sell
Problem Statement: You are given an array of prices where prices[i] is the price of a given stock on an ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Examples:

Example 1:

Input: prices = [7,1,5,3,6,4]

Output: 5

Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.

Note: That buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]

Output: 0

Explanation: In this case, no transactions are done and the max profit = 0.

Domain

Competitive Programming

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Strongly Connected Components (Domino)

Description

This is a very demanding yet interesting approach of solving islands of nodes known as SCC, using the approach I used to learn.

@Lakhankumawat Please assign this issue to me, I am a GSSOC'22 contributor.

Domain

Competitive Programming

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Add Algorithms

Add new algorithms , Newcomers are always welcomed with their ideas.
Do like to contribute and make it a helpful repository for beginners in CPP

Binary Search

Describe the solution you'd like
implement a folder for binary search techniques

Floyd’s Cycle Detection Algorithm

Description

Floyd's Cycle Detection algorithm is a pointer algorithm that uses only two pointers, which move through the sequence at different speeds. It determine whether the linked list has a cycle or not. First, you keep two pointers of the head node. At each iteration, you move one of the pointers by two steps and the other one by one step If they both meet at some point then we have found a cycle; otherwise, no cycle is present in list.
@Lakhankumawat will you please assign this issue to me ?
I'm GSSoC 2022 Participant.

Domain

CPP

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Lowercase_To_Uppercase

This issue is for folder name "Problem statement and solution , This will help peeps in starting problems .
It will be a c++ file named as Lowercase to Uppercase.
Question is itself in above comments and proper comments are provided with the code.

Interval Scheduling example in Java C++ C Python

Description

Description

Domain

Algorithm

Type of Contribution

GSSoC22

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

moore's voting algorithm

Programming Paradigm: Arrays
The boyer-Moore voting algorithm is used to find the majority element by eliminating the non-majority elements.

K-Query with Fenwick Tree

Description

I would like to give the approach of K-Query with fenwick tree. Fenwick tree is also called Binary Indexed Tree, and the most common application of fenwick tree is K-Queries . This is a very famous one when someone follows the path of competitive programming. I stumbled upon learning this miraculous thing, so would like to share.

@Lakhankumawat Please assign this issue to me. I am a GSSOC'22 contributor.

Domain

Data Structures

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

Add Doubly_Linked_LIst

Hii there , Greeting's of the day

i want to contribute in the Linked List folder for the Doubly_List .
The flow of the repository is : LearnCpp/L-LinkedLIst/Doubly_Linked_LIst/.

This folder conatins the all basic operation as well as advance operation such as insertion,deletion,updating and many more ..
in advance i can add the sorting sorting of the linked list , intersection of the linked list ,,
plss assign this issue to me under the

GSSOC'22

Thank's regard's 🤞

Adding “Deletion of a node in BST in BinarySearchTree Folder”

In Tree/B-BinarySearchTree Folder, there is code for Creating and inserting node in BST. I want to add program for Deleting node in BST. Will you please assign me this issue ?

Prim's Minimal Spanning Tree Algorithm

Greedy Algorithm

Median of two Sorted Arrays

Description

Several ways to find the median of two sorted arrays will be illustrated here:
Eg: For same sized Arrays.
With logarithmic time complexity, a divide and conquer programming technique will be used.

Domain

CPP

Type of Contribution

Documentation

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.

LIS Dynamic Programming

Description

I noticed that DP section contains only two patterns of DP popular problems.
I know more patterns which I have trained on and solved a lot like :

• LIS ( Longest Increasing Subsequence(

I can write clean standard code for it and show time and space complexities with comments.
I will provide code with links to the standard problem.
I will provide more than one way to solve this problem.

Domain

Algorithm

Type of Contribution

Addition

Code of Conduct

• I follow Contributing Guidelines & Code of conduct of LearnCPP.