Updated exec time 111-120.

Author: javadev

README.md

@@ -75,7 +75,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0566 |[Reshape the Matrix](src.save/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java)| Easy | Array, Matrix, Simulation | 1 | 84.34
-| 0118 |[Pascal's Triangle](src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 1 | 62.34
+| 0118 |[Pascal's Triangle](src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08
 
 #### Day 5 Array
 
@@ -396,7 +396,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 |-|-|-|-|-|-
 | 0070 |[Climbing Stairs](src.save/main/java/g0001_0100/s0070_climbing_stairs/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization | 0 | 100.00
 | 0198 |[House Robber](src.save/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 0 | 100.00
-| 0120 |[Triangle](src.save/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming | 1 | 99.76
+| 0120 |[Triangle](src.save/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming | 2 | 94.63
 
 #### Day 13 Bit Manipulation
 
@@ -878,15 +878,15 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0118 |[Pascal's Triangle](src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 1 | 62.34
+| 0118 |[Pascal's Triangle](src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08
 | 0119 |[Pascal's Triangle II](src.save/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java)| Easy | Array, Dynamic_Programming | 0 | 100.00
 
 #### Day 13
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0931 |[Minimum Falling Path Sum](src.save/main/java/g0901_1000/s0931_minimum_falling_path_sum/Solution.java)| Medium | Array, Dynamic_Programming, Matrix | 4 | 72.19
-| 0120 |[Triangle](src.save/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming | 1 | 99.76
+| 0120 |[Triangle](src.save/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming | 2 | 94.63
 
 #### Day 14
 
@@ -3194,16 +3194,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.10'
 | 0123 |[Best Time to Buy and Sell Stock III](src.save/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.java)| Hard | Array, Dynamic_Programming | 1 | 100.00
 | 0122 |[Best Time to Buy and Sell Stock II](src.save/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7 | 2 | 34.31
 | 0121 |[Best Time to Buy and Sell Stock](src.save/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy | 2 | 85.25
-| 0120 |[Triangle](src.save/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13 | 1 | 99.76
+| 0120 |[Triangle](src.save/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13 | 2 | 94.63
 | 0119 |[Pascal's Triangle II](src.save/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java)| Easy | Array, Dynamic_Programming, Data_Structure_II_Day_3_Array, Dynamic_Programming_I_Day_12 | 0 | 100.00
-| 0118 |[Pascal's Triangle](src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_4_Array, Dynamic_Programming_I_Day_12 | 1 | 62.34
+| 0118 |[Pascal's Triangle](src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_4_Array, Dynamic_Programming_I_Day_12 | 1 | 67.08
 | 0117 |[Populating Next Right Pointers in Each Node II](src.save/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search | 0 | 100.00
 | 0116 |[Populating Next Right Pointers in Each Node](src.save/main/java/g0101_0200/s0116_populating_next_right_pointers_in_each_node/Solution.java)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_I_Day_8_Breadth_First_Search_Depth_First_Search | 0 | 100.00
-| 0115 |[Distinct Subsequences](src.save/main/java/g0101_0200/s0115_distinct_subsequences/Solution.java)| Hard | String, Dynamic_Programming | 3 | 99.53
-| 0114 |[Flatten Binary Tree to Linked List](src.save/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List | 1 | 69.36
+| 0115 |[Distinct Subsequences](src.save/main/java/g0101_0200/s0115_distinct_subsequences/Solution.java)| Hard | String, Dynamic_Programming | 2 | 100.00
+| 0114 |[Flatten Binary Tree to Linked List](src.save/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List | 1 | 75.27
 | 0113 |[Path Sum II](src.save/main/java/g0101_0200/s0113_path_sum_ii/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking, Data_Structure_II_Day_16_Tree | 1 | 100.00
 | 0112 |[Path Sum](src.save/main/java/g0101_0200/s0112_path_sum/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree | 0 | 100.00
-| 0111 |[Minimum Depth of Binary Tree](src.save/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 94.17
+| 0111 |[Minimum Depth of Binary Tree](src.save/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 97.49
 | 0110 |[Balanced Binary Tree](src.save/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Programming_Skills_II_Day_2 | 1 | 98.82
 | 0109 |[Convert Sorted List to Binary Search Tree](src.save/main/java/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/Solution.java)| Medium | Tree, Binary_Tree, Linked_List, Binary_Search_Tree, Divide_and_Conquer | 1 | 87.04
 | 0108 |[Convert Sorted Array to Binary Search Tree](src.save/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java)| Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree | 0 | 100.00

src.save/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.java

@@ -1,7 +1,7 @@
 package g0101_0200.s0111_minimum_depth_of_binary_tree;
 
 // #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
-// #2022_02_22_Time_1_ms_(94.17%)_Space_89.5_MB_(59.57%)
+// #2022_06_23_Time_1_ms_(97.49%)_Space_97_MB_(5.22%)
 
 import com_github_leetcode.TreeNode;
 import java.util.LinkedList;

src.save/main/java/g0101_0200/s0112_path_sum/Solution.java

@@ -1,7 +1,7 @@
 package g0101_0200.s0112_path_sum;
 
 // #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Data_Structure_I_Day_12_Tree
-// #2022_02_22_Time_0_ms_(100.00%)_Space_44_MB_(9.82%)
+// #2022_06_23_Time_0_ms_(100.00%)_Space_43.8_MB_(36.11%)
 
 import com_github_leetcode.TreeNode;
 

src.save/main/java/g0101_0200/s0113_path_sum_ii/Solution.java

@@ -1,7 +1,7 @@
 package g0101_0200.s0113_path_sum_ii;
 
 // #Medium #Depth_First_Search #Tree #Binary_Tree #Backtracking #Data_Structure_II_Day_16_Tree
-// #2022_02_22_Time_1_ms_(100.00%)_Space_42.4_MB_(47.38%)
+// #2022_06_23_Time_1_ms_(100.00%)_Space_44.7_MB_(53.10%)
 
 import com_github_leetcode.TreeNode;
 import java.util.ArrayList;

src.save/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java

@@ -1,7 +1,7 @@
 package g0101_0200.s0114_flatten_binary_tree_to_linked_list;
 
 // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List
-// #2022_02_22_Time_1_ms_(69.36%)_Space_42.6_MB_(22.05%)
+// #2022_06_23_Time_1_ms_(75.27%)_Space_42.8_MB_(36.48%)
 
 import com_github_leetcode.TreeNode;
 

src.save/main/java/g0101_0200/s0115_distinct_subsequences/Solution.java

@@ -1,6 +1,6 @@
 package g0101_0200.s0115_distinct_subsequences;
 
-// #Hard #String #Dynamic_Programming #2022_02_22_Time_3_ms_(99.53%)_Space_42.1_MB_(93.65%)
+// #Hard #String #Dynamic_Programming #2022_06_23_Time_2_ms_(100.00%)_Space_40.2_MB_(99.14%)
 
 public class Solution {
     public int numDistinct(String text, String text2) {
@@ -29,7 +29,6 @@ public int numDistinct(String text, String text2) {
                     if (i == 0) {
                         dp[j] = 1;
                     }
-
                     dp[j] += dp[j - 1];
                 } else {
                     dp[j] = dp[j - 1];

src.save/main/java/g0101_0200/s0116_populating_next_right_pointers_in_each_node/Solution.java

@@ -2,7 +2,7 @@
 
 // #Medium #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
 // #Linked_List #Algorithm_I_Day_8_Breadth_First_Search_Depth_First_Search
-// #2022_02_22_Time_0_ms_(100.00%)_Space_47.4_MB_(15.15%)
+// #2022_06_23_Time_0_ms_(100.00%)_Space_47.8_MB_(30.30%)
 
 import com_github_leetcode.left_right.Node;
 

src.save/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.java

@@ -2,7 +2,7 @@
 
 // #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Linked_List
 // #Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search
-// #2022_02_22_Time_0_ms_(100.00%)_Space_42.2_MB_(42.40%)
+// #2022_06_23_Time_0_ms_(100.00%)_Space_44.7_MB_(65.49%)
 
 import com_github_leetcode.left_right.Node;
 
@@ -37,7 +37,6 @@ public Node connect(Node root) {
         if (root.left == null && root.right == null) {
             return root;
         }
-
         if (root.left != null) {
             if (root.right != null) {
                 root.left.next = root.right;

src.save/main/java/g0101_0200/s0118_pascals_triangle/Solution.java

@@ -1,7 +1,7 @@
 package g0101_0200.s0118_pascals_triangle;
 
 // #Easy #Top_Interview_Questions #Array #Dynamic_Programming #Data_Structure_I_Day_4_Array
-// #Dynamic_Programming_I_Day_12 #2022_02_22_Time_1_ms_(62.34%)_Space_42_MB_(15.79%)
+// #Dynamic_Programming_I_Day_12 #2022_06_23_Time_1_ms_(67.08%)_Space_42.4_MB_(5.58%)
 
 import java.util.ArrayList;
 import java.util.List;

src.save/main/java/g0101_0200/s0120_triangle/Solution.java

@@ -1,7 +1,7 @@
 package g0101_0200.s0120_triangle;
 
 // #Medium #Array #Dynamic_Programming #Algorithm_I_Day_12_Dynamic_Programming
-// #Dynamic_Programming_I_Day_13 #2022_02_22_Time_1_ms_(99.76%)_Space_41.7_MB_(43.52%)
+// #Dynamic_Programming_I_Day_13 #2022_06_23_Time_2_ms_(94.63%)_Space_44.2_MB_(36.02%)
 
 import java.util.Arrays;
 import java.util.List;