Remark and organize new linked list problems

Author: enginebai

problems/linked-list-problems.md

@@ -3,27 +3,27 @@
 ### Basic
 | Problem          | Difficulty |
 |------------------|------------|
-|[707. Design Linked List](../leetcode/707.design-linked-list.md)|Medium|
+|**[707. Design Linked List](../leetcode/707.design-linked-list.md)**|Medium|
 
 ### Traversal
 | Problem          | Difficulty |
 |------------------|------------|
-|[2181. Merge Nodes in Between Zeros](../leetcode/2181.merge-nodes-in-between-zeros.md)|Medium (1333)|
+|**[2181. Merge Nodes in Between Zeros](../leetcode/2181.merge-nodes-in-between-zeros.md)**|Medium (1333)|
 |[817. Linked List Components](../leetcode/817.linked-list-components.md)|Medium (1428)|
-|[725. Split Linked List in Parts](../leetcode/725.split-linked-list-in-parts.md)|Medium|
+|**[725. Split Linked List in Parts](../leetcode/725.split-linked-list-in-parts.md)**|Medium|
 
 > * Solved: https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/description/ 1151
 > * Solved: https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/description/ 1310
-> * https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/description/ m
+> * **https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/description/** m
 > * https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/ 1782
 
 ### Remove
 | Problem          | Difficulty |
 |------------------|------------|
-|[203. Remove Linked List Elements](../leetcode/203.remove-linked-list-elements.md)|Easy|
+|**[203. Remove Linked List Elements](../leetcode/203.remove-linked-list-elements.md)**|Easy|
 |[237. Delete Node in a Linked List](../leetcode/237.delete-node-in-a-linked-list.md)|Medium|
 |[83. Remove Duplicates from Sorted List](../leetcode/83.remove-duplicates-from-sorted-list.md)|Easy|
-|[82. Remove Duplicates from Sorted List II](../leetcode/82.remove-dpulicates-from-sorted-list-ii.md)|Medium|
+|**[82. Remove Duplicates from Sorted List II](../leetcode/82.remove-dpulicates-from-sorted-list-ii.md)**|Medium|
 |[2487. Remove Nodes From Linked List](../leetcode/2487.remove-nodes-from-linked-list.md)|Medium (1454)|
 
 > * Solved: https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/description/ 1341
@@ -32,59 +32,59 @@
 | Problem          | Difficulty |
 |------------------|------------|
 > * Solved: https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/description/ 1279
-> * https://leetcode.com/problems/insertion-sort-list/description/ m
+> * **https://leetcode.com/problems/insertion-sort-list/description/** m
 
 ### Reverse
 | Problem          | Difficulty |
 |------------------|------------|
-|[206. Reverse Linked List](../leetcode/206.reverse-linked-list.md)|Easy|
-|[92. Reverse Linked List II](../leetcode/92.reverse-linked-list-ii.md)|Medium|
-|[24. Swap Nodes in Pairs](../leetcode/24.swap-nodes-in-pairs.md)|Medium|
+|**[206. Reverse Linked List](../leetcode/206.reverse-linked-list.md)**|Easy|
+|@@**[92. Reverse Linked List II](../leetcode/92.reverse-linked-list-ii.md)**|Medium|
+|@@**[24. Swap Nodes in Pairs](../leetcode/24.swap-nodes-in-pairs.md**)|Medium|
 
-> * Solved, to note: https://leetcode.com/problems/reverse-nodes-in-k-group/description/ h
+> * Solved, to note: **https://leetcode.com/problems/reverse-nodes-in-k-group/description/** h
 
 ### Two Pointers
 | Problem          | Difficulty |
 |------------------|------------|
-|[19. Remove Nth Node From End of List](../leetcode/19.remove-nth-node-from-end-of-list.md)|Medium|
-|[143. Reorder List](../leetcode/143.reorder-list.md)|Medium|
-|[141. Linked List Cycle](../leetcode/141.linked-list-cycle.md)|Easy|
+|**[19. Remove Nth Node From End of List](../leetcode/19.remove-nth-node-from-end-of-list.md)**|Medium|
+|@@[143. Reorder List](../leetcode/143.reorder-list.md)|Medium|
+|**[141. Linked List Cycle](../leetcode/141.linked-list-cycle.md)**|Easy|
 |[142. Linked List Cycle II](../leetcode/142.linked-list-cycle-ii.md)|Medium|
-|[328. Odd Even Linked List](../leetcode/328.odd-even-linked-list.md)|Medium|
+|**[328. Odd Even Linked List](../leetcode/328.odd-even-linked-list.md)**|Medium|
 |[86. Partition List](../leetcode/86.partition-list.md)|Medium|
 |[160. Intersection of Two Linked Lists](../leetcode/160.intersection-of-two-linked-lists.md)|Easy|
 
-> * https://leetcode.com/problems/rotate-list/description/ m
+> * **https://leetcode.com/problems/rotate-list/description/** m
 > * https://leetcode.com/problems/swapping-nodes-in-a-linked-list/description/ 1386
 
 ### Middle
 | Problem          | Difficulty |
 |------------------|------------|
-|[876. Middle of the Linked List](../leetcode/876.middle-of-the-linked-list.md)|Easy|
+|**[876. Middle of the Linked List](../leetcode/876.middle-of-the-linked-list.md)**|Easy|
 |[2095. Delete the Middle Node of a Linked List](../leetcode/2095.delete-the-middle-node-of-a-linked-list.md)|Medium|
-|[234. Palindrome Linked List](../leetcode/234.palindrome-linked-list.md)|Easy|
+|**[234. Palindrome Linked List](../leetcode/234.palindrome-linked-list.md)**|Easy|
 > * https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/ 1317
 
 ### Merge
 | Problem          | Difficulty |
 |------------------|------------|
-|[21. Merge Two Sorted Lists](../leetcode/21.merge-two-sorted-lists.md)|Easy|
+|**[21. Merge Two Sorted Lists](../leetcode/21.merge-two-sorted-lists.md)**|Easy|
 |[2. Add Two Numbers](../leetcode/2.add-two-numbers.md)|Medium|
-|[23. Merge k Sorted Lists](../leetcode/23.merge-k-sorted-lists.md)|Hard|
-|[1669. Merge In Between Linked Lists](../leetcode/1669.merge-in-between-linked-lists.md)|Medium|
-|[2181. Merge Nodes in Between Zeros](../leetcode/2181.merge-nodes-in-between-zeros.md)|Medium (1333)|
+|**[23. Merge k Sorted Lists](../leetcode/23.merge-k-sorted-lists.md)**|Hard|
+|**[1669. Merge In Between Linked Lists](../leetcode/1669.merge-in-between-linked-lists.md)**|Medium|
+|@@[2181. Merge Nodes in Between Zeros](../leetcode/2181.merge-nodes-in-between-zeros.md)|Medium (1333)|
 > * https://leetcode.com/problems/add-two-numbers-ii/description/ m
 > * https://leetcode.com/problems/double-a-number-represented-as-a-linked-list/description/ 1393
 
 ### Other
 | Problem          | Difficulty |
 |------------------|------------|
 |[1472. Design Browser History](../leetcode/1472.design-browser-history.md)|Medium|
-|[138. Copy List with Random Pointer](../leetcode/138.copy-list-with-random-pointers.md)|Medium|
-|[146. LRU Cache](../leetcode/146.lru-cache.md)|Medium|
+|**[138. Copy List with Random Pointer](../leetcode/138.copy-list-with-random-pointers.md)**|Medium|
+|**[146. LRU Cache](../leetcode/146.lru-cache.md)**|Medium|
 
-> * https://leetcode.com/problems/linked-list-random-node/description/ m
+> * **https://leetcode.com/problems/linked-list-random-node/description/** m
 > ----
-> * https://leetcode.com/problems/lfu-cache/description/ hard
+> * **https://leetcode.com/problems/lfu-cache/description/** hard
 > * https://leetcode.com/problems/all-oone-data-structure/description/ hard
 > * https://leetcode.com/problems/design-skiplist/description/ hard