Skip to content

Commit 62aa303

Browse files
github-actions[bot]github-actions[bot]
committed
updating docs
1 parent cfe0fb6 commit 62aa303

8 files changed

+502
-12
lines changed

‎docs/.vitepress/Sidebar.js

+20
Original file line numberDiff line numberDiff line change
@@ -353,14 +353,30 @@ export default Sidebar = [
353353
text: "322 - Coin Change",
354354
link: "/solution/0301-0400/322 - Coin Change.md",
355355
},
356+
{
357+
text: "326 - Power Of Three",
358+
link: "/solution/0301-0400/326 - Power Of Three.md",
359+
},
356360
{
357361
text: "337 - House Robber III",
358362
link: "/solution/0301-0400/337 - House Robber III.md",
359363
},
364+
{
365+
text: "338 - Counting Bits",
366+
link: "/solution/0301-0400/338 - Counting Bits.md",
367+
},
368+
{
369+
text: "342 - Power of Four",
370+
link: "/solution/0301-0400/342 - Power of Four.md",
371+
},
360372
{
361373
text: "344 - Reverse String",
362374
link: "/solution/0301-0400/344 - Reverse String.md",
363375
},
376+
{
377+
text: "345 - Reverse Vowels of a String",
378+
link: "/solution/0301-0400/345 - Reverse Vowels of a String.md",
379+
},
364380
{
365381
text: "367 - Valid Perfect Square",
366382
link: "/solution/0301-0400/367 - Valid Perfect Square.md",
@@ -399,6 +415,10 @@ export default Sidebar = [
399415
collapsible: true,
400416
collapsed: true,
401417
items: [
418+
{
419+
text: "502 - IPO",
420+
link: "/solution/0501-0600/502 - IPO.md",
421+
},
402422
{
403423
text: "506 - Relative Ranks",
404424
link: "/solution/0501-0600/506 - Relative Ranks.md",

‎docs/SERIALWISE.md

+12-5
Original file line numberDiff line numberDiff line change
@@ -96,14 +96,19 @@
9696
| **0292** | [Nim Game][292] | Math, Brainteaser, Game Theory | ![][easy] | |
9797
| **0300** | [Longest Increasing Subsequence][300] | Array, Binary Search, DP | ![][medium] | |
9898
| **0322** | [Coin Change][322] | Array, Dynamic Programming, BFS | ![][medium] | |
99+
| **0326** | [Power of Three][326] | Math, Recursion | ![][easy] | |
99100
| **0337** | [House Robber III][337] | Dynamic Programming, Tree, Depth First Search, Binary Tree | ![][medium] | |
101+
| **0338** | [Counting Bits][338] | Dynamic Programming, Bit Manip | ![][easy] | |
102+
| **0342** | [Power of Four][342] | Math, Bit Manipulation, Recursion | ![][easy] | |
100103
| **0344** | [Reverse String][344] | Two Pointers, String, Recursion | ![][easy] | |
104+
| **0345** | [Reverse Vowels of a String][345] | Two Pointers, String | ![][easy] | |
101105
| **0367** | [Valid Perfect Square][367] | Math, Binary Search | ![][easy] | |
102106
| **0369** | [Plus One Linked List][369] | Linked List, Math | ![][medium] | 🔒 |
103107
| **0389** | [Find the Difference][389] | Hash Table, String, Bit Manipulation, Sorting | ![][easy] | |
104108
| **0438** | [Find All Anagrams in a String][438] | Hash Table, String, Sliding Window | ![][medium] | |
105109
| **0442** | [Find All Duplicates][442] | Array, Hash Table | ![][medium] | |
106110
| **0445** | [Add Two Numbers II][445] | Linked List, Math, Stack | ![][medium] | |
111+
| **0502** | [IPO][502] | Array, Greedy, Sorting, Heap (Priority Queue) | ![][hard] | |
107112
| **0506** | [Relative Ranks][506] | Array, Sorting, Heap | ![][easy] | |
108113
| **0509** | [Fibonacci Number][509] | Math, Recursion, Dynamic Programming, Memoization | ![][easy] | |
109114
| **0516** | [Longest Palindromic Subsequence][516] | String, DP | ![][medium] | |
@@ -121,8 +126,8 @@
121126
| **0888** | [Fair Candy Swap][888] | Array, Hash Table, Binary Search, Sorting | ![][easy] | |
122127
| **0944** | [Delete Columns to Make Sorted][944] | Array, String | ![][easy] | |
123128
| **0997** | [Find the Town Judge][997] | Array, Hash Table, Graph | ![][easy] | |
129+
| **1011** | [Capacity To Ship Packages Within D Days][1011] | Array, BS | ![][medium] | |
124130
| **1047** | [Remove All Adjacent Duplicates In String][1047] | String, Stack | ![][easy] | |
125-
| **1056** | [Capacity To Ship Packages Within D Days][1056] | Array, BS | ![][medium] | |
126131
| **1092** | [Shortest Common Supersequence][1092] | String, DP | ![][hard] | |
127132
| **1143** | [Longest Common Subsequence][1143] | String, DP | ![][medium] | |
128133
| **1232** | [Check If It Is a Straight Line][1232] | Array, Math, Geometry | ![][easy] | |
@@ -153,7 +158,6 @@
153158
[26]: ./solution/0001-0100/026%20-%20Remove%20Duplicates%20from%20Sorted%20Array.md
154159
[27]: ./solution/0001-0100/027%20-%20Remove%20Element.md
155160
[35]: ./solution/0001-0100/035%20-%20Search%20Insert%20Position.md
156-
[35]: ./solution/0001-0100/035%20-%20Search%20Insert%20Position.md
157161
[37]: ./solution/0001-0100/037%20-%20Sudoku%20Solver.md
158162
[51]: ./solution/0001-0100/051%20-%20N-Queens.md
159163
[53]: ./solution/0001-0100/053%20-%20Maximum%20Subarray.md
@@ -162,8 +166,6 @@
162166
[61]: ./solution/0001-0100/061%20-%20Rotate%20List%20.md
163167
[63]: ./solution/0001-0100/063%20-%20Unique%20Paths%20II.md
164168
[66]: ./solution/0001-0100/066%20-%20Plus%20One.md
165-
[66]: ./solution/0001-0100/066%20-%20Plus%20One.md
166-
[67]: ./solution/0001-0100/067%20-%20Add%20Binary.md
167169
[67]: ./solution/0001-0100/067%20-%20Add%20Binary.md
168170
[69]: ./solution/0001-0100/069%20-%20Sqrt(x).md
169171
[70]: ./solution/0001-0100/070%20-%20Climbing%20Stairs.md
@@ -228,8 +230,12 @@
228230
[292]: ./solution/0201-0300/292%20-%20Nim%20Game.md
229231
[300]: ./solution/0201-0300/300%20-%20Longest%20Increasing%20Subsequence.md
230232
[322]: ./solution/0301-0400/322%20-%20Coin%20Change.md
233+
[326]: ./solution/0301-0400/326%20-%20Power%20Of%20Three.md
231234
[337]: ./solution/0301-0400/337%20-%20House%20Robber%20III.md
235+
[338]: ./solution/0301-0400/338%20-%20Counting%20Bits.md
236+
[342]: ./solution/0301-0400/342%20-%20Power%20of%20Four.md
232237
[344]: ./solution/0301-0400/344%20-%20Reverse%20String.md
238+
[345]: ./solution/0301-0400/345%20-%20Reverse%20Vowels%20of%20a%20String.md
233239
[367]: ./solution/0301-0400/367%20-%20Valid%20Perfect%20Square.md
234240
[369]: ./solution/0301-0400/369%20-%20Plus%20One%20Linked%20List.md
235241
[387]: ./solution/0301-0400/387%20-%20First%20Unique%20Character%20in%20a%20String.md
@@ -238,6 +244,7 @@
238244
[442]: ./solution/0401-0500/442%20-%20Find%20All%20Duplicates%20in%20an%20Array.md
239245
[445]: ./solution/0401-0500/445%20-%20Add%20Two%20Numbers%20II.md
240246
[461]: ./solution/0401-0500/461%20-%20Hamming%20Distance.md
247+
[502]: ./solution/0501-0600/502%20-%20IPO.md
241248
[506]: ./solution/0501-0600/506%20-%20%20Relative%20Ranks.md
242249
[509]: ./solution/0501-0600/509%20-%20Fibonacci%20Number.md
243250
[516]: ./solution/0501-0600/516%20-%20Longest%20Palindromic%20Subsequence.md
@@ -256,8 +263,8 @@
256263
[944]: ./solution/0901-1000/944%20-%20Delete%20Columns%20to%20Make%20Sorted.md
257264
[997]: ./solution/0901-1000/997%20-%20Find%20the%20Town%20Judge.md
258265
[997]: ./solution/0901-1000/997%20-%20Find%20the%20Town%20Judge.md
266+
[1011]: ./solution/1001-1100/1011%20-%20Capacity%20To%20Ship%20Packages%20Within%20D%20Days.md
259267
[1047]: ./solution/1001-1100/1047%20-%20Remove%20All%20Adjacent%20Duplicates%20In%20String.md
260-
[1056]: ./solution/1001-1100/1011%20-%20Capacity%20To%20Ship%20Packages%20Within%20D%20Days.md
261268
[1092]: ./solution/1001-1100/1092%20-%20Shortest%20Common%20Supersequence.md
262269
[1143]: ./solution/1101-1200/1143%20-%20Longest%20Common%20Subsequence.md
263270
[1232]: ./solution/1201-1300/1232%20-%20Check%20If%20It%20Is%20a%20Straight%20Line.md

0 commit comments

Comments
 (0)