[Auto] Update LeetCode README table

Author: github-actions[bot]

README.md

@@ -122,6 +122,7 @@ If you want to use this project follow the steps [here](https://github.com/NineP
 | 89. Gray Code | [🔗](https://leetcode.romitsagu.com/solutions/89/) | ![Medium](https://img.shields.io/badge/Difficulty-Medium-f9c851.svg) | Math, Backtracking, Bit Manipulation |
 | 90. Subsets II | [🔗](https://leetcode.romitsagu.com/solutions/90/) | ![Medium](https://img.shields.io/badge/Difficulty-Medium-f9c851.svg) | Array, Backtracking, Bit Manipulation |
 | 91. Decode Ways | [🔗](https://leetcode.romitsagu.com/solutions/91/) | ![Medium](https://img.shields.io/badge/Difficulty-Medium-f9c851.svg) | String, Dynamic Programming |
+| 92. Reverse Linked List II | [🔗](https://leetcode.romitsagu.com/solutions/92/) | ![Medium](https://img.shields.io/badge/Difficulty-Medium-f9c851.svg) | Linked List |
 | 94. Binary Tree Inorder Traversal | [🔗](https://leetcode.romitsagu.com/solutions/94/) | ![Easy](https://img.shields.io/badge/Difficulty-Easy-4c1.svg) | Stack, Tree, Depth-First Search, Binary Tree |
 | 96. Unique Binary Search Trees | [🔗](https://leetcode.romitsagu.com/solutions/96/) | ![Medium](https://img.shields.io/badge/Difficulty-Medium-f9c851.svg) | Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree |
 | 98. Validate Binary Search Tree | [🔗](https://leetcode.romitsagu.com/solutions/98/) | ![Medium](https://img.shields.io/badge/Difficulty-Medium-f9c851.svg) | Tree, Depth-First Search, Binary Search Tree, Binary Tree |

Site_README.md

@@ -118,6 +118,7 @@ This is a repo to store my leetcode solutions but I went a bit Schizo with it an
 | 89. Gray Code | [🔗](https://leetcode.romitsagu.com/solutions/89/) | <span style="background-color:#ffffff1a; color:#fac31d; padding:2px 6px; border-radius:6px;">Medium</span> | Math, Backtracking, Bit Manipulation |
 | 90. Subsets II | [🔗](https://leetcode.romitsagu.com/solutions/90/) | <span style="background-color:#ffffff1a; color:#fac31d; padding:2px 6px; border-radius:6px;">Medium</span> | Array, Backtracking, Bit Manipulation |
 | 91. Decode Ways | [🔗](https://leetcode.romitsagu.com/solutions/91/) | <span style="background-color:#ffffff1a; color:#fac31d; padding:2px 6px; border-radius:6px;">Medium</span> | String, Dynamic Programming |
+| 92. Reverse Linked List II | [🔗](https://leetcode.romitsagu.com/solutions/92/) | <span style="background-color:#ffffff1a; color:#fac31d; padding:2px 6px; border-radius:6px;">Medium</span> | Linked List |
 | 94. Binary Tree Inorder Traversal | [🔗](https://leetcode.romitsagu.com/solutions/94/) | <span style="background-color:#ffffff1a; color:#46c6c2; padding:2px 6px; border-radius:6px;">Easy</span> | Stack, Tree, Depth-First Search, Binary Tree |
 | 96. Unique Binary Search Trees | [🔗](https://leetcode.romitsagu.com/solutions/96/) | <span style="background-color:#ffffff1a; color:#fac31d; padding:2px 6px; border-radius:6px;">Medium</span> | Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree |
 | 98. Validate Binary Search Tree | [🔗](https://leetcode.romitsagu.com/solutions/98/) | <span style="background-color:#ffffff1a; color:#fac31d; padding:2px 6px; border-radius:6px;">Medium</span> | Tree, Depth-First Search, Binary Search Tree, Binary Tree |