Improved tags

javadev · javadev · Mar 6, 2025 · Mar 2, 2025 · Mar 2, 2025 · Mar 2, 2025
commit 0500a95235cc6b3146aae6081750bcc0cdcfe805
diff --git a/src/main/java/g3401_3500/s3467_transform_array_by_parity/Solution.java b/src/main/java/g3401_3500/s3467_transform_array_by_parity/Solution.java
@@ -1,6 +1,6 @@
 package g3401_3500.s3467_transform_array_by_parity;
 
-// #Easy #2025_03_06_Time_1_ms_(100.00%)_Space_45.26_MB_(23.27%)
+// #Easy #Array #Sorting #Counting #2025_03_06_Time_1_ms_(100.00%)_Space_45.11_MB_(42.10%)
 
 public class Solution {
  public int[] transformArray(int[] nums) {

diff --git a/src/main/java/g3401_3500/s3468_find_the_number_of_copy_arrays/Solution.java b/src/main/java/g3401_3500/s3468_find_the_number_of_copy_arrays/Solution.java
@@ -1,9 +1,9 @@
 package g3401_3500.s3468_find_the_number_of_copy_arrays;
 
-// #Medium #2025_03_02_Time_2_ms_(100.00%)_Space_97.78_MB_(100.00%)
+// #Medium #Array #Math #2025_03_02_Time_2_ms_(100.00%)_Space_97.78_MB_(100.00%)
 
 public class Solution {
- int countArrays(int[] original, int[][] bounds) {
+ public int countArrays(int[] original, int[][] bounds) {
  int low = bounds[0][0];
  int high = bounds[0][1];
  int ans = high - low + 1;

diff --git a/src/main/java/g3401_3500/s3469_find_minimum_cost_to_remove_array_elements/Solution.java b/src/main/java/g3401_3500/s3469_find_minimum_cost_to_remove_array_elements/Solution.java
@@ -1,6 +1,6 @@
 package g3401_3500.s3469_find_minimum_cost_to_remove_array_elements;
 
-// #Medium #2025_03_05_Time_12_ms_(100.00%)_Space_45.56_MB_(96.22%)
+// #Medium #Array #Dynamic_Programming #2025_03_06_Time_12_ms_(100.00%)_Space_45.73_MB_(95.77%)
 
 import java.util.Arrays;
 

diff --git a/src/main/java/g3401_3500/s3470_permutations_iv/Solution.java b/src/main/java/g3401_3500/s3470_permutations_iv/Solution.java
@@ -1,6 +1,7 @@
 package g3401_3500.s3470_permutations_iv;
 
-// #Hard #2025_03_02_Time_12_ms_(100.00%)_Space_44.78_MB_(100.00%)
+// #Hard #Array #Math #Enumeration #Combinatorics
+// #2025_03_06_Time_11_ms_(59.56%)_Space_45.24_MB_(58.67%)
 
 import java.util.ArrayList;
 import java.util.List;

diff --git a/src/main/java/g3401_3500/s3471_find_the_largest_almost_missing_integer/Solution.java b/src/main/java/g3401_3500/s3471_find_the_largest_almost_missing_integer/Solution.java
@@ -1,6 +1,6 @@
 package g3401_3500.s3471_find_the_largest_almost_missing_integer;
 
-// #Easy #2025_03_02_Time_4_ms_(100.00%)_Space_44.26_MB_(100.00%)
+// #Easy #Array #Hash_Table #2025_03_06_Time_4_ms_(73.95%)_Space_44.80_MB_(32.76%)
 
 import java.util.HashSet;
 import java.util.Set;

diff --git a/...g3401_3500/s3472_longest_palindromic_subsequence_after_at_most_k_operations/Solution.java b/...g3401_3500/s3472_longest_palindromic_subsequence_after_at_most_k_operations/Solution.java
@@ -1,6 +1,6 @@
 package g3401_3500.s3472_longest_palindromic_subsequence_after_at_most_k_operations;
 
-// #Medium #2025_03_02_Time_153_ms_(100.00%)_Space_87.64_MB_(100.00%)
+// #Medium #String #Dynamic_Programming #2025_03_06_Time_153_ms_(85.01%)_Space_87.68_MB_(54.23%)
 
 public class Solution {
  public int longestPalindromicSubsequence(String s, int k) {

diff --git a/src/main/java/g3401_3500/s3473_sum_of_k_subarrays_with_length_at_least_m/Solution.java b/src/main/java/g3401_3500/s3473_sum_of_k_subarrays_with_length_at_least_m/Solution.java
@@ -1,6 +1,7 @@
 package g3401_3500.s3473_sum_of_k_subarrays_with_length_at_least_m;
 
-// #Medium #2025_03_02_Time_198_ms_(100.00%)_Space_83.70_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #Prefix_Sum
+// #2025_03_06_Time_191_ms_(52.16%)_Space_83.66_MB_(63.85%)
 
 public class Solution {
  public int maxSum(int[] nums, int k, int m) {

diff --git a/src/main/java/g3401_3500/s3474_lexicographically_smallest_generated_string/Solution.java b/src/main/java/g3401_3500/s3474_lexicographically_smallest_generated_string/Solution.java
@@ -1,6 +1,6 @@
 package g3401_3500.s3474_lexicographically_smallest_generated_string;
 
-// #Hard #2025_03_02_Time_16_ms_(100.00%)_Space_45.37_MB_(100.00%)
+// #Hard #String #Greedy #String_Matching #2025_03_06_Time_17_ms_(64.86%)_Space_45.66_MB_(14.59%)
 
 public class Solution {
  public String generateString(String str1, String str2) {

diff --git a/src/main/java/g3401_3500/s3475_dna_pattern_recognition/script.sql b/src/main/java/g3401_3500/s3475_dna_pattern_recognition/script.sql
@@ -1,5 +1,5 @@
 # Write your MySQL query statement below
-# #Medium #2025_03_04_Time_645_ms_(100.00%)_Space_0.0_MB_(100.00%)
+# #Medium #Database #2025_03_06_Time_362_ms_(83.49%)_Space_0.0_MB_(100.00%)
 WITH SampleAnalysisCte AS (
  SELECT sample_id, dna_sequence, species,
  dna_sequence REGEXP '^ATG' AS has_start,