updating docs

Author: github-actions[bot]

docs/.vitepress/Sidebar.js

@@ -171,6 +171,14 @@ export default Sidebar = [
         text: "118 - Pascals Triangle",
         link: "/solution/0101-0200/118 - Pascals Triangle.md",
       },
+      {
+        text: "119 - Pascals Triangle II",
+        link: "/solution/0101-0200/119 - Pascals Triangle II.md",
+      },
+      {
+        text: "121 - Best Time to Buy and Sell Stock",
+        link: "/solution/0101-0200/121 - Best Time to Buy and Sell Stock.md",
+      },
       {
         text: "122 - Best Time to Buy and Sell Stock II",
         link: "/solution/0101-0200/122 - Best Time to Buy and Sell Stock II.md",
@@ -298,6 +306,14 @@ export default Sidebar = [
         text: "242 - Valid Anagram",
         link: "/solution/0201-0300/242 - Valid Anagram.md",
       },
+      {
+        text: "257 - Binary Tree Paths",
+        link: "/solution/0201-0300/257 - Binary Tree Paths.md",
+      },
+      {
+        text: "258 - Add Digits",
+        link: "/solution/0201-0300/258 - Add Digits.md",
+      },
       {
         text: "278 - First Bad Version",
         link: "/solution/0201-0300/278 - First Bad Version.md",

docs/SERIALWISE.md

@@ -54,6 +54,8 @@
 | **0111** |                 [Minimum Depth of Binary Tree][111]                 |           Tree, Depth First Search, Breadth First Search, Binary Tree           |  ![][easy]  |        |
 | **0112** |                           [Path Sum][112]                           |           Tree, Depth-First Search, Breadth-First Search, Binary Tree           |  ![][easy]  |        |
 | **0118** |                      [Pascal's Triangle][118]                       |                                    Array, DP                                    |  ![][easy]  |        |
+| **0119** |                     [Pascal's Triangle II][119]                     |                                    Array, DP                                    |  ![][easy]  |        |
+| **0121** |               [Best Time to Buy and Sell Stock][121]                |                                    Array, DP                                    |  ![][easy]  |        |
 | **0122** |              [Best Time to Buy and Sell Stock II][122]              |                       Array, Dynamic Programming, Greedy                        | ![][medium] |        |
 | **0125** |                       [Valid Palindrome][125]                       |                              Two Pointers, String                               |  ![][easy]  |        |
 | **0136** |                        [Single Number][136]                         |                                Array, Bit Manip                                 |  ![][easy]  |        |
@@ -84,6 +86,8 @@
 | **0234** |                    [Palindrome Linked List][234]                    |                   Linked List, Two Pointers, Stack, Recursion                   |  ![][easy]  |        |
 | **0236** |           [Lowest Common Ancestor of a Binary Tree][236]            |                      Tree, Depth-First Search, Binary Tree                      | ![][medium] |        |
 | **0242** |                        [Valid Anagram][242]                         |                           Hash Table, String, Sorting                           |  ![][easy]  |        |
+| **0257** |                      [Binary Tree Paths][257]                       |           String, Backtracking, Tree, Depth-First Search, Binary Tree           |  ![][easy]  |        |
+| **0258** |                          [Add Digits][258]                          |                         Math, Simulation, Number Theory                         |  ![][easy]  |        |
 | **0278** |                      [First Bad Version][278]                       |                           Binary Search, Interactive                            |  ![][easy]  |        |
 | **0283** |                         [Move Zeroes][283]                          |                               Array, Two Pointers                               |  ![][easy]  |        |
 | **0300** |                [Longest Increasing Subsequence][300]                |                            Array, Binary Search, DP                             | ![][medium] |        |
@@ -173,6 +177,8 @@
 [111]: ./solution/0101-0200/111%20-%20Minimum%20Depth%20of%20Binary%20Tree.md
 [112]: ./solution/0101-0200/112%20-%20Path%20Sum.md
 [118]: ./solution/0101-0200/118%20-%20Pascals%20Triangle.md
+[119]: ./solution/0101-0200/119%20-%20Pascals%20Triangle%20II.md
+[121]: ./solution/0101-0200/121%20-%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md
 [122]: ./solution/0101-0200/122%20-%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md
 [125]: ./solution/0101-0200/125%20-%20Valid%20Palindrome.md
 [134]: ./solution/0101-0200/134%20-%20Gas%20Station.md
@@ -206,6 +212,8 @@
 [236]: ./solution/0201-0300/236%20-%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree.md
 [239]: ./solution/0201-0300/239%20-%20Sliding%20Window%20Maximum.md
 [242]: ./solution/0201-0300/242%20-%20Valid%20Anagram.md
+[257]: ./solution/0201-0300/257%20-%20Binary%20Tree%20Paths.md
+[258]: ./solution/0201-0300/258%20-%20Add%20Digits.md
 [278]: ./solution/0201-0300/278%20-%20First%20Bad%20Version.md
 [283]: ./solution/0201-0300/283%20-%20Move%20Zeroes.md
 [300]: ./solution/0201-0300/300%20-%20Longest%20Increasing%20Subsequence.md