Improved tasks 3264, 3265, 3266, 3267

Author: javadev

src/main/java/g3201_3300/s3264_final_array_state_after_k_multiplication_operations_i/Solution.java

@@ -1,6 +1,7 @@
 package g3201_3300.s3264_final_array_state_after_k_multiplication_operations_i;
 
-// #Easy #2024_08_28_Time_1_ms_(100.00%)_Space_44.9_MB_(31.20%)
+// #Easy #Array #Math #Heap_Priority_Queue #Simulation
+// #2024_08_28_Time_1_ms_(100.00%)_Space_44.9_MB_(31.20%)
 
 public class Solution {
     public int[] getFinalState(int[] nums, int k, int multiplier) {

src/main/java/g3201_3300/s3265_count_almost_equal_pairs_i/Solution.java

@@ -1,6 +1,7 @@
 package g3201_3300.s3265_count_almost_equal_pairs_i;
 
-// #Medium #2024_08_28_Time_5_ms_(100.00%)_Space_44.7_MB_(91.23%)
+// #Medium #Array #Hash_Table #Sorting #Counting #Enumeration
+// #2024_08_28_Time_5_ms_(100.00%)_Space_44.7_MB_(91.23%)
 
 public class Solution {
     public int countPairs(int[] nums) {

src/main/java/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii/Solution.java

@@ -1,6 +1,7 @@
 package g3201_3300.s3266_final_array_state_after_k_multiplication_operations_ii;
 
-// #Hard #2024_08_28_Time_26_ms_(100.00%)_Space_47_MB_(51.94%)
+// #Hard #Array #Heap_Priority_Queue #Simulation
+// #2024_08_28_Time_26_ms_(100.00%)_Space_47_MB_(51.94%)
 
 import java.util.Arrays;
 import java.util.PriorityQueue;

src/main/java/g3201_3300/s3267_count_almost_equal_pairs_ii/Solution.java

@@ -1,6 +1,7 @@
 package g3201_3300.s3267_count_almost_equal_pairs_ii;
 
-// #Hard #2024_08_28_Time_353_ms_(99.78%)_Space_45.8_MB_(56.64%)
+// #Hard #Array #Hash_Table #Sorting #Counting #Enumeration
+// #2024_08_28_Time_353_ms_(99.78%)_Space_45.8_MB_(56.64%)
 
 import java.util.Arrays;
 import java.util.HashMap;