Name	Name	Last commit message	Last commit date
Latest commit History 131 Commits
1406. Stone Game III	1406. Stone Game III
486. Predict the Winner	486. Predict the Winner
605. Can Place Flowers	605. Can Place Flowers
877. Stone Game	877. Stone Game
Add to Array-Form of Integer	Add to Array-Form of Integer
Arranging Coins	Arranging Coins
Best Time to Buy and Sell Stock	Best Time to Buy and Sell Stock
Binary Tree Maximum Path Sum	Binary Tree Maximum Path Sum
Build Array from Permutation	Build Array from Permutation
Cells with Odd Values in a Matrix	Cells with Odd Values in a Matrix
Check if Binary String Has at Most One Segment of Ones	Check if Binary String Has at Most One Segment of Ones
Check if the Sentence Is Pangram	Check if the Sentence Is Pangram
Complement of Base 10 Integer	Complement of Base 10 Integer
Concatenate Non-Zero Digits and Multiply by Sum I	Concatenate Non-Zero Digits and Multiply by Sum I
Concatenate Non-Zero Digits and Multiply by Sum II	Concatenate Non-Zero Digits and Multiply by Sum II
Concatenation of Array	Concatenation of Array
Construct Binary Tree from Preorder and Inorder Traversal	Construct Binary Tree from Preorder and Inorder Traversal
Construct Binary Tree from Preorder and Inorder Traversal(HashMap)	Construct Binary Tree from Preorder and Inorder Traversal(HashMap)
Construct Product Matrix	Construct Product Matrix
Count Items Matching a Rule	Count Items Matching a Rule
Count Subarrays With Majority Element I	Count Subarrays With Majority Element I
Count Subarrays With Majority Element II	Count Subarrays With Majority Element II
Count Submatrices With Equal Frequency of X and Y	Count Submatrices With Equal Frequency of X and Y
Count Submatrices with Top-Left Element and Sum Less Than k	Count Submatrices with Top-Left Element and Sum Less Than k
Count the Number of Complete Components	Count the Number of Complete Components
Cousins in Binary Tree	Cousins in Binary Tree
Create Binary Tree From Descriptions	Create Binary Tree From Descriptions
Create Target Array in the Given Order	Create Target Array in the Given Order
Determine Whether Matrix Can Be Obtained By Rotation	Determine Whether Matrix Can Be Obtained By Rotation
Determine Whether Matrix Can Be Obtained By Rotation(c++)	Determine Whether Matrix Can Be Obtained By Rotation(c++)
Diameter of B-Tree	Diameter of B-Tree
Divide an Array Into Subarrays With Minimum Cost I	Divide an Array Into Subarrays With Minimum Cost I
Equal Sum Grid Partition I	Equal Sum Grid Partition I
Equal Sum Grid Partition II	Equal Sum Grid Partition II
Find All Possible Stable Binary Arrays II	Find All Possible Stable Binary Arrays II
Find Numbers with Even Number of Digits	Find Numbers with Even Number of Digits
Find Unique Binary String	Find Unique Binary String
Find a Safe Walk Through a Grid	Find a Safe Walk Through a Grid
Find the Highest Altitude	Find the Highest Altitude
Find the Maximum Number of Elements in Subset	Find the Maximum Number of Elements in Subset
Find the Number of Subsequences With Equal GCD	Find the Number of Subsequences With Equal GCD
Find the Safest Path in a Grid	Find the Safest Path in a Grid
Find the String with LCP	Find the String with LCP
First Bad Version	First Bad Version
Flatten Problem	Flatten Problem
Flip Square Submatrix Vertically	Flip Square Submatrix Vertically
Flipping an Image	Flipping an Image
GCD of Odd and Even Sums	GCD of Odd and Even Sums
Greatest Common Divisor of Strings	Greatest Common Divisor of Strings
Guess Number Higher or Lower	Guess Number Higher or Lower
How Many Numbers Are Smaller Than the Current Number	How Many Numbers Are Smaller Than the Current Number
Kids With the Greatest Number of Candies	Kids With the Greatest Number of Candies
Kth Missing Positive Number	Kth Missing Positive Number
Kth Smallest Element in a BST	Kth Smallest Element in a BST
Kth Smallest element(diff. approach)	Kth Smallest element(diff. approach)
Largest Submatrix With Rearrangements	Largest Submatrix With Rearrangements
Lowest Common Ancestor	Lowest Common Ancestor
Majority Element	Majority Element
Matrix Diagonal Sum	Matrix Diagonal Sum
Matrix Similarity After Cyclic Shifts	Matrix Similarity After Cyclic Shifts
Max Depth of B-Tree	Max Depth of B-Tree
Maximize Active Section with Trade I	Maximize Active Section with Trade I
Maximum Amount of Money Robot Can Earn	Maximum Amount of Money Robot Can Earn
Maximum Building Height	Maximum Building Height
Maximum Element After Decreasing and Rearranging	Maximum Element After Decreasing and Rearranging
Maximum Ice Cream Bars	Maximum Ice Cream Bars
Maximum Non Negative Product in a Matrix	Maximum Non Negative Product in a Matrix
Maximum Number of Balloons	Maximum Number of Balloons
Maximum Population Year	Maximum Population Year
Maximum Product of Two Elements in an Array	Maximum Product of Two Elements in an Array
Maximum Total Subarray Value I	Maximum Total Subarray Value I
Maximum Walls Destroyed by Robots	Maximum Walls Destroyed by Robots
Merge Sorted Array	Merge Sorted Array
Merge Strings Alternately	Merge Strings Alternately
Minimum Absolute Difference in Sliding Submatrix	Minimum Absolute Difference in Sliding Submatrix
Minimum Changes To Make Alternating Binary String	Minimum Changes To Make Alternating Binary String
Minimum Element After Replacement With Digit Sum	Minimum Element After Replacement With Digit Sum
Minimum Jumps to Reach End via Prime Teleportation	Minimum Jumps to Reach End via Prime Teleportation
Minimum Number of Flips to Make the Binary String Alternating	Minimum Number of Flips to Make the Binary String Alternating
Minimum Number of Pushes to Type Word I	Minimum Number of Pushes to Type Word I
Minimum Number of Pushes to Type Word II	Minimum Number of Pushes to Type Word II
Minimum Score of a Path Between Two Cities	Minimum Score of a Path Between Two Cities
Minimum Swaps to Arrange a Binary Grid	Minimum Swaps to Arrange a Binary Grid
Network Recovery Pathways	Network Recovery Pathways
Number of Good Pairs	Number of Good Pairs
Number of Paths with Max Score	Number of Paths with Max Score
Number of Strings That Appear as Substrings in Word	Number of Strings That Appear as Substrings in Word
Number of Substrings Containing All Three Characters	Number of Substrings Containing All Three Characters
Number of Unique XOR Triplets I	Number of Unique XOR Triplets I
Number of ZigZag Arrays I	Number of ZigZag Arrays I
Number of ZigZag Arrays II	Number of ZigZag Arrays II
Partition Array According to Given Pivot	Partition Array According to Given Pivot
Path Existence Queries in a Graph I	Path Existence Queries in a Graph I
Path Existence Queries in a Graph II	Path Existence Queries in a Graph II
Path Sum	Path Sum
README.md	README.md
Remove Covered Intervals	Remove Covered Intervals
Remove Duplicates from Sorted Array	Remove Duplicates from Sorted Array
Remove Element	Remove Element
Robot Return to Origin	Robot Return to Origin

Name

Last commit message

Last commit date

131 Commits

1406. Stone Game III

486. Predict the Winner

605. Can Place Flowers

877. Stone Game

Add to Array-Form of Integer

Arranging Coins

Best Time to Buy and Sell Stock

Binary Tree Maximum Path Sum