Name		Name	Last commit message	Last commit date
Latest commit History 962 Commits
Basic		Basic
Difficulty: Basic/Identical Linked Lists		Difficulty: Basic/Identical Linked Lists
Difficulty: Easy		Difficulty: Easy
Difficulty: Medium		Difficulty: Medium
Easy		Easy
Hard		Hard
Medium		Medium
2 Sum equals target in BST		2 Sum equals target in BST
2's Power		2's Power
2D Array		2D Array
Account Merge GFG		Account Merge GFG
Add Binary String		Add Binary String
Add two Numbers represented by Linked List:		Add two Numbers represented by Linked List:
Alien Dictionary GFG		Alien Dictionary GFG
Array sum using Recursion		Array sum using Recursion
BFS graphs in GFG		BFS graphs in GFG
BFS graphs using edges		BFS graphs using edges
BST Implementation		BST Implementation
BST from preOrder		BST from preOrder
Best Time to Buy and Sell Stock with Cooldown		Best Time to Buy and Sell Stock with Cooldown
Best Time to Buy and Sell Stock with transaction fee		Best Time to Buy and Sell Stock with transaction fee
Best time to buy and sell stock 2		Best time to buy and sell stock 2
Best time to buy and sell stock 3		Best time to buy and sell stock 3
Best time to buy and sell stock 4		Best time to buy and sell stock 4
Binary Search		Binary Search
Binary Search using Recursion		Binary Search using Recursion
Binary Tree Implementation		Binary Tree Implementation
Binary tree zig zag fashion		Binary tree zig zag fashion
Bottom view of Binary Tree		Bottom view of Binary Tree
Boundary Traversal of Binary Tree		Boundary Traversal of Binary Tree
Burn tree		Burn tree
Burst Balloons DP		Burst Balloons DP
Candy leetcode problem		Candy leetcode problem
Celebrity Problem Using stack		Celebrity Problem Using stack
Check Palindrome		Check Palindrome
Check Palindrome In LL		Check Palindrome In LL
Check for Bipartite Graph		Check for Bipartite Graph
Chocolate Pickup		Chocolate Pickup
Clone a linked list with next and random pointer		Clone a linked list with next and random pointer
Clone a linked list with next and random pointer-Optimised Approach		Clone a linked list with next and random pointer-Optimised Approach
Construct Tree from Inorder & Preorder		Construct Tree from Inorder & Preorder
Count ways to reach nth stairs DP		Count ways to reach nth stairs DP
Course Schedule GFG		Course Schedule GFG
DFS in Graph		DFS in Graph
Delete Node in BST		Delete Node in BST
Detect Cycle in Undirected Graph		Detect Cycle in Undirected Graph
Diagonal of a Binary Tree		Diagonal of a Binary Tree
Disjoin Set (DSU) - algo		Disjoin Set (DSU) - algo
Distance from the Source (Bellman-Ford Algorithm)		Distance from the Source (Bellman-Ford Algorithm)
Distinct Subsequences		Distinct Subsequences
Edit Distance DP		Edit Distance DP
Erect the fence		Erect the fence
Eventually safe Nodes		Eventually safe Nodes
Expression and Operator lc		Expression and Operator lc
First negative integer in every window of size k		First negative integer in every window of size k
Flatten BST to a sorted list		Flatten BST to a sorted list
Flood fill Algorithm		Flood fill Algorithm
Fog Jump DP		Fog Jump DP
Heap Implementation		Heap Implementation
House Robber 2 DP		House Robber 2 DP
House Robber DP		House Robber DP
Implementation of Dequeue		Implementation of Dequeue
Implementing Dijkstra's Algorithm		Implementing Dijkstra's Algorithm
Insert into BST		Insert into BST
Is Binary Tree Heap		Is Binary Tree Heap
Jump game 2		Jump game 2
K-th Largest Sum Contiguous Subarray		K-th Largest Sum Contiguous Subarray
Kth largest element in BST		Kth largest element in BST
Kth smallest element in BST		Kth smallest element in BST
Largest Area in Histogram		Largest Area in Histogram
Largest BST		Largest BST
Left view of Bianry Tree		Left view of Bianry Tree
Level Order Traversal		Level Order Traversal
Longest Common Subsequences		Longest Common Subsequences
Longest Common Substring		Longest Common Substring
Longest Palindromic Subsequences		Longest Palindromic Subsequences
Longest String Chain		Longest String Chain
Lowest Common ancestor of a binary tree		Lowest Common ancestor of a binary tree
Matrix Chain Multiplication		Matrix Chain Multiplication
Max rectangle		Max rectangle
Maximum Connected Group		Maximum Connected Group
Maximum Sum of Adjacent Element DP		Maximum Sum of Adjacent Element DP
Merge k sorted Linked List		Merge k sorted Linked List
Merge k sorted array		Merge k sorted array
Merge two binary Max heap		Merge two binary Max heap
Minimum Coins DP		Minimum Coins DP
Minimum Cost To Make String Valid		Minimum Cost To Make String Valid
Minimum Multiplication to reach End		Minimum Multiplication to reach End
Minimum Path Sum DP		Minimum Path Sum DP
Minimum Window Substring		Minimum Window Substring
Next Smaller Element		Next Smaller Element
Ninja Training DP		Ninja Training DP
Normal BST to Balance BST		Normal BST to Balance BST
Number of Enclaves		Number of Enclaves
Number of Island using DFS		Number of Island using DFS
Number of Longest Increasing Subsequence		Number of Longest Increasing Subsequence
Number of Provinces		Number of Provinces
Partition Equal Subset Sum		Partition Equal Subset Sum
Partition Linked List around a given value		Partition Linked List around a given value
Predecessor and Successor in BST		Predecessor and Successor in BST

Repository files navigation

Data_Structures_and_Algorithms-CPP-Codes

DSA basic stuffs and some concept implementation

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Data_Structures_and_Algorithms-CPP-Codes

About

Releases

Packages

Languages

Mayur-Shiwal/Data_Structures_and_Algorithms-CPP-Solutions

Folders and files

Latest commit

History

Repository files navigation

Data_Structures_and_Algorithms-CPP-Codes

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages