algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 01:44:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #39 from halfrost/add_hugo

Browse Source 
更新索引
This commit is contained in:
halfrost
2020-08-12 23:11:09 +08:00
committed by GitHub
parent bd22643bac a758c2b516
commit 8dc68dbde4
2 changed files with 75 additions and 38 deletions
Download Patch File Download Diff File Expand all files Collapse all files

74
README.md
View File

@ -82,11 +82,11 @@
| 0006 | ZigZag Conversion | | 36.3% | Medium | |
| 0007 | Reverse Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer) | 25.8% | Easy | |
| 0008 | String to Integer (atoi) | | 15.4% | Medium | |
| 0009 | Palindrome Number | | 48.4% | Easy | |
| 0009 | Palindrome Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number) | 48.4% | Easy | |
| 0010 | Regular Expression Matching | | 26.8% | Hard | |
| 0011 | Container With Most Water | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water) | 50.8% | Medium | |
| 0012 | Integer to Roman | | 55.0% | Medium | |
| 0013 | Roman to Integer | | 55.7% | Easy | |
| 0013 | Roman to Integer | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer) | 55.7% | Easy | |
| 0014 | Longest Common Prefix | | 35.4% | Easy | |
| 0015 | 3Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum) | 26.8% | Medium | |
| 0016 | 3Sum Closest | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest) | 46.0% | Medium | |
@ -140,7 +140,7 @@
| 0064 | Minimum Path Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum) | 54.4% | Medium | |
| 0065 | Valid Number | | 15.3% | Hard | |
| 0066 | Plus One | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One) | 43.0% | Easy | |
| 0067 | Add Binary | | 45.2% | Easy | |
| 0067 | Add Binary | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary) | 45.2% | Easy | |
| 0068 | Text Justification | | 27.7% | Hard | |
| 0069 | Sqrt(x) | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx) | 33.9% | Easy | |
| 0070 | Climbing Stairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs) | 47.8% | Easy | |
@ -241,10 +241,10 @@
| 0165 | Compare Version Numbers | | 27.4% | Medium | |
| 0166 | Fraction to Recurring Decimal | | 21.6% | Medium | |
| 0167 | Two Sum II - Input array is sorted | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted) | 54.0% | Easy | |
| 0168 | Excel Sheet Column Title | | 31.0% | Easy | |
| 0168 | Excel Sheet Column Title | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title) | 31.0% | Easy | |
| 0169 | Majority Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element) | 58.7% | Easy | |
| 0170 | Two Sum III - Data structure design | | 33.5% | Easy | |
| 0171 | Excel Sheet Column Number | | 54.6% | Easy | |
| 0171 | Excel Sheet Column Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0171.Excel-Sheet-Column-Number) | 54.6% | Easy | |
| 0172 | Factorial Trailing Zeroes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes) | 37.8% | Easy | |
| 0173 | Binary Search Tree Iterator | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator) | 56.5% | Medium | |
| 0174 | Dungeon Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game) | 32.3% | Hard | |
@ -331,7 +331,7 @@
| 0255 | Verify Preorder Sequence in Binary Search Tree | | 45.7% | Medium | |
| 0256 | Paint House | | 52.1% | Easy | |
| 0257 | Binary Tree Paths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths) | 51.4% | Easy | |
| 0258 | Add Digits | | 57.6% | Easy | |
| 0258 | Add Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits) | 57.6% | Easy | |
| 0259 | 3Sum Smaller | | 47.6% | Medium | |
| 0260 | Single Number III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III) | 64.3% | Medium | |
| 0261 | Graph Valid Tree | | 42.2% | Medium | |
@ -521,12 +521,12 @@
| 0445 | Add Two Numbers II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II) | 54.5% | Medium | |
| 0446 | Arithmetic Slices II - Subsequence | | 32.7% | Hard | |
| 0447 | Number of Boomerangs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs) | 51.8% | Easy | |
| 0448 | Find All Numbers Disappeared in an Array | | 55.9% | Easy | |
| 0448 | Find All Numbers Disappeared in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array) | 55.9% | Easy | |
| 0449 | Serialize and Deserialize BST | | 52.0% | Medium | |
| 0450 | Delete Node in a BST | | 43.1% | Medium | |
| 0451 | Sort Characters By Frequency | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency) | 63.0% | Medium | |
| 0452 | Minimum Number of Arrows to Burst Balloons | | 49.6% | Medium | |
| 0453 | Minimum Moves to Equal Array Elements | | 50.2% | Easy | |
| 0453 | Minimum Moves to Equal Array Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements) | 50.2% | Easy | |
| 0454 | 4Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II) | 53.1% | Medium | |
| 0455 | Assign Cookies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies) | 49.9% | Easy | |
| 0456 | 132 Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern) | 28.9% | Medium | |
@ -558,7 +558,7 @@
| 0482 | License Key Formatting | | 43.1% | Easy | |
| 0483 | Smallest Good Base | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base) | 35.7% | Hard | |
| 0484 | Find Permutation | | 60.5% | Medium | |
| 0485 | Max Consecutive Ones | | 54.7% | Easy | |
| 0485 | Max Consecutive Ones | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones) | 54.7% | Easy | |
| 0486 | Predict the Winner | | 47.9% | Medium | |
| 0487 | Max Consecutive Ones II | | 48.5% | Medium | |
| 0488 | Zuma Game | | 39.8% | Hard | |
@ -580,7 +580,7 @@
| 0504 | Base 7 | | 46.2% | Easy | |
| 0505 | The Maze II | | 47.7% | Medium | |
| 0506 | Relative Ranks | | 50.5% | Easy | |
| 0507 | Perfect Number | | 35.5% | Easy | |
| 0507 | Perfect Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number) | 35.5% | Easy | |
| 0508 | Most Frequent Subtree Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum) | 57.9% | Medium | |
| 0509 | Fibonacci Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number) | 67.2% | Easy | |
| 0510 | Inorder Successor in BST II | | 58.0% | Medium | |
@ -610,7 +610,7 @@
| 0534 | Game Play Analysis III | | 75.9% | Medium | |
| 0535 | Encode and Decode TinyURL | | 79.9% | Medium | |
| 0536 | Construct Binary Tree from String | | 48.3% | Medium | |
| 0537 | Complex Number Multiplication | | 67.4% | Medium | |
| 0537 | Complex Number Multiplication | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication) | 67.4% | Medium | |
| 0538 | Convert BST to Greater Tree | | 55.3% | Easy | |
| 0539 | Minimum Time Difference | | 51.5% | Medium | |
| 0540 | Single Element in a Sorted Array | | 57.9% | Medium | |
@ -634,7 +634,7 @@
| 0558 | Logical OR of Two Binary Grids Represented as Quad-Trees | | 44.6% | Medium | |
| 0559 | Maximum Depth of N-ary Tree | | 68.6% | Easy | |
| 0560 | Subarray Sum Equals K | | 43.8% | Medium | |
| 0561 | Array Partition I | | 72.0% | Easy | |
| 0561 | Array Partition I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition-I) | 72.0% | Easy | |
| 0562 | Longest Line of Consecutive One in Matrix | | 45.8% | Medium | |
| 0563 | Binary Tree Tilt | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt) | 48.7% | Easy | |
| 0564 | Find the Closest Palindrome | | 19.7% | Hard | |
@ -671,7 +671,7 @@
| 0595 | Big Countries | | 77.3% | Easy | |
| 0596 | Classes More Than 5 Students | | 38.0% | Easy | |
| 0597 | Friend Requests I: Overall Acceptance Rate | | 40.9% | Easy | |
| 0598 | Range Addition II | | 49.6% | Easy | |
| 0598 | Range Addition II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II) | 49.6% | Easy | |
| 0599 | Minimum Index Sum of Two Lists | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists) | 50.7% | Easy | |
| 0600 | Non-negative Integers without Consecutive Ones | | 34.1% | Hard | |
| 0601 | Human Traffic of Stadium | | 41.6% | Hard | |
@ -734,7 +734,7 @@
| 0658 | Find K Closest Elements | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements) | 40.9% | Medium | |
| 0659 | Split Array into Consecutive Subsequences | | 43.7% | Medium | |
| 0660 | Remove 9 | | 53.3% | Hard | |
| 0661 | Image Smoother | | 51.5% | Easy | |
| 0661 | Image Smoother | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother) | 51.5% | Easy | |
| 0662 | Maximum Width of Binary Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree) | 41.1% | Medium | |
| 0663 | Equal Tree Partition | | 39.5% | Medium | |
| 0664 | Strange Printer | | 40.2% | Hard | |
@ -770,7 +770,7 @@
| 0694 | Number of Distinct Islands | | 56.0% | Medium | |
| 0695 | Max Area of Island | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island) | 62.7% | Medium | |
| 0696 | Count Binary Substrings | | 56.0% | Easy | |
| 0697 | Degree of an Array | | 53.8% | Easy | |
| 0697 | Degree of an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array) | 53.8% | Easy | |
| 0698 | Partition to K Equal Sum Subsets | | 44.9% | Medium | |
| 0699 | Falling Squares | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares) | 41.8% | Hard | |
| 0700 | Search in a Binary Search Tree | | 73.1% | Easy | |
@ -885,7 +885,7 @@
| 0809 | Expressive Words | | 47.0% | Medium | |
| 0810 | Chalkboard XOR Game | | 48.2% | Hard | |
| 0811 | Subdomain Visit Count | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count) | 69.8% | Easy | |
| 0812 | Largest Triangle Area | | 58.3% | Easy | |
| 0812 | Largest Triangle Area | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area) | 58.3% | Easy | |
| 0813 | Largest Sum of Averages | | 49.9% | Medium | |
| 0814 | Binary Tree Pruning | | 74.5% | Medium | |
| 0815 | Bus Routes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes) | 42.6% | Hard | |
@ -905,7 +905,7 @@
| 0829 | Consecutive Numbers Sum | | 37.4% | Hard | |
| 0830 | Positions of Large Groups | | 49.6% | Easy | |
| 0831 | Masking Personal Information | | 44.1% | Medium | |
| 0832 | Flipping an Image | | 76.2% | Easy | |
| 0832 | Flipping an Image | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image) | 76.2% | Easy | |
| 0833 | Find And Replace in String | | 50.4% | Medium | |
| 0834 | Sum of Distances in Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree) | 43.7% | Hard | |
| 0835 | Image Overlap | | 58.5% | Medium | |
@ -961,15 +961,15 @@
| 0885 | Spiral Matrix III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III) | 69.3% | Medium | |
| 0886 | Possible Bipartition | | 44.1% | Medium | |
| 0887 | Super Egg Drop | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop) | 27.0% | Hard | |
| 0888 | Fair Candy Swap | | 58.3% | Easy | |
| 0888 | Fair Candy Swap | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0888.Fair-Candy-Swap) | 58.3% | Easy | |
| 0889 | Construct Binary Tree from Preorder and Postorder Traversal | | 66.1% | Medium | |
| 0890 | Find and Replace Pattern | | 73.4% | Medium | |
| 0891 | Sum of Subsequence Widths | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths) | 31.9% | Hard | |
| 0892 | Surface Area of 3D Shapes | | 58.9% | Easy | |
| 0892 | Surface Area of 3D Shapes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0892.Surface-Area-of-3D-Shapes) | 58.9% | Easy | |
| 0893 | Groups of Special-Equivalent Strings | | 66.5% | Easy | |
| 0894 | All Possible Full Binary Trees | | 75.2% | Medium | |
| 0895 | Maximum Frequency Stack | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack) | 60.6% | Hard | |
| 0896 | Monotonic Array | | 57.9% | Easy | |
| 0896 | Monotonic Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0896.Monotonic-Array) | 57.9% | Easy | |
| 0897 | Increasing Order Search Tree | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree) | 70.7% | Easy | |
| 0898 | Bitwise ORs of Subarrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays) | 34.8% | Medium | |
| 0899 | Orderly Queue | | 52.2% | Hard | |
@ -987,7 +987,7 @@
| 0911 | Online Election | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election) | 50.4% | Medium | |
| 0912 | Sort an Array | | 63.8% | Medium | |
| 0913 | Cat and Mouse | | 31.3% | Hard | |
| 0914 | X of a Kind in a Deck of Cards | | 34.9% | Easy | |
| 0914 | X of a Kind in a Deck of Cards | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards) | 34.9% | Easy | |
| 0915 | Partition Array into Disjoint Intervals | | 45.3% | Medium | |
| 0916 | Word Subsets | | 47.8% | Medium | |
| 0917 | Reverse Only Letters | | 57.9% | Easy | |
@ -1022,7 +1022,7 @@
| 0946 | Validate Stack Sequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences) | 61.8% | Medium | |
| 0947 | Most Stones Removed with Same Row or Column | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column) | 55.3% | Medium | |
| 0948 | Bag of Tokens | | 40.8% | Medium | |
| 0949 | Largest Time for Given Digits | | 35.9% | Easy | |
| 0949 | Largest Time for Given Digits | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits) | 35.9% | Easy | |
| 0950 | Reveal Cards In Increasing Order | | 74.6% | Medium | |
| 0951 | Flip Equivalent Binary Trees | | 65.7% | Medium | |
| 0952 | Largest Component Size by Common Factor | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor) | 30.3% | Hard | |
@ -1058,7 +1058,7 @@
| 0982 | Triples with Bitwise AND Equal To Zero | | 55.5% | Hard | |
| 0983 | Minimum Cost For Tickets | | 60.5% | Medium | |
| 0984 | String Without AAA or BBB | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB) | 37.7% | Medium | |
| 0985 | Sum of Even Numbers After Queries | | 61.3% | Easy | |
| 0985 | Sum of Even Numbers After Queries | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0985.Sum-of-Even-Numbers-After-Queries) | 61.3% | Easy | |
| 0986 | Interval List Intersections | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections) | 67.3% | Medium | |
| 0987 | Vertical Order Traversal of a Binary Tree | | 36.6% | Medium | |
| 0988 | Smallest String Starting From Leaf | | 46.0% | Medium | |
@ -1072,7 +1072,7 @@
| 0996 | Number of Squareful Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays) | 47.9% | Hard | |
| 0997 | Find the Town Judge | | 50.1% | Easy | |
| 0998 | Maximum Binary Tree II | | 62.9% | Medium | |
| 0999 | Available Captures for Rook | | 66.7% | Easy | |
| 0999 | Available Captures for Rook | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook) | 66.7% | Easy | |
| 1000 | Minimum Cost to Merge Stones | | 39.6% | Hard | |
| 1001 | Grid Illumination | | 35.9% | Hard | |
| 1002 | Find Common Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters) | 67.7% | Easy | |
@ -1110,7 +1110,7 @@
| 1034 | Coloring A Border | | 44.7% | Medium | |
| 1035 | Uncrossed Lines | | 56.1% | Medium | |
| 1036 | Escape a Large Maze | | 35.4% | Hard | |
| 1037 | Valid Boomerang | | 37.9% | Easy | |
| 1037 | Valid Boomerang | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang) | 37.9% | Easy | |
| 1038 | Binary Search Tree to Greater Sum Tree | | 80.8% | Medium | |
| 1039 | Minimum Score Triangulation of Polygon | | 49.1% | Medium | |
| 1040 | Moving Stones Until Consecutive II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II) | 52.9% | Medium | |
@ -1124,7 +1124,7 @@
| 1048 | Longest String Chain | | 54.7% | Medium | |
| 1049 | Last Stone Weight II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II) | 44.1% | Medium | |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | | 71.7% | Easy | |
| 1051 | Height Checker | | 71.1% | Easy | |
| 1051 | Height Checker | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1051.Height-Checker) | 71.1% | Easy | |
| 1052 | Grumpy Bookstore Owner | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner) | 55.4% | Medium | |
| 1053 | Previous Permutation With One Swap | | 48.5% | Medium | |
| 1054 | Distant Barcodes | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes) | 43.2% | Medium | |
@ -1162,7 +1162,7 @@
| 1086 | High Five | | 79.6% | Easy | |
| 1087 | Brace Expansion | | 62.7% | Medium | |
| 1088 | Confusing Number II | | 43.9% | Hard | |
| 1089 | Duplicate Zeros | | 53.0% | Easy | |
| 1089 | Duplicate Zeros | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1089.Duplicate-Zeros) | 53.0% | Easy | |
| 1090 | Largest Values From Labels | | 58.9% | Medium | |
| 1091 | Shortest Path in Binary Matrix | | 38.2% | Medium | |
| 1092 | Shortest Common Supersequence | | 51.6% | Hard | |
@ -1333,7 +1333,7 @@
| 1257 | Smallest Common Region | | 58.8% | Medium | |
| 1258 | Synonymous Sentences | | 64.4% | Medium | |
| 1259 | Handshakes That Don't Cross | | 53.5% | Hard | |
| 1260 | Shift 2D Grid | | 61.3% | Easy | |
| 1260 | Shift 2D Grid | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid) | 61.3% | Easy | |
| 1261 | Find Elements in a Contaminated Binary Tree | | 74.3% | Medium | |
| 1262 | Greatest Sum Divisible by Three | | 47.6% | Medium | |
| 1263 | Minimum Moves to Move a Box to Their Target Location | | 41.4% | Hard | |
@ -1348,7 +1348,7 @@
| 1272 | Remove Interval | | 58.6% | Medium | |
| 1273 | Delete Tree Nodes | | 63.5% | Medium | |
| 1274 | Number of Ships in a Rectangle | | 66.5% | Hard | |
| 1275 | Find Winner on a Tic Tac Toe Game | | 52.9% | Easy | |
| 1275 | Find Winner on a Tic Tac Toe Game | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game) | 52.9% | Easy | |
| 1276 | Number of Burgers with No Waste of Ingredients | | 49.6% | Medium | |
| 1277 | Count Square Submatrices with All Ones | | 73.2% | Medium | |
| 1278 | Palindrome Partitioning III | | 59.9% | Hard | |
@ -1386,11 +1386,11 @@
| 1310 | XOR Queries of a Subarray | | 68.6% | Medium | |
| 1311 | Get Watched Videos by Your Friends | | 43.1% | Medium | |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | | 58.1% | Hard | |
| 1313 | Decompress Run-Length Encoded List | | 85.1% | Easy | |
| 1313 | Decompress Run-Length Encoded List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1313.Decompress-Run-Length-Encoded-List) | 85.1% | Easy | |
| 1314 | Matrix Block Sum | | 73.7% | Medium | |
| 1315 | Sum of Nodes with Even-Valued Grandparent | | 83.5% | Medium | |
| 1316 | Distinct Echo Substrings | | 46.4% | Hard | |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | | 56.7% | Easy | |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers) | 56.7% | Easy | |
| 1318 | Minimum Flips to Make a OR b Equal to c | | 62.8% | Medium | |
| 1319 | Number of Operations to Make Network Connected | | 53.1% | Medium | |
| 1320 | Minimum Distance to Type a Word Using Two Fingers | | 62.3% | Hard | |
@ -1453,16 +1453,16 @@
| 1377 | Frog Position After T Seconds | | 33.6% | Hard | |
| 1378 | Replace Employee ID With The Unique Identifier | | 87.4% | Easy | |
| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | | 83.8% | Medium | |
| 1380 | Lucky Numbers in a Matrix | | 71.4% | Easy | |
| 1380 | Lucky Numbers in a Matrix | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix) | 71.4% | Easy | |
| 1381 | Design a Stack With Increment Operation | | 74.7% | Medium | |
| 1382 | Balance a Binary Search Tree | | 74.8% | Medium | |
| 1383 | Maximum Performance of a Team | | 31.8% | Hard | |
| 1384 | Total Sales Amount by Year | | 62.8% | Hard | |
| 1385 | Find the Distance Value Between Two Arrays | | 67.1% | Easy | |
| 1385 | Find the Distance Value Between Two Arrays | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays) | 67.1% | Easy | |
| 1386 | Cinema Seat Allocation | | 34.8% | Medium | |
| 1387 | Sort Integers by The Power Value | | 70.1% | Medium | |
| 1388 | Pizza With 3n Slices | | 44.7% | Hard | |
| 1389 | Create Target Array in the Given Order | | 84.1% | Easy | |
| 1389 | Create Target Array in the Given Order | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1389.Create-Target-Array-in-the-Given-Order) | 84.1% | Easy | |
| 1390 | Four Divisors | | 38.1% | Medium | |
| 1391 | Check if There is a Valid Path in a Grid | | 44.5% | Medium | |
| 1392 | Longest Happy Prefix | | 40.0% | Hard | |
@ -1528,7 +1528,7 @@
| 1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | | 53.3% | Medium | |
| 1453 | Maximum Number of Darts Inside of a Circular Dartboard | | 33.7% | Hard | |
| 1454 | Active Users | | 37.5% | Medium | |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | | 64.7% | Easy | |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence) | 64.7% | Easy | |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | | 52.4% | Medium | |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | | 67.2% | Medium | |
| 1458 | Max Dot Product of Two Subsequences | | 41.7% | Hard | |
@ -1537,13 +1537,13 @@
| 1461 | Check If a String Contains All Binary Codes of Size K | | 44.6% | Medium | |
| 1462 | Course Schedule IV | | 41.7% | Medium | |
| 1463 | Cherry Pickup II | | 65.5% | Hard | |
| 1464 | Maximum Product of Two Elements in an Array | | 78.1% | Easy | |
| 1464 | Maximum Product of Two Elements in an Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array) | 78.1% | Easy | |
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | | 30.8% | Medium | |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | | 63.6% | Medium | |
| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | | 61.1% | Hard | |
| 1468 | Calculate Salaries | | 78.0% | Medium | |
| 1469 | Find All The Lonely Nodes | | 81.5% | Easy | |
| 1470 | Shuffle the Array | | 89.0% | Easy | |
| 1470 | Shuffle the Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array) | 89.0% | Easy | |
| 1471 | The k Strongest Values in an Array | | 57.0% | Medium | |
| 1472 | Design Browser History | | 64.5% | Medium | |
| 1473 | Paint House III | | 48.1% | Hard | |

39
website/content/menu/index.md
View File

@ -36,7 +36,9 @@ headless: true
- [0003.Longest-Substring-Without-Repeating-Characters]({{< relref "/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md" >}})
- [0004.Median-of-Two-Sorted-Arrays]({{< relref "/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md" >}})
- [0007.Reverse-Integer]({{< relref "/ChapterFour/0007.Reverse-Integer.md" >}})
- [0009.Palindrome-Number]({{< relref "/ChapterFour/0009.Palindrome-Number.md" >}})
- [0011.Container-With-Most-Water]({{< relref "/ChapterFour/0011.Container-With-Most-Water.md" >}})
- [0013.Roman-to-Integer]({{< relref "/ChapterFour/0013.Roman-to-Integer.md" >}})
- [0015.3Sum]({{< relref "/ChapterFour/0015.3Sum.md" >}})
- [0016.3Sum-Closest]({{< relref "/ChapterFour/0016.3Sum-Closest.md" >}})
- [0017.Letter-Combinations-of-a-Phone-Number]({{< relref "/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md" >}})
@ -81,6 +83,7 @@ headless: true
- [0063.Unique-Paths-II]({{< relref "/ChapterFour/0063.Unique-Paths-II.md" >}})
- [0064.Minimum-Path-Sum]({{< relref "/ChapterFour/0064.Minimum-Path-Sum.md" >}})
- [0066.Plus-One]({{< relref "/ChapterFour/0066.Plus-One.md" >}})
- [0067.Add-Binary]({{< relref "/ChapterFour/0067.Add-Binary.md" >}})
- [0069.Sqrtx]({{< relref "/ChapterFour/0069.Sqrtx.md" >}})
- [0070.Climbing-Stairs]({{< relref "/ChapterFour/0070.Climbing-Stairs.md" >}})
- [0071.Simplify-Path]({{< relref "/ChapterFour/0071.Simplify-Path.md" >}})
@ -152,7 +155,9 @@ headless: true
- [0162.Find-Peak-Element]({{< relref "/ChapterFour/0162.Find-Peak-Element.md" >}})
- [0164.Maximum-Gap]({{< relref "/ChapterFour/0164.Maximum-Gap.md" >}})
- [0167.Two-Sum-II---Input-array-is-sorted]({{< relref "/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md" >}})
- [0168.Excel-Sheet-Column-Title]({{< relref "/ChapterFour/0168.Excel-Sheet-Column-Title.md" >}})
- [0169.Majority-Element]({{< relref "/ChapterFour/0169.Majority-Element.md" >}})
- [0171.Excel-Sheet-Column-Number]({{< relref "/ChapterFour/0171.Excel-Sheet-Column-Number.md" >}})
- [0172.Factorial-Trailing-Zeroes]({{< relref "/ChapterFour/0172.Factorial-Trailing-Zeroes.md" >}})
- [0173.Binary-Search-Tree-Iterator]({{< relref "/ChapterFour/0173.Binary-Search-Tree-Iterator.md" >}})
- [0174.Dungeon-Game]({{< relref "/ChapterFour/0174.Dungeon-Game.md" >}})
@ -199,6 +204,7 @@ headless: true
- [0240.Search-a-2D-Matrix-II]({{< relref "/ChapterFour/0240.Search-a-2D-Matrix-II.md" >}})
- [0242.Valid-Anagram]({{< relref "/ChapterFour/0242.Valid-Anagram.md" >}})
- [0257.Binary-Tree-Paths]({{< relref "/ChapterFour/0257.Binary-Tree-Paths.md" >}})
- [0258.Add-Digits]({{< relref "/ChapterFour/0258.Add-Digits.md" >}})
- [0260.Single-Number-III]({{< relref "/ChapterFour/0260.Single-Number-III.md" >}})
- [0263.Ugly-Number]({{< relref "/ChapterFour/0263.Ugly-Number.md" >}})
- [0268.Missing-Number]({{< relref "/ChapterFour/0268.Missing-Number.md" >}})
@ -265,7 +271,9 @@ headless: true
- [0441.Arranging-Coins]({{< relref "/ChapterFour/0441.Arranging-Coins.md" >}})
- [0445.Add-Two-Numbers-II]({{< relref "/ChapterFour/0445.Add-Two-Numbers-II.md" >}})
- [0447.Number-of-Boomerangs]({{< relref "/ChapterFour/0447.Number-of-Boomerangs.md" >}})
- [0448.Find-All-Numbers-Disappeared-in-an-Array]({{< relref "/ChapterFour/0448.Find-All-Numbers-Disappeared-in-an-Array.md" >}})
- [0451.Sort-Characters-By-Frequency]({{< relref "/ChapterFour/0451.Sort-Characters-By-Frequency.md" >}})
- [0453.Minimum-Moves-to-Equal-Array-Elements]({{< relref "/ChapterFour/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})
- [0454.4Sum-II]({{< relref "/ChapterFour/0454.4Sum-II.md" >}})
- [0455.Assign-Cookies]({{< relref "/ChapterFour/0455.Assign-Cookies.md" >}})
- [0456.132-Pattern]({{< relref "/ChapterFour/0456.132-Pattern.md" >}})
@ -279,6 +287,7 @@ headless: true
- [0477.Total-Hamming-Distance]({{< relref "/ChapterFour/0477.Total-Hamming-Distance.md" >}})
- [0480.Sliding-Window-Median]({{< relref "/ChapterFour/0480.Sliding-Window-Median.md" >}})
- [0483.Smallest-Good-Base]({{< relref "/ChapterFour/0483.Smallest-Good-Base.md" >}})
- [0485.Max-Consecutive-Ones]({{< relref "/ChapterFour/0485.Max-Consecutive-Ones.md" >}})
- [0491.Increasing-Subsequences]({{< relref "/ChapterFour/0491.Increasing-Subsequences.md" >}})
- [0493.Reverse-Pairs]({{< relref "/ChapterFour/0493.Reverse-Pairs.md" >}})
- [0494.Target-Sum]({{< relref "/ChapterFour/0494.Target-Sum.md" >}})
@ -287,6 +296,7 @@ headless: true
- [0498.Diagonal-Traverse]({{< relref "/ChapterFour/0498.Diagonal-Traverse.md" >}})
- [0500.Keyboard-Row]({{< relref "/ChapterFour/0500.Keyboard-Row.md" >}})
- [0503.Next-Greater-Element-II]({{< relref "/ChapterFour/0503.Next-Greater-Element-II.md" >}})
- [0507.Perfect-Number]({{< relref "/ChapterFour/0507.Perfect-Number.md" >}})
- [0508.Most-Frequent-Subtree-Sum]({{< relref "/ChapterFour/0508.Most-Frequent-Subtree-Sum.md" >}})
- [0509.Fibonacci-Number]({{< relref "/ChapterFour/0509.Fibonacci-Number.md" >}})
- [0513.Find-Bottom-Left-Tree-Value]({{< relref "/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md" >}})
@ -296,16 +306,19 @@ headless: true
- [0528.Random-Pick-with-Weight]({{< relref "/ChapterFour/0528.Random-Pick-with-Weight.md" >}})
- [0529.Minesweeper]({{< relref "/ChapterFour/0529.Minesweeper.md" >}})
- [0532.K-diff-Pairs-in-an-Array]({{< relref "/ChapterFour/0532.K-diff-Pairs-in-an-Array.md" >}})
- [0537.Complex-Number-Multiplication]({{< relref "/ChapterFour/0537.Complex-Number-Multiplication.md" >}})
- [0541.Reverse-String-II]({{< relref "/ChapterFour/0541.Reverse-String-II.md" >}})
- [0542.01-Matrix]({{< relref "/ChapterFour/0542.01-Matrix.md" >}})
- [0547.Friend-Circles]({{< relref "/ChapterFour/0547.Friend-Circles.md" >}})
- [0557.Reverse-Words-in-a-String-III]({{< relref "/ChapterFour/0557.Reverse-Words-in-a-String-III.md" >}})
- [0561.Array-Partition-I]({{< relref "/ChapterFour/0561.Array-Partition-I.md" >}})
- [0563.Binary-Tree-Tilt]({{< relref "/ChapterFour/0563.Binary-Tree-Tilt.md" >}})
- [0566.Reshape-the-Matrix]({{< relref "/ChapterFour/0566.Reshape-the-Matrix.md" >}})
- [0567.Permutation-in-String]({{< relref "/ChapterFour/0567.Permutation-in-String.md" >}})
- [0572.Subtree-of-Another-Tree]({{< relref "/ChapterFour/0572.Subtree-of-Another-Tree.md" >}})
- [0575.Distribute-Candies]({{< relref "/ChapterFour/0575.Distribute-Candies.md" >}})
- [0594.Longest-Harmonious-Subsequence]({{< relref "/ChapterFour/0594.Longest-Harmonious-Subsequence.md" >}})
- [0598.Range-Addition-II]({{< relref "/ChapterFour/0598.Range-Addition-II.md" >}})
- [0599.Minimum-Index-Sum-of-Two-Lists]({{< relref "/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md" >}})
- [0628.Maximum-Product-of-Three-Numbers]({{< relref "/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md" >}})
- [0632.Smallest-Range-Covering-Elements-from-K-Lists]({{< relref "/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})
@ -317,6 +330,7 @@ headless: true
- [0648.Replace-Words]({{< relref "/ChapterFour/0648.Replace-Words.md" >}})
- [0653.Two-Sum-IV---Input-is-a-BST]({{< relref "/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md" >}})
- [0658.Find-K-Closest-Elements]({{< relref "/ChapterFour/0658.Find-K-Closest-Elements.md" >}})
- [0661.Image-Smoother]({{< relref "/ChapterFour/0661.Image-Smoother.md" >}})
- [0662.Maximum-Width-of-Binary-Tree]({{< relref "/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md" >}})
- [0668.Kth-Smallest-Number-in-Multiplication-Table]({{< relref "/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})
- [0676.Implement-Magic-Dictionary]({{< relref "/ChapterFour/0676.Implement-Magic-Dictionary.md" >}})
@ -325,6 +339,7 @@ headless: true
- [0685.Redundant-Connection-II]({{< relref "/ChapterFour/0685.Redundant-Connection-II.md" >}})
- [0693.Binary-Number-with-Alternating-Bits]({{< relref "/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md" >}})
- [0695.Max-Area-of-Island]({{< relref "/ChapterFour/0695.Max-Area-of-Island.md" >}})
- [0697.Degree-of-an-Array]({{< relref "/ChapterFour/0697.Degree-of-an-Array.md" >}})
- [0699.Falling-Squares]({{< relref "/ChapterFour/0699.Falling-Squares.md" >}})
- [0704.Binary-Search]({{< relref "/ChapterFour/0704.Binary-Search.md" >}})
- [0705.Design-HashSet]({{< relref "/ChapterFour/0705.Design-HashSet.md" >}})
@ -366,11 +381,13 @@ headless: true
- [0802.Find-Eventual-Safe-States]({{< relref "/ChapterFour/0802.Find-Eventual-Safe-States.md" >}})
- [0803.Bricks-Falling-When-Hit]({{< relref "/ChapterFour/0803.Bricks-Falling-When-Hit.md" >}})
- [0811.Subdomain-Visit-Count]({{< relref "/ChapterFour/0811.Subdomain-Visit-Count.md" >}})
- [0812.Largest-Triangle-Area]({{< relref "/ChapterFour/0812.Largest-Triangle-Area.md" >}})
- [0815.Bus-Routes]({{< relref "/ChapterFour/0815.Bus-Routes.md" >}})
- [0817.Linked-List-Components]({{< relref "/ChapterFour/0817.Linked-List-Components.md" >}})
- [0819.Most-Common-Word]({{< relref "/ChapterFour/0819.Most-Common-Word.md" >}})
- [0826.Most-Profit-Assigning-Work]({{< relref "/ChapterFour/0826.Most-Profit-Assigning-Work.md" >}})
- [0828.COPYRIGHT-PROBLEM-XXX]({{< relref "/ChapterFour/0828.COPYRIGHT-PROBLEM-XXX.md" >}})
- [0832.Flipping-an-Image]({{< relref "/ChapterFour/0832.Flipping-an-Image.md" >}})
- [0834.Sum-of-Distances-in-Tree]({{< relref "/ChapterFour/0834.Sum-of-Distances-in-Tree.md" >}})
- [0836.Rectangle-Overlap]({{< relref "/ChapterFour/0836.Rectangle-Overlap.md" >}})
- [0838.Push-Dominoes]({{< relref "/ChapterFour/0838.Push-Dominoes.md" >}})
@ -397,14 +414,18 @@ headless: true
- [0884.Uncommon-Words-from-Two-Sentences]({{< relref "/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md" >}})
- [0885.Spiral-Matrix-III]({{< relref "/ChapterFour/0885.Spiral-Matrix-III.md" >}})
- [0887.Super-Egg-Drop]({{< relref "/ChapterFour/0887.Super-Egg-Drop.md" >}})
- [0888.Fair-Candy-Swap]({{< relref "/ChapterFour/0888.Fair-Candy-Swap.md" >}})
- [0891.Sum-of-Subsequence-Widths]({{< relref "/ChapterFour/0891.Sum-of-Subsequence-Widths.md" >}})
- [0892.Surface-Area-of-3D-Shapes]({{< relref "/ChapterFour/0892.Surface-Area-of-3D-Shapes.md" >}})
- [0895.Maximum-Frequency-Stack]({{< relref "/ChapterFour/0895.Maximum-Frequency-Stack.md" >}})
- [0896.Monotonic-Array]({{< relref "/ChapterFour/0896.Monotonic-Array.md" >}})
- [0897.Increasing-Order-Search-Tree]({{< relref "/ChapterFour/0897.Increasing-Order-Search-Tree.md" >}})
- [0898.Bitwise-ORs-of-Subarrays]({{< relref "/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md" >}})
- [0901.Online-Stock-Span]({{< relref "/ChapterFour/0901.Online-Stock-Span.md" >}})
- [0904.Fruit-Into-Baskets]({{< relref "/ChapterFour/0904.Fruit-Into-Baskets.md" >}})
- [0907.Sum-of-Subarray-Minimums]({{< relref "/ChapterFour/0907.Sum-of-Subarray-Minimums.md" >}})
- [0911.Online-Election]({{< relref "/ChapterFour/0911.Online-Election.md" >}})
- [0914.X-of-a-Kind-in-a-Deck-of-Cards]({{< relref "/ChapterFour/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})
- [0918.Maximum-Sum-Circular-Subarray]({{< relref "/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md" >}})
- [0920.Number-of-Music-Playlists]({{< relref "/ChapterFour/0920.Number-of-Music-Playlists.md" >}})
- [0921.Minimum-Add-to-Make-Parentheses-Valid]({{< relref "/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})
@ -419,6 +440,7 @@ headless: true
- [0942.DI-String-Match]({{< relref "/ChapterFour/0942.DI-String-Match.md" >}})
- [0946.Validate-Stack-Sequences]({{< relref "/ChapterFour/0946.Validate-Stack-Sequences.md" >}})
- [0947.Most-Stones-Removed-with-Same-Row-or-Column]({{< relref "/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})
- [0949.Largest-Time-for-Given-Digits]({{< relref "/ChapterFour/0949.Largest-Time-for-Given-Digits.md" >}})
- [0952.Largest-Component-Size-by-Common-Factor]({{< relref "/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md" >}})
- [0953.Verifying-an-Alien-Dictionary]({{< relref "/ChapterFour/0953.Verifying-an-Alien-Dictionary.md" >}})
- [0959.Regions-Cut-By-Slashes]({{< relref "/ChapterFour/0959.Regions-Cut-By-Slashes.md" >}})
@ -434,12 +456,14 @@ headless: true
- [0980.Unique-Paths-III]({{< relref "/ChapterFour/0980.Unique-Paths-III.md" >}})
- [0981.Time-Based-Key-Value-Store]({{< relref "/ChapterFour/0981.Time-Based-Key-Value-Store.md" >}})
- [0984.String-Without-AAA-or-BBB]({{< relref "/ChapterFour/0984.String-Without-AAA-or-BBB.md" >}})
- [0985.Sum-of-Even-Numbers-After-Queries]({{< relref "/ChapterFour/0985.Sum-of-Even-Numbers-After-Queries.md" >}})
- [0986.Interval-List-Intersections]({{< relref "/ChapterFour/0986.Interval-List-Intersections.md" >}})
- [0990.Satisfiability-of-Equality-Equations]({{< relref "/ChapterFour/0990.Satisfiability-of-Equality-Equations.md" >}})
- [0992.Subarrays-with-K-Different-Integers]({{< relref "/ChapterFour/0992.Subarrays-with-K-Different-Integers.md" >}})
- [0993.Cousins-in-Binary-Tree]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}})
- [0995.Minimum-Number-of-K-Consecutive-Bit-Flips]({{< relref "/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md" >}})
- [0996.Number-of-Squareful-Arrays]({{< relref "/ChapterFour/0996.Number-of-Squareful-Arrays.md" >}})
- [0999.Available-Captures-for-Rook]({{< relref "/ChapterFour/0999.Available-Captures-for-Rook.md" >}})
- [1002.Find-Common-Characters]({{< relref "/ChapterFour/1002.Find-Common-Characters.md" >}})
- [1003.Check-If-Word-Is-Valid-After-Substitutions]({{< relref "/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})
- [1004.Max-Consecutive-Ones-III]({{< relref "/ChapterFour/1004.Max-Consecutive-Ones-III.md" >}})
@ -453,15 +477,18 @@ headless: true
- [1026.Maximum-Difference-Between-Node-and-Ancestor]({{< relref "/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})
- [1028.Recover-a-Tree-From-Preorder-Traversal]({{< relref "/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})
- [1030.Matrix-Cells-in-Distance-Order]({{< relref "/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md" >}})
- [1037.Valid-Boomerang]({{< relref "/ChapterFour/1037.Valid-Boomerang.md" >}})
- [1040.Moving-Stones-Until-Consecutive-II]({{< relref "/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md" >}})
- [1047.Remove-All-Adjacent-Duplicates-In-String]({{< relref "/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})
- [1049.Last-Stone-Weight-II]({{< relref "/ChapterFour/1049.Last-Stone-Weight-II.md" >}})
- [1051.Height-Checker]({{< relref "/ChapterFour/1051.Height-Checker.md" >}})
- [1052.Grumpy-Bookstore-Owner]({{< relref "/ChapterFour/1052.Grumpy-Bookstore-Owner.md" >}})
- [1054.Distant-Barcodes]({{< relref "/ChapterFour/1054.Distant-Barcodes.md" >}})
- [1073.Adding-Two-Negabinary-Numbers]({{< relref "/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md" >}})
- [1074.Number-of-Submatrices-That-Sum-to-Target]({{< relref "/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})
- [1078.Occurrences-After-Bigram]({{< relref "/ChapterFour/1078.Occurrences-After-Bigram.md" >}})
- [1079.Letter-Tile-Possibilities]({{< relref "/ChapterFour/1079.Letter-Tile-Possibilities.md" >}})
- [1089.Duplicate-Zeros]({{< relref "/ChapterFour/1089.Duplicate-Zeros.md" >}})
- [1093.Statistics-from-a-Large-Sample]({{< relref "/ChapterFour/1093.Statistics-from-a-Large-Sample.md" >}})
- [1105.Filling-Bookcase-Shelves]({{< relref "/ChapterFour/1105.Filling-Bookcase-Shelves.md" >}})
- [1108.Defanging-an-IP-Address]({{< relref "/ChapterFour/1108.Defanging-an-IP-Address.md" >}})
@ -493,10 +520,12 @@ headless: true
- [1235.Maximum-Profit-in-Job-Scheduling]({{< relref "/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md" >}})
- [1252.Cells-with-Odd-Values-in-a-Matrix]({{< relref "/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})
- [1254.Number-of-Closed-Islands]({{< relref "/ChapterFour/1254.Number-of-Closed-Islands.md" >}})
- [1260.Shift-2D-Grid]({{< relref "/ChapterFour/1260.Shift-2D-Grid.md" >}})
- [1266.Minimum-Time-Visiting-All-Points]({{< relref "/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md" >}})
- [1275.Find-Winner-on-a-Tic-Tac-Toe-Game]({{< relref "/ChapterFour/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})
- [1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer]({{< relref "/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md" >}})
- [1283.Find-the-Smallest-Divisor-Given-a-Threshold]({{< relref "/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})
- [1287.Element-Appearing-More-Than-25%-In-Sorted-Array]({{< relref "/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})
- [1287.Element-Appearing-More-Than-25-In-Sorted-Array]({{< relref "/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})
- [1290.Convert-Binary-Number-in-a-Linked-List-to-Integer]({{< relref "/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})
- [1295.Find-Numbers-with-Even-Number-of-Digits]({{< relref "/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})
- [1299.Replace-Elements-with-Greatest-Element-on-Right-Side]({{< relref "/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})
@ -505,4 +534,12 @@ headless: true
- [1304.Find-N-Unique-Integers-Sum-up-to-Zero]({{< relref "/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})
- [1305.All-Elements-in-Two-Binary-Search-Trees]({{< relref "/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})
- [1306.Jump-Game-III]({{< relref "/ChapterFour/1306.Jump-Game-III.md" >}})
- [1313.Decompress-Run-Length-Encoded-List]({{< relref "/ChapterFour/1313.Decompress-Run-Length-Encoded-List.md" >}})
- [1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers]({{< relref "/ChapterFour/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md" >}})
- [1380.Lucky-Numbers-in-a-Matrix]({{< relref "/ChapterFour/1380.Lucky-Numbers-in-a-Matrix.md" >}})
- [1385.Find-the-Distance-Value-Between-Two-Arrays]({{< relref "/ChapterFour/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})
- [1389.Create-Target-Array-in-the-Given-Order]({{< relref "/ChapterFour/1389.Create-Target-Array-in-the-Given-Order.md" >}})
- [1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence]({{< relref "/ChapterFour/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md" >}})
- [1464.Maximum-Product-of-Two-Elements-in-an-Array]({{< relref "/ChapterFour/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})
- [1470.Shuffle-the-Array]({{< relref "/ChapterFour/1470.Shuffle-the-Array.md" >}})
<br />