TO-DO

Some Good Reads:-

0-1 BFS
Multi Source Shortest Path in Unweighted Graph Use BFS(queue) for unweighted graphs and Dijsktra(set) for weighted graphs.

TO-DO

Square-root Decomposition.

Navigation Menu

Repository files navigation

Some Good Reads:-

TO-DO

About

Releases

Packages

Contributors

Languages

Name		Name	Last commit message	Last commit date
Leetcode		Leetcode
.gitignore		.gitignore
Array1-Count of Smaller Numbers After Self.cpp		Array1-Count of Smaller Numbers After Self.cpp
Array2-Count of Range Sum.cpp		Array2-Count of Range Sum.cpp
Array3-Max Points on a Line.cpp		Array3-Max Points on a Line.cpp
Array4-dominos_28-08-19.cpp		Array4-dominos_28-08-19.cpp
BITManipulation1-SUBARRAY OR.cpp		BITManipulation1-SUBARRAY OR.cpp
BST1-Recover Binary Search Tree.cpp		BST1-Recover Binary Search Tree.cpp
BST2- Largest BST Subtree.cpp		BST2- Largest BST Subtree.cpp
BST3-Closest Binary Search Tree Value II.cpp		BST3-Closest Binary Search Tree Value II.cpp
BST4-Construct Binary Search Tree from Preorder Traversal.cpp		BST4-Construct Binary Search Tree from Preorder Traversal.cpp
BST5-Split BST.cpp		BST5-Split BST.cpp
BT1-Node distance C in binary tree.cpp		BT1-Node distance C in binary tree.cpp
BT10-Construct Binary Tree from String with bracket representation.cpp		BT10-Construct Binary Tree from String with bracket representation.cpp
BT11-Maximum Binary Tree.cpp		BT11-Maximum Binary Tree.cpp
BT12-Closest Leaf in a Binary Tree.cpp		BT12-Closest Leaf in a Binary Tree.cpp
BT13-Distribute Coins in Binary Tree.cpp		BT13-Distribute Coins in Binary Tree.cpp
BT14-Recover a Tree From Preorder Traversal.cpp		BT14-Recover a Tree From Preorder Traversal.cpp
BT15-Minimum time to burn a Tree starting from a Leaf node.cpp		BT15-Minimum time to burn a Tree starting from a Leaf node.cpp
BT16-Duplicates in binary tree.cpp		BT16-Duplicates in binary tree.cpp
BT17-Minimum Height Trees.cpp		BT17-Minimum Height Trees.cpp
BT18-BinaryLifting and RMQ with Euler Tour.cpp		BT18-BinaryLifting and RMQ with Euler Tour.cpp
BT19-Verify Preorder Serialization of a Binary Tree.cpp		BT19-Verify Preorder Serialization of a Binary Tree.cpp
BT2-Populate Next Right Pointers Tree.cpp		BT2-Populate Next Right Pointers Tree.cpp
BT20-Minimum Cost Tree From Leaf Values.java		BT20-Minimum Cost Tree From Leaf Values.java
BT3-Binary Tree Inorder Traversal.cpp		BT3-Binary Tree Inorder Traversal.cpp
BT4-Binary Tree Postorder Traversal.cpp		BT4-Binary Tree Postorder Traversal.cpp
BT5-Boundary of Binary Tree.cpp		BT5-Boundary of Binary Tree.cpp
BT6-Flatten Binary Tree to Linked List.cpp		BT6-Flatten Binary Tree to Linked List.cpp
BT7a-Binary Tree Longest Consecutive Sequence.cpp		BT7a-Binary Tree Longest Consecutive Sequence.cpp
BT7b-Binary Tree Longest Consecutive Sequence II.cpp		BT7b-Binary Tree Longest Consecutive Sequence II.cpp
BT8-Construct Binary Tree from Preorder and Postorder Traversal.cpp		BT8-Construct Binary Tree from Preorder and Postorder Traversal.cpp
BT9-Path In Zigzag Labelled Binary Tree.cpp		BT9-Path In Zigzag Labelled Binary Tree.cpp
BinarySearch1-Find K Closest Elements.cpp		BinarySearch1-Find K Closest Elements.cpp
BinarySearch2-Maximum Median.cpp		BinarySearch2-Maximum Median.cpp
BinarySearch3-Find K-th Smallest Pair Distance.cpp		BinarySearch3-Find K-th Smallest Pair Distance.cpp
BinarySearch4-Split Array Largest Sum.cpp		BinarySearch4-Split Array Largest Sum.cpp
BinarySearch5-Find Minimum in Rotated Sorted Array II.cpp		BinarySearch5-Find Minimum in Rotated Sorted Array II.cpp
BinarySearch6-Caribbean Cruise.cpp		BinarySearch6-Caribbean Cruise.cpp
BinarySearch7-Median of Two Sorted Arrays.cpp		BinarySearch7-Median of Two Sorted Arrays.cpp
DP1-Special statue.cpp		DP1-Special statue.cpp
DP10-Palindrome Partitioning II.cpp		DP10-Palindrome Partitioning II.cpp
DP11-Palindrome Removal.cpp		DP11-Palindrome Removal.cpp
DP12-Word Break.cpp		DP12-Word Break.cpp
DP13-Evaluate Expression To True.cpp		DP13-Evaluate Expression To True.cpp
DP14-Count Distinct Subsequences.cpp		DP14-Count Distinct Subsequences.cpp
DP15-Shortest Common Supersequence.cpp		DP15-Shortest Common Supersequence.cpp
DP16-Equal Average Partition.cpp		DP16-Equal Average Partition.cpp
DP17-Matrix Chain Multiplication.cpp		DP17-Matrix Chain Multiplication.cpp
DP18-Russian Doll Envelopes.cpp		DP18-Russian Doll Envelopes.cpp
DP19-Arithmetic Subsequences.cpp		DP19-Arithmetic Subsequences.cpp
DP2-Jump Game I & II.cpp		DP2-Jump Game I & II.cpp
DP20-Burst Balloons.cpp		DP20-Burst Balloons.cpp
DP21-Length of Longest Fibonacci Subsequence.cpp		DP21-Length of Longest Fibonacci Subsequence.cpp
DP22-Minimum Cost to Merge Stones.cpp		DP22-Minimum Cost to Merge Stones.cpp
DP23-Minimum Cost For Tickets.cpp		DP23-Minimum Cost For Tickets.cpp
DP24-Best Time to Buy and Sell Stock IV.cpp		DP24-Best Time to Buy and Sell Stock IV.cpp
DP24a-Best Time to Buy and Sell Stock with Cooldown.cpp		DP24a-Best Time to Buy and Sell Stock with Cooldown.cpp
DP25-Knight Probability in Chessboard.cpp		DP25-Knight Probability in Chessboard.cpp
DP26-Super Washing Machines.cpp		DP26-Super Washing Machines.cpp
DP27-Maximum Minimum Path in Matrix.cpp		DP27-Maximum Minimum Path in Matrix.cpp
DP28-Longest repeating and non overlapping substring in a string.cpp		DP28-Longest repeating and non overlapping substring in a string.cpp
DP29-Longest Turbulent Subarray.cpp		DP29-Longest Turbulent Subarray.cpp
DP3-Max Product Subarray.cpp		DP3-Max Product Subarray.cpp
DP30-Find the Derangement of An Array.cpp		DP30-Find the Derangement of An Array.cpp
DP31-Wiggle Subsequence.cpp		DP31-Wiggle Subsequence.cpp
DP32-Campus Bikes II.cpp		DP32-Campus Bikes II.cpp
DP33-Minimum Swaps To Make Sequences Increasing.cpp		DP33-Minimum Swaps To Make Sequences Increasing.cpp
DP34-Handshakes That Don't Cross.cpp		DP34-Handshakes That Don't Cross.cpp
DP35-Maximum Students Taking Exam.cpp		DP35-Maximum Students Taking Exam.cpp
DP36- Paint House I & II.cpp		DP36- Paint House I & II.cpp
DP37-Fence Painter.cpp		DP37-Fence Painter.cpp
DP38-Stickers to Spell Word.cpp		DP38-Stickers to Spell Word.cpp
DP39-String Conversion.cpp		DP39-String Conversion.cpp
DP4-Longest Valid Parentheses.cpp		DP4-Longest Valid Parentheses.cpp
DP4-Regular Expression Match I & II.cpp		DP4-Regular Expression Match I & II.cpp
DP40-Largest Sum of Averages.cpp		DP40-Largest Sum of Averages.cpp
DP41-Triples with Bitwise AND Equal To Zero.cpp		DP41-Triples with Bitwise AND Equal To Zero.cpp
DP42-Greatest Sum Divisible by Three.cpp		DP42-Greatest Sum Divisible by Three.cpp
DP43-Strange Printer.cpp		DP43-Strange Printer.cpp
DP44-Number of ways to form a heap with n distinct integers.cpp		DP44-Number of ways to form a heap with n distinct integers.cpp
DP45-ODD Subsequence SUM.cpp		DP45-ODD Subsequence SUM.cpp
DP46-Predict the Winner.cpp		DP46-Predict the Winner.cpp
DP47- Form Largest Integer With Digits That Add up to Target.cpp		DP47- Form Largest Integer With Digits That Add up to Target.cpp
DP47-Remove Boxes.cpp		DP47-Remove Boxes.cpp
DP48-Profitable Schemes.cpp		DP48-Profitable Schemes.cpp
DP49-Non Zero Digits.cpp		DP49-Non Zero Digits.cpp
DP5-Distinct Subsequences.cpp		DP5-Distinct Subsequences.cpp
DP50-Palindromic Beauty.cpp		DP50-Palindromic Beauty.cpp
DP51-Distribute Repeating Integers.cpp		DP51-Distribute Repeating Integers.cpp
DP52-Race Car.cpp		DP52-Race Car.cpp
DP6-Odd Palindrome.cpp		DP6-Odd Palindrome.cpp
DP7-Flip Array.cpp		DP7-Flip Array.cpp
DP8-Remove trees.cpp		DP8-Remove trees.cpp
DP9-Unique Binary Search Trees.cpp		DP9-Unique Binary Search Trees.cpp
Design1-LRU Cache.cpp		Design1-LRU Cache.cpp
Design2-LFU Cache.cpp		Design2-LFU Cache.cpp
Design3a-Insert Delete GetRandom O(1).cpp		Design3a-Insert Delete GetRandom O(1).cpp
Design3b-Insert Delete GetRandom O(1) - Duplicates allowed.cpp		Design3b-Insert Delete GetRandom O(1) - Duplicates allowed.cpp
Design4-Maximum Frequency Stack.cpp		Design4-Maximum Frequency Stack.cpp

Latest commit

History

Folders and files

Repository files navigation

Some Good Reads:-

TO-DO

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages