Updated exec time 587-598.

Author: javadev

README.md

@@ -722,7 +722,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0589 |[N-ary Tree Preorder Traversal](src.save/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack | 2 | 54.35
+| 0589 |[N-ary Tree Preorder Traversal](src.save/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack | 1 | 90.98
 | 0496 |[Next Greater Element I](src.save/main/java/g0401_0500/s0496_next_greater_element_i/Solution.java)| Easy | Array, Hash_Table, Stack, Monotonic_Stack | 4 | 81.18
 | 1232 |[Check If It Is a Straight Line](src.save/main/java/g1201_1300/s1232_check_if_it_is_a_straight_line/Solution.java)| Easy | Array, Math, Geometry | 0 | 100.00
 
@@ -1035,7 +1035,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0595 |[Big Countries](src.save/main/java/g0501_0600/s0595_big_countries/script.sql)| Easy | Database | 241 | 92.61
+| 0595 |[Big Countries](src.save/main/java/g0501_0600/s0595_big_countries/script.sql)| Easy | Database | 262 | 84.64
 | 1757 |[Recyclable and Low Fat Products](src.save/main/java/g1701_1800/s1757_recyclable_and_low_fat_products/script.sql)| Easy | Database | 475 | 71.54
 | 0584 |[Find Customer Referee](src.save/main/java/g0501_0600/s0584_find_customer_referee/script.sql)| Easy | Database | 531 | 58.63
 | 0183 |[Customers Who Never Order](src.save/main/java/g0101_0200/s0183_customers_who_never_order/script.sql)| Easy | Database | 376 | 98.73
@@ -1155,7 +1155,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0589 |[N-ary Tree Preorder Traversal](src.save/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack | 2 | 54.35
+| 0589 |[N-ary Tree Preorder Traversal](src.save/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack | 1 | 90.98
 | 0102 |[Binary Tree Level Order Traversal](src.save/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 1 | 91.09
 
 #### Day 7 Binary Search
@@ -3247,15 +3247,15 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
 | 0600 |[Non-negative Integers without Consecutive Ones](src.save/main/java/g0501_0600/s0600_non_negative_integers_without_consecutive_ones/Solution.java)| Hard | Dynamic_Programming | 2 | 74.62
 | 0599 |[Minimum Index Sum of Two Lists](src.save/main/java/g0501_0600/s0599_minimum_index_sum_of_two_lists/Solution.java)| Easy | Array, String, Hash_Table | 7 | 93.97
 | 0598 |[Range Addition II](src.save/main/java/g0501_0600/s0598_range_addition_ii/Solution.java)| Easy | Array, Math | 0 | 100.00
-| 0596 |[Classes More Than 5 Students](src.save/main/java/g0501_0600/s0596_classes_more_than_5_students/script.sql)| Easy | Database | 243 | 92.65
-| 0595 |[Big Countries](src.save/main/java/g0501_0600/s0595_big_countries/script.sql)| Easy | Database, SQL_I_Day_1_Select | 241 | 92.61
-| 0594 |[Longest Harmonious Subsequence](src.save/main/java/g0501_0600/s0594_longest_harmonious_subsequence/Solution.java)| Easy | Array, Hash_Table, Sorting | 11 | 99.77
-| 0593 |[Valid Square](src.save/main/java/g0501_0600/s0593_valid_square/Solution.java)| Medium | Math, Geometry | 1 | 97.14
-| 0592 |[Fraction Addition and Subtraction](src.save/main/java/g0501_0600/s0592_fraction_addition_and_subtraction/Solution.java)| Medium | String, Math, Simulation | 4 | 98.58
-| 0591 |[Tag Validator](src.save/main/java/g0501_0600/s0591_tag_validator/Solution.java)| Hard | String, Stack | 3 | 70.89
-| 0590 |[N-ary Tree Postorder Traversal](src.save/main/java/g0501_0600/s0590_n_ary_tree_postorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack | 0 | 100.00
-| 0589 |[N-ary Tree Preorder Traversal](src.save/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack, Programming_Skills_I_Day_5_Function, Level_1_Day_6_Tree | 2 | 54.35
-| 0587 |[Erect the Fence](src.save/main/java/g0501_0600/s0587_erect_the_fence/Solution.java)| Hard | Array, Math, Geometry | 10 | 87.50
+| 0596 |[Classes More Than 5 Students](src.save/main/java/g0501_0600/s0596_classes_more_than_5_students/script.sql)| Easy | Database | 290 | 74.62
+| 0595 |[Big Countries](src.save/main/java/g0501_0600/s0595_big_countries/script.sql)| Easy | Database, SQL_I_Day_1_Select | 262 | 84.64
+| 0594 |[Longest Harmonious Subsequence](src.save/main/java/g0501_0600/s0594_longest_harmonious_subsequence/Solution.java)| Easy | Array, Hash_Table, Sorting | 16 | 95.95
+| 0593 |[Valid Square](src.save/main/java/g0501_0600/s0593_valid_square/Solution.java)| Medium | Math, Geometry | 1 | 97.24
+| 0592 |[Fraction Addition and Subtraction](src.save/main/java/g0501_0600/s0592_fraction_addition_and_subtraction/Solution.java)| Medium | String, Math, Simulation | 6 | 91.33
+| 0591 |[Tag Validator](src.save/main/java/g0501_0600/s0591_tag_validator/Solution.java)| Hard | String, Stack | 2 | 94.35
+| 0590 |[N-ary Tree Postorder Traversal](src.save/main/java/g0501_0600/s0590_n_ary_tree_postorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack | 1 | 90.45
+| 0589 |[N-ary Tree Preorder Traversal](src.save/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java)| Easy | Depth_First_Search, Tree, Stack, Programming_Skills_I_Day_5_Function, Level_1_Day_6_Tree | 1 | 90.98
+| 0587 |[Erect the Fence](src.save/main/java/g0501_0600/s0587_erect_the_fence/Solution.java)| Hard | Array, Math, Geometry | 12 | 90.91
 | 0586 |[Customer Placing the Largest Number of Orders](src.save/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/script.sql)| Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_8_Function | 484 | 66.42
 | 0584 |[Find Customer Referee](src.save/main/java/g0501_0600/s0584_find_customer_referee/script.sql)| Easy | Database, SQL_I_Day_1_Select | 531 | 58.63
 | 0583 |[Delete Operation for Two Strings](src.save/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java)| Medium | String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming | 12 | 79.10

src.save/main/java/g0501_0600/s0587_erect_the_fence/Solution.java

@@ -1,6 +1,6 @@
 package g0501_0600.s0587_erect_the_fence;
 
-// #Hard #Array #Math #Geometry #2022_03_20_Time_10_ms_(87.50%)_Space_55.1_MB_(6.25%)
+// #Hard #Array #Math #Geometry #2022_08_25_Time_12_ms_(90.91%)_Space_54.5_MB_(58.18%)
 
 import java.util.Arrays;
 

src.save/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java

@@ -1,7 +1,7 @@
 package g0501_0600.s0589_n_ary_tree_preorder_traversal;
 
 // #Easy #Depth_First_Search #Tree #Stack #Programming_Skills_I_Day_5_Function #Level_1_Day_6_Tree
-// #2022_03_20_Time_2_ms_(54.35%)_Space_46.3_MB_(34.84%)
+// #2022_08_25_Time_1_ms_(90.98%)_Space_45.4_MB_(83.13%)
 
 import com_github_leetcode.Node;
 import java.util.ArrayList;

src.save/main/java/g0501_0600/s0590_n_ary_tree_postorder_traversal/Solution.java

@@ -1,6 +1,6 @@
 package g0501_0600.s0590_n_ary_tree_postorder_traversal;
 
-// #Easy #Depth_First_Search #Tree #Stack #2022_03_20_Time_0_ms_(100.00%)_Space_42.9_MB_(90.33%)
+// #Easy #Depth_First_Search #Tree #Stack #2022_08_25_Time_1_ms_(90.45%)_Space_46.5_MB_(27.08%)
 
 import com_github_leetcode.Node;
 import java.util.ArrayList;

src.save/main/java/g0501_0600/s0591_tag_validator/Solution.java

@@ -1,6 +1,6 @@
 package g0501_0600.s0591_tag_validator;
 
-// #Hard #String #Stack #2022_03_20_Time_3_ms_(70.89%)_Space_42.3_MB_(56.33%)
+// #Hard #String #Stack #2022_08_25_Time_2_ms_(94.35%)_Space_43_MB_(13.56%)
 
 import java.util.ArrayDeque;
 import java.util.Deque;

src.save/main/java/g0501_0600/s0592_fraction_addition_and_subtraction/Solution.java

@@ -1,6 +1,6 @@
 package g0501_0600.s0592_fraction_addition_and_subtraction;
 
-// #Medium #String #Math #Simulation #2022_03_20_Time_4_ms_(98.58%)_Space_40.3_MB_(83.27%)
+// #Medium #String #Math #Simulation #2022_08_25_Time_6_ms_(91.33%)_Space_40.8_MB_(97.33%)
 
 import java.util.ArrayList;
 import java.util.List;

src.save/main/java/g0501_0600/s0593_valid_square/Solution.java

@@ -1,6 +1,6 @@
 package g0501_0600.s0593_valid_square;
 
-// #Medium #Math #Geometry #2022_03_20_Time_1_ms_(97.14%)_Space_42.4_MB_(32.38%)
+// #Medium #Math #Geometry #2022_08_25_Time_1_ms_(97.24%)_Space_42.7_MB_(17.00%)
 
 import java.util.Arrays;
 

src.save/main/java/g0501_0600/s0594_longest_harmonious_subsequence/Solution.java

@@ -1,6 +1,6 @@
 package g0501_0600.s0594_longest_harmonious_subsequence;
 
-// #Easy #Array #Hash_Table #Sorting #2022_03_20_Time_11_ms_(99.77%)_Space_42.6_MB_(95.06%)
+// #Easy #Array #Hash_Table #Sorting #2022_08_25_Time_16_ms_(95.95%)_Space_54.5_MB_(74.21%)
 
 import java.util.Arrays;
 

src.save/main/java/g0501_0600/s0595_big_countries/script.sql

@@ -1,5 +1,5 @@
 # Write your MySQL query statement below
-# #Easy #Database #SQL_I_Day_1_Select #2022_03_20_Time_241_ms_(92.61%)_Space_0B_(100.00%)
+# #Easy #Database #SQL_I_Day_1_Select #2022_08_25_Time_262_ms_(84.64%)_Space_0B_(100.00%)
 select name, population, area
 from world
 where area >= 3000000

src.save/main/java/g0501_0600/s0596_classes_more_than_5_students/script.sql

@@ -1,5 +1,5 @@
 # Write your MySQL query statement below
-# #Easy #Database #2022_03_20_Time_243_ms_(92.65%)_Space_0B_(100.00%)
+# #Easy #Database #2022_08_25_Time_290_ms_(74.62%)_Space_0B_(100.00%)
 select class
 from Courses
 group by class