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 78eb3e0

Browse files
updating docs
1 parent d647de7 commit 78eb3e0

File tree

5 files changed

+208
-28
lines changed

5 files changed

+208
-28
lines changed

‎docs/.vitepress/Sidebar.js

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -377,6 +377,10 @@ export default Sidebar = [
377377
text: "345 - Reverse Vowels of a String",
378378
link: "/solution/0301-0400/345 - Reverse Vowels of a String.md",
379379
},
380+
{
381+
text: "349 - Intersection of Two Arrays",
382+
link: "/solution/0301-0400/349 - Intersection of Two Arrays.md",
383+
},
380384
{
381385
text: "367 - Valid Perfect Square",
382386
link: "/solution/0301-0400/367 - Valid Perfect Square.md",
@@ -385,6 +389,10 @@ export default Sidebar = [
385389
text: "369 - Plus One Linked List",
386390
link: "/solution/0301-0400/369 - Plus One Linked List.md",
387391
},
392+
{
393+
text: "387 - First Unique Character in a String",
394+
link: "/solution/0301-0400/387 - First Unique Character in a String.md",
395+
},
388396
{
389397
text: "389 - Find the Difference",
390398
link: "/solution/0301-0400/389 - Find the Difference.md",

‎docs/SERIALWISE.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -102,8 +102,10 @@
102102
| **0342** | [Power of Four][342] | Math, Bit Manipulation, Recursion | ![][easy] | |
103103
| **0344** | [Reverse String][344] | Two Pointers, String, Recursion | ![][easy] | |
104104
| **0345** | [Reverse Vowels of a String][345] | Two Pointers, String | ![][easy] | |
105+
| **0349** | [Intersection of Two Arrays][349] | Array, Hash Table, Two Pointers, Binary Search, Sorting | ![][easy] | |
105106
| **0367** | [Valid Perfect Square][367] | Math, Binary Search | ![][easy] | |
106107
| **0369** | [Plus One Linked List][369] | Linked List, Math | ![][medium] | 🔒 |
108+
| **0387** | [First Unique Character in a String][387] | Hash Table, String, Queue, Counting | ![][easy] | |
107109
| **0389** | [Find the Difference][389] | Hash Table, String, Bit Manipulation, Sorting | ![][easy] | |
108110
| **0438** | [Find All Anagrams in a String][438] | Hash Table, String, Sliding Window | ![][medium] | |
109111
| **0442** | [Find All Duplicates][442] | Array, Hash Table | ![][medium] | |
@@ -236,9 +238,11 @@
236238
[342]: ./solution/0301-0400/342%20-%20Power%20of%20Four.md
237239
[344]: ./solution/0301-0400/344%20-%20Reverse%20String.md
238240
[345]: ./solution/0301-0400/345%20-%20Reverse%20Vowels%20of%20a%20String.md
241+
[349]: ./solution/0301-0400/349%20-%20Intersection%20of%20Two%20Arrays.md
239242
[367]: ./solution/0301-0400/367%20-%20Valid%20Perfect%20Square.md
240243
[369]: ./solution/0301-0400/369%20-%20Plus%20One%20Linked%20List.md
241244
[387]: ./solution/0301-0400/387%20-%20First%20Unique%20Character%20in%20a%20String.md
245+
[387]: ./solution/0301-0400/387%20-%20First%20Unique%20Character%20in%20a%20String.md
242246
[389]: ./solution/0301-0400/389%20-%20Find%20the%20Difference.md
243247
[438]: ./solution/0401-0500/438%20-%20Find%20All%20Anagrams%20in%20a%20String.md
244248
[442]: ./solution/0401-0500/442%20-%20Find%20All%20Duplicates%20in%20an%20Array.md

‎docs/TOPICWISE.md

Lines changed: 39 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -46,6 +46,7 @@
4646
| **0283** | [Move Zeroes][283] | Array, Two Pointers | ![][easy] | |
4747
| **0300** | [Longest Increasing Subsequence][300] | Array, Binary Search, DP | ![][medium] | |
4848
| **0322** | [Coin Change][322] | Array, Dynamic Programming, BFS | ![][medium] | |
49+
| **0349** | [Intersection of Two Arrays][349] | Array, Hash Table, Two Pointers, Binary Search, Sorting | ![][easy] | |
4950
| **0442** | [Find All Duplicates][442] | Array, Hash Table | ![][medium] | |
5051
| **0502** | [IPO][502] | Array, Greedy, Sorting, Heap (Priority Queue) | ![][hard] | |
5152
| **0506** | [Relative Ranks][506] | Array, Sorting, Heap | ![][easy] | |
@@ -84,6 +85,7 @@
8485
| **0290** | [Word Pattern][290] | Hash Table, String | ![][easy] | |
8586
| **0344** | [Reverse String][344] | Two Pointers, String, Recursion | ![][easy] | |
8687
| **0345** | [Reverse Vowels of a String][345] | Two Pointers, String | ![][easy] | |
88+
| **0387** | [First Unique Character in a String][387] | Hash Table, String, Queue, Counting | ![][easy] | |
8789
| **0389** | [Find the Difference][389] | Hash Table, String, Bit Manipulation, Sorting | ![][easy] | |
8890
| **0438** | [Find All Anagrams in a String][438] | Hash Table, String, Sliding Window | ![][medium] | |
8991
| **0516** | [Longest Palindromic Subsequence][516] | String, DP | ![][medium] | |
@@ -100,27 +102,29 @@
100102

101103
## Hash Table
102104

103-
| # | Solution | Tags | Difficulty | Remark |
104-
| :------: | :-------------------------------------: | :---------------------------------------------------------------: | :---------: | :----: |
105-
| **0001** | [Two Sum][1] | Array, Hash Table | ![][easy] | |
106-
| **0013** | [Roman to Integer][13] | String, Math, Hash Table | ![][easy] | |
107-
| **0141** | [Linked List Cycle][141] | Hash Table, Linked List, 2P | ![][easy] | |
108-
| **0160** | [Intersection of Two Linked Lists][160] | Hash Table, Linked List, 2P | ![][easy] | |
109-
| **0169** | [Majority Element][169] | Array, Hash Table, Divide and Conquer, Sorting, Counting | ![][easy] | |
110-
| **0202** | [Happy Number][202] | Hash Table, Math, 2P | ![][easy] | |
111-
| **0205** | [Isomorphic Strings][205] | Hash Table, String | ![][easy] | |
112-
| **0217** | [Contains Duplicate][217] | Array, Hash Table, Sorting | ![][easy] | |
113-
| **0219** | [Contains Duplicate II][219] | Array, Hash Table, Sliding Window | ![][easy] | |
114-
| **0242** | [Valid Anagram][242] | Hash Table, String, Sorting | ![][easy] | |
115-
| **0268** | [Missing Number][268] | Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting | ![][easy] | |
116-
| **0290** | [Word Pattern][290] | Hash Table, String | ![][easy] | |
117-
| **0389** | [Find the Difference][389] | Hash Table, String, Bit Manipulation, Sorting | ![][easy] | |
118-
| **0438** | [Find All Anagrams in a String][438] | Hash Table, String, Sliding Window | ![][medium] | |
119-
| **0442** | [Find All Duplicates][442] | Array, Hash Table | ![][medium] | |
120-
| **0653** | [Two Sum IV - Input is a BST ][653] | Tree, Depth First Search, Binary Search Tree, Binary Tree | ![][easy] | |
121-
| **0888** | [Fair Candy Swap][888] | Array, Hash Table, Binary Search, Sorting | ![][easy] | |
122-
| **0771** | [Jewels and Stones][771] | String, Hashtable | ![][easy] | |
123-
| **0997** | [Find the Town Judge][997] | Array, Hash Table, Graph | ![][easy] | |
105+
| # | Solution | Tags | Difficulty | Remark |
106+
| :------: | :---------------------------------------: | :---------------------------------------------------------------: | :---------: | :----: |
107+
| **0001** | [Two Sum][1] | Array, Hash Table | ![][easy] | |
108+
| **0013** | [Roman to Integer][13] | String, Math, Hash Table | ![][easy] | |
109+
| **0141** | [Linked List Cycle][141] | Hash Table, Linked List, 2P | ![][easy] | |
110+
| **0160** | [Intersection of Two Linked Lists][160] | Hash Table, Linked List, 2P | ![][easy] | |
111+
| **0169** | [Majority Element][169] | Array, Hash Table, Divide and Conquer, Sorting, Counting | ![][easy] | |
112+
| **0202** | [Happy Number][202] | Hash Table, Math, 2P | ![][easy] | |
113+
| **0205** | [Isomorphic Strings][205] | Hash Table, String | ![][easy] | |
114+
| **0217** | [Contains Duplicate][217] | Array, Hash Table, Sorting | ![][easy] | |
115+
| **0219** | [Contains Duplicate II][219] | Array, Hash Table, Sliding Window | ![][easy] | |
116+
| **0242** | [Valid Anagram][242] | Hash Table, String, Sorting | ![][easy] | |
117+
| **0268** | [Missing Number][268] | Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting | ![][easy] | |
118+
| **0290** | [Word Pattern][290] | Hash Table, String | ![][easy] | |
119+
| **0349** | [Intersection of Two Arrays][349] | Array, Hash Table, Two Pointers, Binary Search, Sorting | ![][easy] | |
120+
| **0387** | [First Unique Character in a String][387] | Hash Table, String, Queue, Counting | ![][easy] | |
121+
| **0389** | [Find the Difference][389] | Hash Table, String, Bit Manipulation, Sorting | ![][easy] | |
122+
| **0438** | [Find All Anagrams in a String][438] | Hash Table, String, Sliding Window | ![][medium] | |
123+
| **0442** | [Find All Duplicates][442] | Array, Hash Table | ![][medium] | |
124+
| **0653** | [Two Sum IV - Input is a BST ][653] | Tree, Depth First Search, Binary Search Tree, Binary Tree | ![][easy] | |
125+
| **0888** | [Fair Candy Swap][888] | Array, Hash Table, Binary Search, Sorting | ![][easy] | |
126+
| **0771** | [Jewels and Stones][771] | String, Hashtable | ![][easy] | |
127+
| **0997** | [Find the Town Judge][997] | Array, Hash Table, Graph | ![][easy] | |
124128

125129
<!---------------------------------{ Solution Table }-------------------------->
126130

@@ -189,6 +193,7 @@
189193
| **0217** | [Contains Duplicate][217] | Array, Hash Table, Sorting | ![][easy] | |
190194
| **0242** | [Valid Anagram][242] | Hash Table, String, Sorting | ![][easy] | |
191195
| **0268** | [Missing Number][268] | Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting | ![][easy] | |
196+
| **0349** | [Intersection of Two Arrays][349] | Array, Hash Table, Two Pointers, Binary Search, Sorting | ![][easy] | |
192197
| **0389** | [Find the Difference][389] | Hash Table, String, Bit Manipulation, Sorting | ![][easy] | |
193198
| **0502** | [IPO][502] | Array, Greedy, Sorting, Heap (Priority Queue) | ![][hard] | |
194199
| **0506** | [Relative Ranks][506] | Array, Sorting, Heap | ![][easy] | |
@@ -294,6 +299,7 @@
294299
| **0268** | [Missing Number][268] | Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting | ![][easy] | |
295300
| **0278** | [First Bad Version][278] | Binary Search, Interactive | ![][easy] | |
296301
| **0300** | [Longest Increasing Subsequence][300] | Array, Binary Search, DP | ![][medium] | |
302+
| **0349** | [Intersection of Two Arrays][349] | Array, Hash Table, Two Pointers, Binary Search, Sorting | ![][easy] | |
297303
| **0367** | [Valid Perfect Square][367] | Math, Binary Search | ![][easy] | |
298304
| **0540** | [Single Element in a Sorted Array][540] | Array, BS | ![][medium] | |
299305
| **0704** | [Binary Search][704] | Array, Binary Search | ![][easy] | |
@@ -360,6 +366,7 @@
360366
| **0283** | [Move Zeroes][283] | Array, Two Pointers | ![][easy] | |
361367
| **0344** | [Reverse String][344] | Two Pointers, String, Recursion | ![][easy] | |
362368
| **0345** | [Reverse Vowels of a String][345] | Two Pointers, String | ![][easy] | |
369+
| **0349** | [Intersection of Two Arrays][349] | Array, Hash Table, Two Pointers, Binary Search, Sorting | ![][easy] | |
363370
| **0541** | [Reverse String II][541] | Two Pointers, String | ![][easy] | |
364371
| **0653** | [Two Sum IV - Input is a BST ][653] | Tree, Depth First Search, Binary Search Tree, Binary Tree | ![][easy] | |
365372
| **0876** | [Middle of the Linked List][876] | Linked List, Two Pointers | ![][easy] | |
@@ -458,9 +465,10 @@
458465

459466
## Counting
460467

461-
| # | Solution | Tags | Difficulty | Remark |
462-
| :------: | :---------------------: | :------------------------------------------------------: | :--------: | :----: |
463-
| **0169** | [Majority Element][169] | Array, Hash Table, Divide and Conquer, Sorting, Counting | ![][easy] | |
468+
| # | Solution | Tags | Difficulty | Remark |
469+
| :------: | :---------------------------------------: | :------------------------------------------------------: | :--------: | :----: |
470+
| **0169** | [Majority Element][169] | Array, Hash Table, Divide and Conquer, Sorting, Counting | ![][easy] | |
471+
| **0387** | [First Unique Character in a String][387] | Hash Table, String, Queue, Counting | ![][easy] | |
464472

465473
<!---------------------------------{ Solution Table }-------------------------->
466474

@@ -580,10 +588,11 @@
580588

581589
## Queue
582590

583-
| # | Solution | Tags | Difficulty | Remark |
584-
| :------: | :---------------------------------: | :--------------: | :--------: | :----: |
585-
| **0225** | [Implement Stack using Queues][225] | Stack, Design, Q | ![][easy] | |
586-
| **0232** | [Implement Queue using Stacks][232] | Stack, Design, Q | ![][easy] | |
591+
| # | Solution | Tags | Difficulty | Remark |
592+
| :------: | :---------------------------------------: | :---------------------------------: | :--------: | :----: |
593+
| **0225** | [Implement Stack using Queues][225] | Stack, Design, Q | ![][easy] | |
594+
| **0232** | [Implement Queue using Stacks][232] | Stack, Design, Q | ![][easy] | |
595+
| **0387** | [First Unique Character in a String][387] | Hash Table, String, Queue, Counting | ![][easy] | |
587596

588597
<!---------------------------------{ Solution Table }-------------------------->
589598

@@ -937,9 +946,11 @@
937946
[342]: ./solution/0301-0400/342%20-%20Power%20of%20Four.md
938947
[344]: ./solution/0301-0400/344%20-%20Reverse%20String.md
939948
[345]: ./solution/0301-0400/345%20-%20Reverse%20Vowels%20of%20a%20String.md
949+
[349]: ./solution/0301-0400/349%20-%20Intersection%20of%20Two%20Arrays.md
940950
[367]: ./solution/0301-0400/367%20-%20Valid%20Perfect%20Square.md
941951
[369]: ./solution/0301-0400/369%20-%20Plus%20One%20Linked%20List.md
942952
[387]: ./solution/0301-0400/387%20-%20First%20Unique%20Character%20in%20a%20String.md
953+
[387]: ./solution/0301-0400/387%20-%20First%20Unique%20Character%20in%20a%20String.md
943954
[389]: ./solution/0301-0400/389%20-%20Find%20the%20Difference.md
944955
[438]: ./solution/0401-0500/438%20-%20Find%20All%20Anagrams%20in%20a%20String.md
945956
[442]: ./solution/0401-0500/442%20-%20Find%20All%20Duplicates%20in%20an%20Array.md

0 commit comments

Comments
(0)

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