FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[Original HTTPS Page]
LeetCode/Stack at master · suhas25/LeetCode · GitHub
suhas25
/
LeetCode
Public
forked from
wisdompeak/LeetCode
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode
/
Stack
/
Copy path
Directory actions
More options
More options
Directory actions
More options
More options
Latest commit
History
History
History
Breadcrumbs
LeetCode
/
Stack
/
Copy path
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
032.Longest-Valid-Parentheses
032.Longest-Valid-Parentheses
071.Simplify-Path
071.Simplify-Path
084.Largest-Rectangle-in-Histogram
084.Largest-Rectangle-in-Histogram
085.Maximal-Rectangle
085.Maximal-Rectangle
1019.Next-Greater-Node-In-Linked-List
1019.Next-Greater-Node-In-Linked-List
1063.Number-of-Valid-Subarrays
1063.Number-of-Valid-Subarrays
1081.Smallest-Subsequence-of-Distinct-Characters
1081.Smallest-Subsequence-of-Distinct-Characters
1087.Brace-Expansion
1087.Brace-Expansion
1096.Brace-Expansion-II
1096.Brace-Expansion-II
1106.Parsing-A-Boolean-Expression
1106.Parsing-A-Boolean-Expression
1124.Longest-Well-Performing-Interval
1124.Longest-Well-Performing-Interval
1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses
1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses
1209.Remove-All-Adjacent-Duplicates-in-String-II
1209.Remove-All-Adjacent-Duplicates-in-String-II
1504.Count-Submatrices-With-All-Ones
1504.Count-Submatrices-With-All-Ones
155.Min-Stack
155.Min-Stack
1586.Binary-Search-Tree-Iterator-II
1586.Binary-Search-Tree-Iterator-II
1673.Find-the-Most-Competitive-Subsequence
1673.Find-the-Most-Competitive-Subsequence
173.Binary-Search-Tree-Iterator
173.Binary-Search-Tree-Iterator
1856.Maximum-Subarray-Min-Product
1856.Maximum-Subarray-Min-Product
1896.Minimum-Cost-to-Change-the-Final-Value-of-Expression
1896.Minimum-Cost-to-Change-the-Final-Value-of-Expression
1944.Number-of-Visible-People-in-a-Queue
1944.Number-of-Visible-People-in-a-Queue
1950.Maximum-of-Minimum-Values-in-All-Subarrays
1950.Maximum-of-Minimum-Values-in-All-Subarrays
1966.Binary-Searchable-Numbers-in-an-Unsorted-Array
1966.Binary-Searchable-Numbers-in-an-Unsorted-Array
2030.Smallest-K-Length-Subsequence-With-Occurrences-of-a-Letter
2030.Smallest-K-Length-Subsequence-With-Occurrences-of-a-Letter
2104.Sum-of-Subarray-Ranges
2104.Sum-of-Subarray-Ranges
2197.Replace-Non-Coprime-Numbers-in-Array
2197.Replace-Non-Coprime-Numbers-in-Array
224.Basic-Calculator
224.Basic-Calculator
225.Implement-Stack-using-Queues
225.Implement-Stack-using-Queues
227.Basic-Calculator-II
227.Basic-Calculator-II
2282.Number-of-People-That-Can-Be-Seen-in-a-Grid
2282.Number-of-People-That-Can-Be-Seen-in-a-Grid
232.Implement-Queue-using-Stacks
232.Implement-Queue-using-Stacks
2334.Subarray-With-Elements-Greater-Than-Varying-Threshold
2334.Subarray-With-Elements-Greater-Than-Varying-Threshold
2355.Maximum-Number-of-Books-You-Can-Take
2355.Maximum-Number-of-Books-You-Can-Take
2434.Using-a-Robot-to-Print-the-Lexicographically-Smallest-String
2434.Using-a-Robot-to-Print-the-Lexicographically-Smallest-String
2454.Next-Greater-Element-IV
2454.Next-Greater-Element-IV
2751.Robot-Collisions
2751.Robot-Collisions
2764.is-Array-a-Preorder-of-Some-Binary-Tree
2764.is-Array-a-Preorder-of-Some-Binary-Tree
2863.Maximum-Length-of-Semi-Decreasing-Subarrays
2863.Maximum-Length-of-Semi-Decreasing-Subarrays
2866.Beautiful-Towers-II
2866.Beautiful-Towers-II
316.Remove-Duplicate-Letters
316.Remove-Duplicate-Letters
321.Create-Maximum-Number
321.Create-Maximum-Number
341.Flatten-Nested-List-Iterator
341.Flatten-Nested-List-Iterator
385.Mini-Parser
385.Mini-Parser
402.Remove-K-Digits
402.Remove-K-Digits
439.Ternary-Expression-Parser
439.Ternary-Expression-Parser
456.132-Pattern
456.132-Pattern
496.Next-Greater-Element-I
496.Next-Greater-Element-I
503.Next-Greater-Element-II
503.Next-Greater-Element-II
536.Construct-Binary-Tree-from-String
536.Construct-Binary-Tree-from-String
591.Tag-Validator
591.Tag-Validator
636.Exclusive-Time-of-Functions
636.Exclusive-Time-of-Functions
654.Maximum-Binary-Tree
654.Maximum-Binary-Tree
726.Number-of-Atoms
726.Number-of-Atoms
739.Daily-Temperatures
739.Daily-Temperatures
768.Max-Chunks-To-Make-Sorted-II
768.Max-Chunks-To-Make-Sorted-II
772.Basic-Calculator-III
772.Basic-Calculator-III
856.Score-of-Parentheses
856.Score-of-Parentheses
901.Online-Stock-Span
901.Online-Stock-Span
907.Sum-of-Subarray-Minimums
907.Sum-of-Subarray-Minimums
946.Validate-Stack-Sequences
946.Validate-Stack-Sequences
962.Maximum-Width-Ramp
962.Maximum-Width-Ramp
Back
|
FazBrowse Home
|
New Git URL