Name	Name	Last commit message	Last commit date
Latest commit History 751 Commits
01 Matrix.cpp	01 Matrix.cpp
2 Keys Keyboard.cpp	2 Keys Keyboard.cpp
2 time Find All Duplicates in an Array.cpp	2 time Find All Duplicates in an Array.cpp
2 time Find the Duplicate Number.cpp	2 time Find the Duplicate Number.cpp
Add Binary.cpp	Add Binary.cpp
Add One Row to Tree.cpp	Add One Row to Tree.cpp
Add digits.cpp	Add digits.cpp
Add to array-form of integer.cpp	Add to array-form of integer.cpp
Add two number2.cpp	Add two number2.cpp
Adding Spaces to a String.cpp	Adding Spaces to a String.cpp
All Ancestors of a Node in a Directed Acyclic Graph.cpp	All Ancestors of a Node in a Directed Acyclic Graph.cpp
All Possible Full Binary Tree.cpp	All Possible Full Binary Tree.cpp
All nodes distance at k in binary tree.cpp	All nodes distance at k in binary tree.cpp
All path form square to target.cpp	All path form square to target.cpp
Amount of Time for Binary Tree to Be Infected.cpp	Amount of Time for Binary Tree to Be Infected.cpp
Append Characters to String to Make Subsequence.cpp	Append Characters to String to Make Subsequence.cpp
Arithmetic Slices II - Subsequence.cpp	Arithmetic Slices II - Subsequence.cpp
As Far From Land Possible.cpp	As Far From Land Possible.cpp
Assign Cookies.cpp	Assign Cookies.cpp
Asteriod Collision.cpp	Asteriod Collision.cpp
Average Salary Excluding the Miniimum and Maximum Salary.cpp	Average Salary Excluding the Miniimum and Maximum Salary.cpp
Average Waiting Time.cpp	Average Waiting Time.cpp
Bag of Tokens.cpp	Bag of Tokens.cpp
Balance a Binary Search Tree.cpp	Balance a Binary Search Tree.cpp
Best Sightseeing Pair.cpp	Best Sightseeing Pair.cpp
Best Team With No Conflict.cpp	Best Team With No Conflict.cpp
Best time to buy and sell stock.cpp	Best time to buy and sell stock.cpp
Best time to buy and sell stocks with fee transaction.cpp	Best time to buy and sell stocks with fee transaction.cpp
Binary Search Tree to Greater Sum Tree.cpp	Binary Search Tree to Greater Sum Tree.cpp
Binary Search.cpp	Binary Search.cpp
Binary Subarrays With Sum.cpp	Binary Subarrays With Sum.cpp
Binary Tree Inorder Traversal.cpp	Binary Tree Inorder Traversal.cpp
Binary Tree Postorder Traversal.cpp	Binary Tree Postorder Traversal.cpp
Binary Tree preorder traversal .cpp	Binary Tree preorder traversal .cpp
Binary Tree zigzag traversal.cpp	Binary Tree zigzag traversal.cpp
Binary Trees With Factors.cpp	Binary Trees With Factors.cpp
Bitwise AND of Numbers Range.cpp	Bitwise AND of Numbers Range.cpp
Bitwise XOR of All Pairings.cpp	Bitwise XOR of All Pairings.cpp
Boats to Save People.cpp	Boats to Save People.cpp
Boats to save people.cpp	Boats to save people.cpp
Buddy String.cpp	Buddy String.cpp
Build a Matrix With Conditions.cpp	Build a Matrix With Conditions.cpp
Build an Array With Stack Operations.cpp	Build an Array With Stack Operations.cpp
Bulb switcher.cpp	Bulb switcher.cpp
Bus Routes.cpp	Bus Routes.cpp
Buy Two Chocolates.cpp	Buy Two Chocolates.cpp
Calculate Money in Leetcode Bank.cpp	Calculate Money in Leetcode Bank.cpp
Can PLace Flower.cpp	Can PLace Flower.cpp
Candy.cpp	Candy.cpp
Capacity to ship packages within D days.cpp	Capacity to ship packages within D days.cpp
Champagne Tower.cpp	Champagne Tower.cpp
Cheapest Flight With K stops.cpp	Cheapest Flight With K stops.cpp
Cheapest Flights Within K Stops S.cpp	Cheapest Flights Within K Stops S.cpp
Check Completness of Binary Tree.cpp	Check Completness of Binary Tree.cpp
Check If N and Its Double Exist.cpp	Check If N and Its Double Exist.cpp
Check If Two String Arrays are Equivalent.cpp	Check If Two String Arrays are Equivalent.cpp
Check If a Word Occurs As a Prefix of Any Word in a Sentence.cpp	Check If a Word Occurs As a Prefix of Any Word in a Sentence.cpp
Check if There is a Valid Partition For The Array.cpp	Check if There is a Valid Partition For The Array.cpp
Check if a Parentheses String Can Be Valid.cpp	Check if a Parentheses String Can Be Valid.cpp
Checking Existence of Edge Length Limited Paths.cpp	Checking Existence of Edge Length Limited Paths.cpp
Circular Sentence.cpp	Circular Sentence.cpp
Climbing Stairs.cpp	Climbing Stairs.cpp
Clone graph.cpp	Clone graph.cpp
Coin Change2.cpp	Coin Change2.cpp
Combination Sum II.cpp	Combination Sum II.cpp
Combination Sum IV.cpp	Combination Sum IV.cpp
Combinations.cpp	Combinations.cpp
Compare Version Numbers.cpp	Compare Version Numbers.cpp
Complete BT102 training.cpp	Complete BT102 training.cpp
Conactenated word.cpp	Conactenated word.cpp
Constrained Subsequence Sum.cpp	Constrained Subsequence Sum.cpp
Construct Binary Tree from postoerder and inorder traversal.cpp	Construct Binary Tree from postoerder and inorder traversal.cpp
Construct K Palindrome Strings.cpp	Construct K Palindrome Strings.cpp
Construct Quad Tree.cpp	Construct Quad Tree.cpp
Construct String from Binary Tree.cpp	Construct String from Binary Tree.cpp
Contiguous Array.cpp	Contiguous Array.cpp
Continuous Subarray Sum.cpp	Continuous Subarray Sum.cpp
Continuous Subarrays.cpp	Continuous Subarrays.cpp
Convert 1D Array Into 2D Array.cpp	Convert 1D Array Into 2D Array.cpp
Convert an Array Into a 2D Array With Conditions.cpp	Convert an Array Into a 2D Array With Conditions.cpp
Convert sorted list to binary search tree.cpp	Convert sorted list to binary search tree.cpp
Copy List with Random Pointer.cpp	Copy List with Random Pointer.cpp
Count All Posiible Routes.cpp	Count All Posiible Routes.cpp
Count All Valid Pickup and Delivery Options.cpp	Count All Valid Pickup and Delivery Options.cpp
Count Elements With Maximum Frequency.cpp	Count Elements With Maximum Frequency.cpp
Count Nice Pairs in an Array.cpp	Count Nice Pairs in an Array.cpp
Count Nodes Equal to Average of Subtree.cpp	Count Nodes Equal to Average of Subtree.cpp
Count Number of Homogenous Substrings.cpp	Count Number of Homogenous Substrings.cpp
Count Number of Maximum Bitwise-OR Subsets.cpp	Count Number of Maximum Bitwise-OR Subsets.cpp
Count Number of Nice Subarrays solved.cpp	Count Number of Nice Subarrays solved.cpp
Count Number of Teams.cpp	Count Number of Teams.cpp
Count Odd Number in an interval.cpp	Count Odd Number in an interval.cpp
Count Prefix and Suffix Pairs I.cpp	Count Prefix and Suffix Pairs I.cpp
Count Servers that Communicate.cpp	Count Servers that Communicate.cpp
Count Square Submatrices with All Ones.cpp	Count Square Submatrices with All Ones.cpp
Count Sub Islands.cpp	Count Sub Islands.cpp
Count Subarray with fixed Bounds.cpp	Count Subarray with fixed Bounds.cpp
Count Subarrays Where Max Element Appears at Least K Times.cpp	Count Subarrays Where Max Element Appears at Least K Times.cpp
Count Subarrays With Fixed Bounds Repeat.cpp	Count Subarrays With Fixed Bounds Repeat.cpp
Count Triplets That Can Form Two Arrays of Equal XOR.cpp	Count Triplets That Can Form Two Arrays of Equal XOR.cpp

Name

Last commit message

Last commit date

751 Commits

01 Matrix.cpp

2 Keys Keyboard.cpp

2 time Find All Duplicates in an Array.cpp

2 time Find the Duplicate Number.cpp

Add Binary.cpp

Add One Row to Tree.cpp

Add digits.cpp

Add to array-form of integer.cpp