GitHub - aditya059/C-codes: C++ code for Competitive Programming · GitHub

Repository navigation

C-codes

Public

About

C++ code for Competitive Programming

0 stars

1 watching

Report repository

Name		Name	Last commit message	Last commit date
(SPOJ) LCASQ - Lowest Common Ancestor		(SPOJ) LCASQ - Lowest Common Ancestor
(SPOJ) RMQSQ - Range Minimum Query		(SPOJ) RMQSQ - Range Minimum Query
.gitignore		.gitignore
122. Best Time to Buy and Sell Stock II (Leetcode)		122. Best Time to Buy and Sell Stock II (Leetcode)
123. Best Time to Buy and Sell Stock III		123. Best Time to Buy and Sell Stock III
1319. Number of Operations to Make Network Connected (Leetcode)		1319. Number of Operations to Make Network Connected (Leetcode)
146. LRU Cache (Leetcode)		146. LRU Cache (Leetcode)
1483. Kth Ancestor of a Tree Node (Leetcode)		1483. Kth Ancestor of a Tree Node (Leetcode)
155. Min Stack (Leetcode)		155. Min Stack (Leetcode)
188. Best Time to Buy and Sell Stock IV (Leetcode)		188. Best Time to Buy and Sell Stock IV (Leetcode)
1_TwoSum_LeetCode.cpp		1_TwoSum_LeetCode.cpp
450. Delete Node in a BST (Leetcode)		450. Delete Node in a BST (Leetcode)
887. Super Egg Drop (Leetcode)		887. Super Egg Drop (Leetcode)
909. Snakes and Ladders (Leetcode)		909. Snakes and Ladders (Leetcode)
958. Check Completeness of a Binary Tree (Leetcode)		958. Check Completeness of a Binary Tree (Leetcode)
ArrayLeftRotationByD		ArrayLeftRotationByD
ArrayLeftRotationByD.cpp		ArrayLeftRotationByD.cpp
Binary Tree to DLL (GFG)		Binary Tree to DLL (GFG)
Bipartite Graph (GFG)		Bipartite Graph (GFG)
Check for BST (GFG)		Check for BST (GFG)
Check if Tree is Isomorphic (GFG)		Check if Tree is Isomorphic (GFG)
Check whether BST contains Dead End (GFG)		Check whether BST contains Dead End (GFG)
Circular tour (GFG)		Circular tour (GFG)
Coin game winner where every player has three choices (GFG)		Coin game winner where every player has three choices (GFG)
Construct Tree from Inorder & Preorder (GFG)		Construct Tree from Inorder & Preorder (GFG)
Count BST nodes that lie in a given range (GFG)		Count BST nodes that lie in a given range (GFG)
Count all subsequences having product less than equal to K (GFG)		Count all subsequences having product less than equal to K (GFG)
CountInversionUsingMergeSort		CountInversionUsingMergeSort
CountInversionUsingMergeSort.cpp		CountInversionUsingMergeSort.cpp
Distance of nearest cell having 1 (GFG)		Distance of nearest cell having 1 (GFG)
Duplicate Subtrees (GFG)		Duplicate Subtrees (GFG)
Duplicate subtree in Binary Tree (GFG)		Duplicate subtree in Binary Tree (GFG)
Egg Dropping Puzzle (GFG)		Egg Dropping Puzzle (GFG)
Expression contains redundant bracket or not (InterviewBit)		Expression contains redundant bracket or not (InterviewBit)
FastExponentiation		FastExponentiation
FastExponentiation.cpp		FastExponentiation.cpp
FastExponentiationOfLargeNumbers		FastExponentiationOfLargeNumbers
FastExponentiationOfLargeNumbers.cpp		FastExponentiationOfLargeNumbers.cpp
Find shortest unique prefix for every word in a given list		Find shortest unique prefix for every word in a given list
First negative integer in every window of size k (GFG)		First negative integer in every window of size k (GFG)
First non-repeating character in a stream (GFG)		First non-repeating character in a stream (GFG)
Flatten BST to sorted list (GFG)		Flatten BST to sorted list (GFG)
Game with String (GFG)		Game with String (GFG)
HackerRank String Query		HackerRank String Query
Huffman Encoding (GFG)		Huffman Encoding (GFG)
Insert element at bottom of stack (GFG)		Insert element at bottom of stack (GFG)
Is Binary Tree Heap (GFG)		Is Binary Tree Heap (GFG)
KMP Algorithm		KMP Algorithm
Koraju's Algo Strongly Connected Component (GFG)		Koraju's Algo Strongly Connected Component (GFG)
Kth Ancestor in a Tree (GFG)		Kth Ancestor in a Tree (GFG)
Kth largest element in BST (GFG)		Kth largest element in BST (GFG)
Largest BST (GFG)		Largest BST (GFG)
Largest Independent Set Problem (GFG)		Largest Independent Set Problem (GFG)
Longest alternating subsequence (GFG)		Longest alternating subsequence (GFG)
LongestPrefixAlsoSuffix (GFG)		LongestPrefixAlsoSuffix (GFG)
MaxSumContiguousSubarray.cpp		MaxSumContiguousSubarray.cpp
MaxSumTriplet.cpp		MaxSumTriplet.cpp
Maximum Profit in Job Scheduling (Leetcode)		Maximum Profit in Job Scheduling (Leetcode)
Maximum difference of zeros and ones in binary string (GFG)		Maximum difference of zeros and ones in binary string (GFG)
Maximum profit by buying and selling a share at most k times (GFG)		Maximum profit by buying and selling a share at most k times (GFG)
Maximum subsequence sum such that no three are consecutive (GFG)		Maximum subsequence sum such that no three are consecutive (GFG)
Maximum sum of Non-adjacent nodes (GFG)		Maximum sum of Non-adjacent nodes (GFG)
MergeSort		MergeSort
MergeSort.cpp		MergeSort.cpp
Min distance between two given nodes of a Binary Tree (GFG)		Min distance between two given nodes of a Binary Tree (GFG)
Minimum Platforms (GFG)		Minimum Platforms (GFG)
Optimum location of point to minimize total distance (GFG)		Optimum location of point to minimize total distance (GFG)
Page Faults in LRU (GFG)		Page Faults in LRU (GFG)
Painting the Fence (GFG)		Painting the Fence (GFG)
Populate Inorder Successor for all nodes (GFG)		Populate Inorder Successor for all nodes (GFG)
Preorder to Postorder (GFG)		Preorder to Postorder (GFG)
Queue Reversal using recursion		Queue Reversal using recursion
Quick Sort on Linked List (GFG)		Quick Sort on Linked List (GFG)
README.md		README.md
Rat in a Maze Problem - I (GFG)		Rat in a Maze Problem - I (GFG)
Redundant Braces (InterviewBit)		Redundant Braces (InterviewBit)
Reverse a Linked List in groups of given size (GFG)		Reverse a Linked List in groups of given size (GFG)
Reverse a stack using recursion (GFG)		Reverse a stack using recursion (GFG)
Rotten Oranges (Leetcode)		Rotten Oranges (Leetcode)
Smallest number (GFG)		Smallest number (GFG)
Smallest range in K lists (GFG)		Smallest range in K lists (GFG)
Sort a stack using recursion (GFG)		Sort a stack using recursion (GFG)
Special Stack (GFG) - GetMin in O(1) time and O(1) space		Special Stack (GFG) - GetMin in O(1) time and O(1) space
The Celebrity Problem (GFG)		The Celebrity Problem (GFG)
Union Find - Friends Pair (HackerRank)		Union Find - Friends Pair (HackerRank)
Water Connection Problem (GFG)		Water Connection Problem (GFG)
Word Wrap Problem (GFG)		Word Wrap Problem (GFG)
WordBreak using Trie		WordBreak using Trie

Repository files navigation

C++ codes

About

C++ code for Competitive Programming

0 stars

1 watching

Report repository

Releases

Packages

Contributors

Languages