Files

solutions
- 0004-median-of-two-sorted-arrays
- 0011-Container-With-Most-Water
- 0017-Letter-Combinations-of-a-Phone-Number
- 0020-Valid-Parentheses
- 0026-remove-duplicates-from-sorted-array
- 0033-search-in-rotated-sorted-array
- 0034-Find-First-and-Last-Position-of-Element-in-Sorted-Array
- 0039-Combination-Sum
- 0040-Combination-Sum-II
- 0046-Permutations
- 0047-Permutations-II
- 0051-N-Queens
- 0053-Maximum-Subarray
- 0069-Sqrt-x
- 0070-Climbing-Stairs
  - 0070-LeetCode-solution.md
  - 0070.py
- 0074-search-a-2d-matrix
- 0075-Sort-Colors
- 0077-Combinations
- 0078-Subsets
- 0079-Word-Search
- 0080-remove-duplicates-from-sorted-array-ii
- 0081-search-in-rotated-sorted-array-ii
- 0088-Merge-Sorted-Array
- 0090-Subsets-II
- 0093-Restore-IP-Addresses
- 0095-Unique-Binary-Search-Trees-II
- 0098-Validate-Binary-Search-Tree
- 0100-Same-Tree
- 0101-Symmetric-Tree
- 0102-Binary-Tree-Level-Order-Traversal
- 0103-Binary-Tree-Zigzag-Level-Order-Traversal
- 0104-Maximum-Depth-of-Binary-Tree
- 0105-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal
- 0106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal
- 0110-Balanced-Binary-Tree
- 0111-Minimum-Depth-of-Binary-Tree
- 0113-Path-Sum-II
- 0114-Flatten-Binary-Tree-to-Linked-List
- 0116-Populating-Next-Right-Pointers-in-Each-Node
- 0118-Pascal's-Triangle
- 0121-Best-Time-to-Buy-and-Sell-Stock
- 0122-Best-Time-to-Buy-and-Sell-Stock-II
- 0123-Best-Time-to-Buy-and-Sell-Stock-III
- 0127-Word-Ladder
- 0129-Sum-Root-to-Leaf-Numbers
- 0130-Surrounded-Regions
- 0141-Linked-List-Cycle
- 0144-Binary-Tree-Preorder-Traversal
- 0145-Binary-Tree-Postorder-Traversal
- 0153-Find-Minimum-in-Rotated-Sorted-Array
- 0162-find-peak-element
- 0167-Two-Sum-II-Input-array-is-sorted
- 0169-Majority-Element
- 0188-Best-Time-to-Buy-and-Sell-Stock-IV
- 0200-Number-of-Islands
- 0206-Reverse-Linked-List
- 0215-Kth-Largest-Element-in-an-Array
- 0222-Count-Complete-Tree-Nodes
- 0225-Implement-Stack-using-Queues
- 0226-Invert-Binary-Tree
- 0230-Kth-Smallest-Element-in-a-BST
- 0235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree
- 0236-Lowest-Common-Ancestor-of-a-Binary-Tree
- 0240-Search-a-2D-Matrix-II
- 0241-Different-Ways-to-Add-Parentheses
- 0257-Binary-Tree-Paths
- 0278-First-Bad-Version
- 0279-Perfect-Squares
- 0283-move-zeroes
- 0300-Longest-Increasing-Subsequence
- 0309-Best-Time-to-Buy-and-Sell-Stock-with-Cooldown
- 0322-Coin-Change
- 0332-Reconstruct-Itinerary
- 0345-Reverse-Vowels-of-a-String
- 0347-Top-K-Frequent-Elements
- 0365-Water-and-Jug-Problem
- 0392-Is-Subsequence
- 0406-Queue-Reconstruction-by-Height
- 0409-Longest-Palindrome
- 0417-Pacific-Atlantic-Water-Flow
- 0429-N-ary-Tree-Level-Order-Traversal
- 0435-Non-overlapping-Intervals
- 0445-Add-Two-Numbers-II
- 0450-Delete-Node-in-a-BST
- 0451-Sort-Characters-By-Frequency
- 0452-Minimum-Number-of-Arrows-to-Burst-Balloons
- 0455-Assign-Cookies
- 0491-Increasing-Subsequences
- 0508-Most-Frequent-Subtree-Sum
- 0509-Fibonacci-Number
- 0513-Find-Bottom-Left-Tree-Value
- 0515-Find-Largest-Value-in-Each-Tree-Row
- 0524-Longest-Word-in-Dictionary-through-Deleting
- 0529-Minesweeper
- 0530-Minimum-Absolute-Difference-in-BST
- 0538-Convert-BST-to-Greater-Tree
- 0540-Single-Element-in-a-Sorted-Array
- 0542-01-Matrix
- 0543-Diameter-of-Binary-Tree
- 0547-Friend-Circles
- 0559-Maximum-Depth-of-N-ary-Tree
- 0563-Binary-Tree-Tilt
- 0589-N-ary-Tree-Preorder-Traversal
- 0590-N-ary-Tree-Postorder-Traversal
- 0605-Can-Place-Flowers
- 0606-Construct-String-from-Binary-Tree
- 0623-Add-One-Row-to-Tree
- 0633-Sum-of-Square-Numbers
- 0647-Palindromic-Substrings
- 0652-Find-Duplicate-Subtrees
- 0653-Two-Sum-IV-Input-is-a-BST
- 0654-Maximum-Binary-Tree
- 0655-Print-Binary-Tree
- 0657-Robot-Return-to-Origin
- 0662-Maximum-Width-of-Binary-Tree
- 0665-Non-decreasing-Array
- 0669-Trim-a-Binary-Search-Tree
- 0671-Second-Minimum-Node-In-a-Binary-Tree
- 0680-Valid-Palindrome-II
- 0695-Max-Area-of-Island
- 0700-Search-in-a-Binary-Search-Tree
- 0701-Insert-into-a-Binary-Search-Tree
- 0702-search-in-a-sorted-array-of-unknown-size
- 0704-binary-search
- 0714-Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee
- 0744-Find-Smallest-Letter-Greater-Than-Target
- 0783-Minimum-Distance-Between-BST-Nodes
- 0814-Binary-Tree-Pruning
- 0836-Rectangle-Overlap
- 0875-koko-eating-bananas
- 0876-Middle-of-the-Linked-List
- 0892-Surface-Area-of-3D-Shapes
- 0912-Sort-an-Array
- 0914-X-of-a-Kind-in-a-Deck-of-Cards
- 0994-Rotting-Oranges
- 1013-Partition-Array-Into-Three-Parts-With-Equal-Sum
- 1038-Binary-Search-Tree-to-Greater-Sum-Tree
- 1071-Greatest-Common-Divisor-of-Strings
- 1091-Shortest-Path-in-Binary-Matrix
- 1103-Distribute-Candies-to-People
- 1160-Find-Words-That-Can-Be-Formed-by-Characters
- 1283-find-the-smallest-divisor-given-a-threshold
- 1358-Number-of-Substrings-Containing-All-Three-Characters
- 1360-Number-of-Days-Between-Two-Dates
- 1362-Closest-Divisors
- 1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number
- 1366-Rank-Teams-by-Votes
- 1367-Linked-List-in-Binary-Tree
- 1370-Increasing-Decreasing-String
- 1372-Longest-ZigZag-Path-in-a-Binary-Tree
- 1374-Generate-a-String-With-Characters-That-Have-Odd-Counts
- 1375-Bulb-Switcher-III
- 1376-Time-Needed-to-Inform-All-Employees
- 1380-Lucky-Numbers-in-a-Matrix
- 1381-Design-a-Stack-With-Increment-Operation
- 1382-Balance-a-Binary-Search-Tree
- 1385-Find-the-Distance-Value-Between-Two-Arrays
- 1386-Cinema-Seat-Allocation
- 1387-Sort-Integers-by-The-Power-Value
- 1389-Create-Target-Array-in-the-Given-Order
- 1390-Four-Divisors
- 1394-Find-Lucky-Integer-in-an-Array
- 1395-Count-Number-of-Teams
- 1396-Design-Underground-System
- 1408-String-Matching-in-an-Array
- 1409-Queries-on-a-Permutation-With-Key
- 1410-HTML-Entity-Parser
- 1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum
- 1414-Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K
- 1415-The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n
- 1417-Reformat-The-String
- Interview-01.06-compress-string-lcci
- Interview-01.07-rotate-matrix-lcci
- Interview-03-shu-zu-zhong-zhong-fu-de-shu-zi-lcof
- Interview-04-er-wei-shu-zu-zhong-de-cha-zhao-lcof
- Interview-04.02-Minimum-Height-Tree-LCCI
- Interview-04.03-List-of-Depth-LCCI
- Interview-04.04-Check-Balance-LCCI
- Interview-04.05-Legal-Binary-Search-Tree-LCCI
- Interview-04.06-Successor-LCCI
- Interview-04.08-First-Common-Ancestor-LCCI
- Interview-04.10-check-subtree-lcci
- Interview-04.12-Paths-with-Sum-LCCI
- Interview-05-ti-huan-kong-ge-lcof
- Interview-06-cong-wei-dao-tou-da-yin-lian-biao-lcof
- Interview-07-zhong-jian-er-cha-shu-lcof
- Interview-09-yong-liang-ge-zhan-shi-xian-dui-lie-lcof
- Interview-10-fei-bo-na-qi-shu-lie-lcof
- Interview-10-qing-wa-tiao-tai-jie-wen-ti-lcof
- Interview-10.01-Sorted-Merge-LCCI
- Interview-11-xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof
- Interview-13-ji-qi-ren-de-yun-dong-fan-wei-lcof
- Interview-15-er-jin-zhi-zhong-1de-ge-shu-lcof
- Interview-17-da-yin-cong-1dao-zui-da-de-nwei-shu-lcof
- Interview-17.12-BiNode-LCCI
- Interview-17.16-The-Masseuse-LCCI
- Interview-26-shu-de-zi-jie-gou-lcof
- Interview-27-er-cha-shu-de-jing-xiang-lcof
- Interview-28-dui-cheng-de-er-cha-shu-lcof
- Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof
- Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof
- Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-lcof
- Interview-33-er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof
- Interview-34-er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof
- Interview-36-er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof
- Interview-37-xu-lie-hua-er-cha-shu-lcof
- Interview-53-que-shi-de-shu-zi-lcof
- Interview-53-zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof
- Interview-54-er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof
- Interview-55-er-cha-shu-de-shen-du-lcof
- Interview-55-ping-heng-er-cha-shu-lcof
- Interview-57-II
- Interview-59-II
- Interview-62-yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof
- Interview-68-er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof
- Interview-68-er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof
- LCP06-na-ying-bi
- LCP07-chuan-di-xin-xi
- LCP08-ju-qing-hong-fa-shi-jian
.gitignore
LICENSE
README.md

0070.py

💚Upload 0070 Code

Mar 27, 2020

1ed3b9c · Mar 27, 2020