Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 023750a

Browse files
updating docs
1 parent a38a683 commit 023750a

15 files changed

+979
-31
lines changed

‎docs/.vitepress/Sidebar.js

Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -440,10 +440,18 @@ export default Sidebar = [
440440
text: "414 - Third Maximum Number",
441441
link: "/solution/0401-0500/414 - Third Maximum Number.md",
442442
},
443+
{
444+
text: "434 - Number of Segments in a String",
445+
link: "/solution/0401-0500/434 - Number of Segments in a String.md",
446+
},
443447
{
444448
text: "438 - Find All Anagrams in a String",
445449
link: "/solution/0401-0500/438 - Find All Anagrams in a String.md",
446450
},
451+
{
452+
text: "441 - Arranging Coins",
453+
link: "/solution/0401-0500/441 - Arranging Coins.md",
454+
},
447455
{
448456
text: "442 - Find All Duplicates in an Array",
449457
link: "/solution/0401-0500/442 - Find All Duplicates in an Array.md",
@@ -452,6 +460,30 @@ export default Sidebar = [
452460
text: "445 - Add Two Numbers II",
453461
link: "/solution/0401-0500/445 - Add Two Numbers II.md",
454462
},
463+
{
464+
text: "448 - Find All Numbers Disappeared in an Array",
465+
link: "/solution/0401-0500/448 - Find All Numbers Disappeared in an Array.md",
466+
},
467+
{
468+
text: "461 - Hamming Distance",
469+
link: "/solution/0401-0500/461 - Hamming Distance.md",
470+
},
471+
{
472+
text: "476 - Number Complement",
473+
link: "/solution/0401-0500/476 - Number Complement.md",
474+
},
475+
{
476+
text: "482 - License Key Formatting",
477+
link: "/solution/0401-0500/482 - License Key Formatting.md",
478+
},
479+
{
480+
text: "485 - Max Consecutive Ones",
481+
link: "/solution/0401-0500/485 - Max Consecutive Ones.md",
482+
},
483+
{
484+
text: "492 - Construct the Rectangle",
485+
link: "/solution/0401-0500/492 - Construct the Rectangle.md",
486+
},
455487
],
456488
},
457489
{
@@ -463,10 +495,18 @@ export default Sidebar = [
463495
text: "502 - IPO",
464496
link: "/solution/0501-0600/502 - IPO.md",
465497
},
498+
{
499+
text: "504 - Base 7",
500+
link: "/solution/0501-0600/504 - Base 7.md",
501+
},
466502
{
467503
text: "506 - Relative Ranks",
468504
link: "/solution/0501-0600/506 - Relative Ranks.md",
469505
},
506+
{
507+
text: "507 - Perfect Number",
508+
link: "/solution/0501-0600/507 - Perfect Number.md",
509+
},
470510
{
471511
text: "509 - Fibonacci Number",
472512
link: "/solution/0501-0600/509 - Fibonacci Number.md",
@@ -502,6 +542,10 @@ export default Sidebar = [
502542
collapsible: true,
503543
collapsed: true,
504544
items: [
545+
{
546+
text: "652 - Find Duplicate Subtrees",
547+
link: "/solution/0601-0700/652 - Find Duplicate Subtrees.md",
548+
},
505549
{
506550
text: "653 - Two Sum IV - Input is a BST",
507551
link: "/solution/0601-0700/653 - Two Sum IV - Input is a BST.md",

‎docs/SERIALWISE.md

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -116,18 +116,29 @@
116116
| **0404** | [Sum of Left Leaves][404] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | ![][easy] | |
117117
| **0412** | [Fizz Buzz][412] | Math, String, Simulation | ![][easy] | |
118118
| **0414** | [Third Maximum Number][414] | Array, Sorting | ![][easy] | |
119+
| **0434** | [Number of Segments in a String][434] | String | ![][easy] | |
119120
| **0438** | [Find All Anagrams in a String][438] | Hash Table, String, Sliding Window | ![][medium] | |
121+
| **0441** | [Arranging Coins][441] | Math, BS | ![][easy] | |
120122
| **0442** | [Find All Duplicates][442] | Array, Hash Table | ![][medium] | |
121123
| **0445** | [Add Two Numbers II][445] | Linked List, Math, Stack | ![][medium] | |
124+
| **0448** | [Find All Numbers Disappeared in an Array][448] | Array, Hash Table | ![][easy] | |
125+
| **0461** | [Hamming Distance][461] | Bit Manip | ![][easy] | |
126+
| **0476** | [Number Complement][476] | Bit Manip | ![][easy] | |
127+
| **0482** | [License Key Formatting][482] | String | ![][easy] | |
128+
| **0485** | [Max Consecutive Ones][485] | Array | ![][easy] | |
129+
| **0492** | [Construct the Rectangle][492] | Math | ![][easy] | |
122130
| **0502** | [IPO][502] | Array, Greedy, Sorting, Heap (Priority Queue) | ![][hard] | |
131+
| **0504** | [Base 7][504] | Math | ![][easy] | |
123132
| **0506** | [Relative Ranks][506] | Array, Sorting, Heap | ![][easy] | |
133+
| **0507** | [Perfect Number][507] | Math | ![][easy] | |
124134
| **0509** | [Fibonacci Number][509] | Math, Recursion, Dynamic Programming, Memoization | ![][easy] | |
125135
| **0516** | [Longest Palindromic Subsequence][516] | String, DP | ![][medium] | |
126136
| **0518** | [Coin Change 2][518] | Array, DP | ![][medium] | |
127137
| **0530** | [Minimum Absolute Difference in BST][530] | Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree | ![][easy] | |
128138
| **0540** | [Single Element in a Sorted Array][540] | Array, BS | ![][medium] | |
129139
| **0541** | [Reverse String II][541] | Two Pointers, String | ![][easy] | |
130140
| **0543** | [Diameter of Binary Tree][543] | Tree, Depth First Search, Binary Tree | ![][easy] | |
141+
| **0652** | [Find Duplicate Subtrees][652] | Hash Table, Tree, Depth-First Search, Binary Tree | ![][medium] | |
131142
| **0653** | [Two Sum IV - Input is a BST][653] | Tree, Depth First Search, Binary Search Tree, Binary Tree | ![][easy] | |
132143
| **0704** | [Binary Search][704] | Array, Binary Search | ![][easy] | |
133144
| **0739** | [Daily Temperatures][739] | Array, Stack, Monotonic Stack | ![][medium] | |
@@ -152,6 +163,7 @@
152163
| **1957** | [Delete Characters to Make Fancy String][1957] | String | ![][easy] | |
153164
| **2176** | [Count Equal and Divisible Pairs in an Array][2176] | Array | ![][easy] | |
154165
| **2236** | [Root Equal to Sum of Children][2236] | Tree, Binary Tree | ![][easy] | |
166+
| **2427** | [Number of Common Factors][2427] | Math, Enumeration, Number Theory | ![][easy] | |
155167

156168
</div>
157169
<!---------------------------------{ Path Reference }-------------------------->
@@ -263,19 +275,30 @@
263275
[404]: ./solution/0401-0500/404%20-%20Sum%20of%20Left%20Leaves.md
264276
[412]: ./solution/0401-0500/412%20-%20Fizz%20Buzz.md
265277
[414]: ./solution/0401-0500/414%20-%20Third%20Maximum%20Number.md
278+
[434]: ./solution/0401-0500/434%20-%20Number%20of%20Segments%20in%20a%20String.md
266279
[438]: ./solution/0401-0500/438%20-%20Find%20All%20Anagrams%20in%20a%20String.md
280+
[441]: ./solution/0401-0500/441%20-%20Arranging%20Coins.md
267281
[442]: ./solution/0401-0500/442%20-%20Find%20All%20Duplicates%20in%20an%20Array.md
268282
[445]: ./solution/0401-0500/445%20-%20Add%20Two%20Numbers%20II.md
283+
[448]: ./solution/0401-0500/448%20-%20Find%20All%20Numbers%20Disappeared%20in%20an%20Array.md
269284
[461]: ./solution/0401-0500/461%20-%20Hamming%20Distance.md
285+
[461]: ./solution/0401-0500/461%20-%20Hamming%20Distance.md
286+
[476]: ./solution/0401-0500/476%20-%20Number%20Complement.md
287+
[482]: ./solution/0401-0500/482%20-%20License%20Key%20Formatting.md
288+
[485]: ./solution/0401-0500/485%20-%20Max%20Consecutive%20Ones.md
289+
[492]: ./solution/0401-0500/492%20-%20Construct%20the%20Rectangle.md
270290
[502]: ./solution/0501-0600/502%20-%20IPO.md
291+
[504]: ./solution/0501-0600/504%20-%20Base%207.md
271292
[506]: ./solution/0501-0600/506%20-%20%20Relative%20Ranks.md
293+
[507]: ./solution/0501-0600/507%20-%20Perfect%20Number.md
272294
[509]: ./solution/0501-0600/509%20-%20Fibonacci%20Number.md
273295
[516]: ./solution/0501-0600/516%20-%20Longest%20Palindromic%20Subsequence.md
274296
[518]: ./solution/0501-0600/518%20-%20Coin%20Change%202.md
275297
[530]: ./solution/0501-0600/530%20-%20Minimum%20Absolute%20Difference%20in%20BST.md
276298
[540]: ./solution/0501-0600/540%20-%20Single%20Element%20in%20a%20Sorted%20Array.md
277299
[541]: ./solution/0501-0600/541%20-%20Reverse%20String%20II.md
278300
[543]: ./solution/0501-0600/543%20-%20Diameter%20of%20Binary%20Tree.md
301+
[652]: ./solution/0601-0700/652%20-%20Find%20Duplicate%20Subtrees.md
279302
[653]: ./solution/0601-0700/653%20-%20Two%20Sum%20IV%20-%20Input%20is%20a%20BST.md
280303
[704]: ./solution/0701-0800/704%20-%20Binary%20Search.md
281304
[739]: ./solution/0701-0800/739%20-%20Daily%20Temperatures.md
@@ -301,6 +324,7 @@
301324
[1957]: ./solution/1901-2000/1957%20-%20Delete%20Characters%20to%20Make%20Fancy%20String.md
302325
[2176]: ./solution/2101-2200/2176%20-%20Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array.md
303326
[2236]: ./solution/2201-2300/2236%20-%20Root%20Equals%20Sum%20of%20Children.md
327+
[2427]: ./solution/2401-2500/2427%20-%20Number%20of%20Common%20Factors.md
304328

305329
<!----------------------------------{ Labels }--------------------------------->
306330

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /