Skip to content

Commit 6350c74

Browse files
github-actions[bot]github-actions[bot]
committed
updating docs
1 parent ccf428e commit 6350c74

15 files changed

+1110
-78
lines changed

‎docs/.vitepress/Sidebar.js

Lines changed: 58 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -56,6 +56,10 @@ export default Sidebar = [
5656
text: "027 - Remove Element",
5757
link: "/solution/0001-0100/027 - Remove Element.md",
5858
},
59+
{
60+
text: "028 - Find the Index of the First Occurrence in a String",
61+
link: "/solution/0001-0100/028 - Find the Index of the First Occurrence in a String.md",
62+
},
5963
{
6064
text: "035 - Search Insert Position",
6165
link: "/solution/0001-0100/035 - Search Insert Position.md",
@@ -690,6 +694,10 @@ export default Sidebar = [
690694
collapsible: true,
691695
collapsed: true,
692696
items: [
697+
{
698+
text: "1512 - Number of Good Pairs",
699+
link: "/solution/1501-1600/1512 - Number of Good Pairs.md",
700+
},
693701
{
694702
text: "1523. Count Odd Numbers in an Interval Range",
695703
link: "/solution/1501-1600/1523. Count Odd Numbers in an Interval Range.md",
@@ -700,6 +708,21 @@ export default Sidebar = [
700708
},
701709
],
702710
},
711+
{
712+
text: "1601-1700",
713+
collapsible: true,
714+
collapsed: true,
715+
items: [
716+
{
717+
text: "1672 - Richest Customer Wealth",
718+
link: "/solution/1601-1700/1672 - Richest Customer Wealth.md",
719+
},
720+
{
721+
text: "1689 - Partitioning Into Minimum Number Of Deci-Binary Numbers",
722+
link: "/solution/1601-1700/1689 - Partitioning Into Minimum Number Of Deci-Binary Numbers.md",
723+
},
724+
],
725+
},
703726
{
704727
text: "1901-2000",
705728
collapsible: true,
@@ -724,23 +747,50 @@ export default Sidebar = [
724747
collapsible: true,
725748
collapsed: true,
726749
items: [
750+
{
751+
text: "2011 - Final Value of Variable After Performing Operations",
752+
link: "/solution/2101-2200/2011 - Final Value of Variable After Performing Operations.md",
753+
},
754+
{
755+
text: "2114 - Maximum Number of Words Found in Sentences",
756+
link: "/solution/2101-2200/2114 - Maximum Number of Words Found in Sentences.md",
757+
},
727758
{
728759
text: "2176 - Count Equal and Divisible Pairs in an Array",
729760
link: "/solution/2101-2200/2176 - Count Equal and Divisible Pairs in an Array.md",
730761
},
762+
{
763+
text: "2413 - Smallest Even Multiple",
764+
link: "/solution/2101-2200/2413 - Smallest Even Multiple.md",
765+
},
731766
],
732767
},
733768
{
734769
text: "2201-2300",
735770
collapsible: true,
736771
collapsed: true,
737772
items: [
773+
{
774+
text: "2235 - Add Two Integers",
775+
link: "/solution/2201-2300/2235 - Add Two Integers.md",
776+
},
738777
{
739778
text: "2236 - Root Equals Sum of Children",
740779
link: "/solution/2201-2300/2236 - Root Equals Sum of Children.md",
741780
},
742781
],
743782
},
783+
{
784+
text: "2301-2400",
785+
collapsible: true,
786+
collapsed: true,
787+
items: [
788+
{
789+
text: "2396 - Strictly Palindromic Number",
790+
link: "/solution/2301-2400/2396 - Strictly Palindromic Number.md",
791+
},
792+
],
793+
},
744794
{
745795
text: "2401-2500",
746796
collapsible: true,
@@ -750,10 +800,18 @@ export default Sidebar = [
750800
text: "2427 - Number of Common Factors",
751801
link: "/solution/2401-2500/2427 - Number of Common Factors.md",
752802
},
803+
{
804+
text: "2444 - Count Subarrays With Fixed Bounds",
805+
link: "/solution/2401-2500/2444 - Count Subarrays With Fixed Bounds.md",
806+
},
753807
{
754808
text: "2469 - Convert the Temperature",
755809
link: "/solution/2401-2500/2469 - Convert the Temperature.md",
756810
},
811+
{
812+
text: "2574 - Left and Right Sum Differences",
813+
link: "/solution/2401-2500/2574 - Left and Right Sum Differences.md",
814+
},
757815
],
758816
},
759817
];

‎docs/SERIALWISE.md

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -27,6 +27,7 @@
2727
| **0024** | [Swap Nodes in Pairs][24] | Linked List, Recursion | ![][medium] | |
2828
| **0026** | [Remove Duplicates][26] | Array, Two Pointers | ![][easy] | |
2929
| **0027** | [Remove Element][27] | Array, Two Pointers | ![][easy] | |
30+
| **0028** | [Find the Index of the First Occurrence in a String][28] | Two Pointers, String, String Matching | ![][medium] | |
3031
| **0035** | [Search Insert Position][35] | Array, BS | ![][easy] | |
3132
| **0037** | [Sudoku Solver][37] | Array, Backtracking, Matrix | ![][hard] | |
3233
| **0051** | [N-Queens][51] | Array, Backtracking | ![][hard] | |
@@ -160,16 +161,26 @@
160161
| **1480** | [Running Sum of 1d Array][1480] | Array, Prefix Sum | ![][easy] | |
161162
| **1491** | [Average Salary Excluding the Minimum and Maximum][1491] | Array, Sorting | ![][easy] | |
162163
| **1498** | [Number of Subsequences That Satisfy the Given Sum Condition][1498] | Array, Two Pointer, Binary Search, Sorting | ![][medium] | |
164+
| **1512** | [Number of Good Pairs][1512] | Array, Hash Table, Math, Counting | ![][easy] | |
163165
| **1537** | [Get the Maximum Score][1537] | Array, Two Pointer, Dynamic Programming, Greedy | ![][hard] | |
164166
| **1580** | [Shuffle the Array][1580] | Array | ![][easy] | |
165167
| **1630** | [Count Odd Numbers in an Interval Range][1630] | Math | ![][easy] | |
168+
| **1672** | [Richest Customer Wealth][1672] | Array, Matrix | ![][easy] | |
169+
| **1689** | [Partitioning Into Minimum Number Of Deci-Binary Numbers][1689] | String, Greedy | ![][medium] | |
166170
| **1920** | [Build Array from Permutation][1920] | Array, Simulation | ![][easy] | |
167171
| **1929** | [Concatenation of Array][1929] | Array | ![][easy] | |
168172
| **1957** | [Delete Characters to Make Fancy String][1957] | String | ![][easy] | |
173+
| **2011** | [Final Value of Variable After Performing Operations][2011] | Array, String, Simulation | ![][easy] | |
174+
| **2114** | [Maximum Number of Words Found in Sentences][2114] | Array, String | ![][easy] | |
169175
| **2176** | [Count Equal and Divisible Pairs in an Array][2176] | Array | ![][easy] | |
176+
| **2235** | [Add Two Integers][2235] | Math | ![][easy] | |
170177
| **2236** | [Root Equal to Sum of Children][2236] | Tree, Binary Tree | ![][easy] | |
178+
| **2396** | [Strictly Palindromic Number][2396] | Math, Two Pointers, Brainteaser | ![][medium] | |
179+
| **2413** | [Smallest Even Multiple][2413] | Math, Number Theory | ![][easy] | |
171180
| **2427** | [Number of Common Factors][2427] | Math, Enumeration, Number Theory | ![][easy] | |
181+
| **2444** | [Count Subarrays With Fixed Bounds][2444] | Array, Queue, Sliding Window, Monotonic Queue | ![][hard] | |
172182
| **2469** | [Convert the Temperature][2469] | Math | ![][easy] | |
183+
| **2574** | [Left and Right Sum Differences][2574] | Array, Prefix Sum | ![][easy] | |
173184

174185
</div>
175186
<!---------------------------------{ Path Reference }-------------------------->
@@ -187,6 +198,7 @@
187198
[24]: ./solution/0001-0100/024%20-%20Swap%20Nodes%20in%20Pairs.md
188199
[26]: ./solution/0001-0100/026%20-%20Remove%20Duplicates%20from%20Sorted%20Array.md
189200
[27]: ./solution/0001-0100/027%20-%20Remove%20Element.md
201+
[28]: ./solution/0001-0100/028%20-%20Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String.md
190202
[35]: ./solution/0001-0100/035%20-%20Search%20Insert%20Position.md
191203
[37]: ./solution/0001-0100/037%20-%20Sudoku%20Solver.md
192204
[51]: ./solution/0001-0100/051%20-%20N-Queens.md
@@ -327,16 +339,26 @@
327339
[1480]: ./solution/1401-1500/1480%20-%20Running%20Sum%20of%201d%20Array.md
328340
[1491]: ./solution/1401-1500/1491%20-%20Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary.md
329341
[1498]: ./solution/1401-1500/1498%20-%20Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition.md
342+
[1512]: ./solution/1501-1600/1512%20-%20Number%20of%20Good%20Pairs.md
330343
[1537]: ./solution/1501-1600/1537%20-%20Get%20the%20Maximum%20Score.md
331344
[1580]: ./solution/1401-1500/1470%20-%20Shuffle%20the%20Array.md
332345
[1630]: ./solution/1501-1600/1523.%20Count%20Odd%20Numbers%20in%20an%20Interval%20Range.md
346+
[1672]: ./solution/1601-1700/1672%20-%20Richest%20Customer%20Wealth.md
347+
[1689]: ./solution/1601-1700/1689%20-%20Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers.md
333348
[1920]: ./solution/1901-2000/1920%20-%20Build%20Array%20from%20Permutation.md
334349
[1929]: ./solution/1901-2000/1929%20-%20Concatenation%20of%20Array.md
335350
[1957]: ./solution/1901-2000/1957%20-%20Delete%20Characters%20to%20Make%20Fancy%20String.md
351+
[2011]: ./solution/2101-2200/2011%20-%20Final%20Value%20of%20Variable%20After%20Performing%20Operations.md
352+
[2114]: ./solution/2101-2200/2114%20-%20Maximum%20Number%20of%20Words%20Found%20in%20Sentences.md
336353
[2176]: ./solution/2101-2200/2176%20-%20Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array.md
354+
[2235]: ./solution/2201-2300/2235%20-%20Add%20Two%20Integers.md
337355
[2236]: ./solution/2201-2300/2236%20-%20Root%20Equals%20Sum%20of%20Children.md
356+
[2396]: ./solution/2301-2400/2396%20-%20Strictly%20Palindromic%20Number.md
357+
[2413]: ./solution/2101-2200/2413%20-%20Smallest%20Even%20Multiple.md
338358
[2427]: ./solution/2401-2500/2427%20-%20Number%20of%20Common%20Factors.md
359+
[2444]: ./solution/2401-2500/2444%20-%20Count%20Subarrays%20With%20Fixed%20Bounds.md
339360
[2469]: ./solution/2401-2500/2469%20-%20Convert%20the%20Temperature.md
361+
[2574]: ./solution/2401-2500/2574%20-%20Left%20and%20Right%20Sum%20Differences.md
340362

341363
<!----------------------------------{ Labels }--------------------------------->
342364

0 commit comments

Comments
 (0)