diff --git a/problemset.jsonl b/problemset.jsonl
index 4cb9642..1125cd0 100644
--- a/problemset.jsonl
+++ b/problemset.jsonl
@@ -457,7 +457,7 @@
 {"id":463,"frontendId":463,"title":"Island Perimeter","titleSlug":"island-perimeter","difficulty":"EASY","paidOnly":false,"tags":["array","depth-first-search","breadth-first-search","matrix"]}
 {"id":464,"frontendId":464,"title":"Can I Win","titleSlug":"can-i-win","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming","bit-manipulation","memoization","game-theory","bitmask"]}
 {"id":465,"frontendId":465,"title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing","difficulty":"HARD","paidOnly":true,"tags":["array","dynamic-programming","backtracking","bit-manipulation","bitmask"]}
-{"id":466,"frontendId":466,"title":"Count The Repetitions","titleSlug":"count-the-repetitions","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
+{"id":466,"frontendId":466,"title":"Count The Repetitions","titleSlug":"count-the-repetitions","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
 {"id":467,"frontendId":467,"title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","dynamic-programming"]}
 {"id":468,"frontendId":468,"title":"Validate IP Address","titleSlug":"validate-ip-address","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
 {"id":469,"frontendId":469,"title":"Convex Polygon","titleSlug":"convex-polygon","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math","geometry"]}
@@ -2016,7 +2016,7 @@
 {"id":2106,"frontendId":1979,"title":"Find Greatest Common Divisor of Array","titleSlug":"find-greatest-common-divisor-of-array","difficulty":"EASY","paidOnly":false,"tags":["array","math","number-theory"]}
 {"id":2107,"frontendId":1980,"title":"Find Unique Binary String","titleSlug":"find-unique-binary-string","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","string","backtracking"]}
 {"id":2108,"frontendId":1981,"title":"Minimize the Difference Between Target and Chosen Elements","titleSlug":"minimize-the-difference-between-target-and-chosen-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
-{"id":2109,"frontendId":1982,"title":"Find Array Given Subset Sums","titleSlug":"find-array-given-subset-sums","difficulty":"HARD","paidOnly":false,"tags":["array","divide-and-conquer"]}
+{"id":2109,"frontendId":1982,"title":"Find Array Given Subset Sums","titleSlug":"find-array-given-subset-sums","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","sorting","counting"]}
 {"id":2110,"frontendId":1965,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information","difficulty":"EASY","paidOnly":false,"tags":["database"]}
 {"id":2111,"frontendId":1966,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","stack","monotonic-stack"]}
 {"id":2112,"frontendId":1984,"title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores","difficulty":"EASY","paidOnly":false,"tags":["array","sliding-window","sorting"]}
@@ -2607,7 +2607,7 @@
 {"id":2706,"frontendId":2567,"title":"Minimum Score by Changing Two Elements","titleSlug":"minimum-score-by-changing-two-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
 {"id":2707,"frontendId":2570,"title":"Merge Two 2D Arrays by Summing Values","titleSlug":"merge-two-2d-arrays-by-summing-values","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","two-pointers"]}
 {"id":2708,"frontendId":2573,"title":"Find the String with LCP","titleSlug":"find-the-string-with-lcp","difficulty":"HARD","paidOnly":false,"tags":["array","string","dynamic-programming","greedy","union-find","matrix"]}
-{"id":2709,"frontendId":2572,"title":"Count the Number of Square-Free Subsets","titleSlug":"count-the-number-of-square-free-subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","bit-manipulation","bitmask"]}
+{"id":2709,"frontendId":2572,"title":"Count the Number of Square-Free Subsets","titleSlug":"count-the-number-of-square-free-subsets","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","dynamic-programming","bit-manipulation","number-theory","bitmask"]}
 {"id":2710,"frontendId":2571,"title":"Minimum Operations to Reduce an Integer to 0","titleSlug":"minimum-operations-to-reduce-an-integer-to-0","difficulty":"MEDIUM","paidOnly":false,"tags":["dynamic-programming","greedy","bit-manipulation"]}
 {"id":2711,"frontendId":2577,"title":"Minimum Time to Visit a Cell In a Grid","titleSlug":"minimum-time-to-visit-a-cell-in-a-grid","difficulty":"HARD","paidOnly":false,"tags":["array","breadth-first-search","graph","heap-priority-queue","matrix","shortest-path"]}
 {"id":2712,"frontendId":2576,"title":"Find the Maximum Number of Marked Indices","titleSlug":"find-the-maximum-number-of-marked-indices","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","greedy","sorting"]}
@@ -2800,7 +2800,7 @@
 {"id":2902,"frontendId":2815,"title":"Max Pair Sum in an Array","titleSlug":"max-pair-sum-in-an-array","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
 {"id":2903,"frontendId":2807,"title":"Insert Greatest Common Divisors in Linked List","titleSlug":"insert-greatest-common-divisors-in-linked-list","difficulty":"MEDIUM","paidOnly":false,"tags":["linked-list","math","number-theory"]}
 {"id":2904,"frontendId":2826,"title":"Sorting Three Groups","titleSlug":"sorting-three-groups","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","dynamic-programming"]}
-{"id":2905,"frontendId":2791,"title":"Count Paths That Can Form a Palindrome in a Tree","titleSlug":"count-paths-that-can-form-a-palindrome-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","bit-manipulation","tree","depth-first-search","bitmask"]}
+{"id":2905,"frontendId":2791,"title":"Count Paths That Can Form a Palindrome in a Tree","titleSlug":"count-paths-that-can-form-a-palindrome-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["hash-table","bit-manipulation","tree","depth-first-search"]}
 {"id":2907,"frontendId":2804,"title":"Array Prototype ForEach","titleSlug":"array-prototype-foreach","difficulty":"EASY","paidOnly":true,"tags":[]}
 {"id":2908,"frontendId":2805,"title":"Custom Interval","titleSlug":"custom-interval","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
 {"id":2909,"frontendId":2821,"title":"Delay the Resolution of Each Promise","titleSlug":"delay-the-resolution-of-each-promise","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
@@ -2867,7 +2867,7 @@
 {"id":3076,"frontendId":2878,"title":"Get the Size of a DataFrame","titleSlug":"get-the-size-of-a-dataframe","difficulty":"EASY","paidOnly":false,"tags":[]}
 {"id":3077,"frontendId":2819,"title":"Minimum Relative Loss After Buying Chocolates","titleSlug":"minimum-relative-loss-after-buying-chocolates","difficulty":"HARD","paidOnly":true,"tags":["array","binary-search","sorting","prefix-sum"]}
 {"id":3078,"frontendId":2820,"title":"Election Results","titleSlug":"election-results","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
-{"id":3079,"frontendId":2846,"title":"Minimum Edge Weight Equilibrium Queries in a Tree","titleSlug":"minimum-edge-weight-equilibrium-queries-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","tree","graph","strongly-connected-component"]}
+{"id":3079,"frontendId":2846,"title":"Minimum Edge Weight Equilibrium Queries in a Tree","titleSlug":"minimum-edge-weight-equilibrium-queries-in-a-tree","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","tree","depth-first-search"]}
 {"id":3080,"frontendId":2871,"title":"Split Array Into Maximum Number of Subarrays","titleSlug":"split-array-into-maximum-number-of-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","bit-manipulation"]}
 {"id":3081,"frontendId":2856,"title":"Minimum Array Length After Pair Removals","titleSlug":"minimum-array-length-after-pair-removals","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","two-pointers","binary-search","greedy","counting"]}
 {"id":3088,"frontendId":2832,"title":"Maximal Range That Each Element Is Maximum in It","titleSlug":"maximal-range-that-each-element-is-maximum-in-it","difficulty":"MEDIUM","paidOnly":true,"tags":["array","stack","monotonic-stack"]}
@@ -2887,7 +2887,7 @@
 {"id":3113,"frontendId":2866,"title":"Beautiful Towers II","titleSlug":"beautiful-towers-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
 {"id":3114,"frontendId":2865,"title":"Beautiful Towers I","titleSlug":"beautiful-towers-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
 {"id":3139,"frontendId":2916,"title":"Subarrays Distinct Element Sum of Squares II","titleSlug":"subarrays-distinct-element-sum-of-squares-ii","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","binary-indexed-tree","segment-tree"]}
-{"id":3140,"frontendId":2876,"title":"Count Visited Nodes in a Directed Graph","titleSlug":"count-visited-nodes-in-a-directed-graph","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","graph","memoization"]}
+{"id":3140,"frontendId":2876,"title":"Count Visited Nodes in a Directed Graph","titleSlug":"count-visited-nodes-in-a-directed-graph","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming","depth-first-search","graph","topological-sort","memoization"]}
 {"id":3141,"frontendId":2875,"title":"Minimum Size Subarray in Infinite Array","titleSlug":"minimum-size-subarray-in-infinite-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","sliding-window","prefix-sum"]}
 {"id":3142,"frontendId":2901,"title":"Longest Unequal Adjacent Groups Subsequence II","titleSlug":"longest-unequal-adjacent-groups-subsequence-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","string","dynamic-programming"]}
 {"id":3143,"frontendId":2900,"title":"Longest Unequal Adjacent Groups Subsequence I","titleSlug":"longest-unequal-adjacent-groups-subsequence-i","difficulty":"EASY","paidOnly":false,"tags":["array","string","dynamic-programming","greedy"]}
@@ -3106,7 +3106,7 @@
 {"id":3380,"frontendId":3097,"title":"Shortest Subarray With OR at Least K II","titleSlug":"shortest-subarray-with-or-at-least-k-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","bit-manipulation","sliding-window"]}
 {"id":3381,"frontendId":3095,"title":"Shortest Subarray With OR at Least K I","titleSlug":"shortest-subarray-with-or-at-least-k-i","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation","sliding-window"]}
 {"id":3382,"frontendId":3113,"title":"Find the Number of Subarrays Where Boundary Elements Are Maximum","titleSlug":"find-the-number-of-subarrays-where-boundary-elements-are-maximum","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","stack","monotonic-stack"]}
-{"id":3383,"frontendId":3147,"title":"Taking Maximum Energy From the Mystic Dungeon","titleSlug":"taking-maximum-energy-from-the-mystic-dungeon","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
+{"id":3383,"frontendId":3147,"title":"Taking Maximum Energy From the Mystic Dungeon","titleSlug":"taking-maximum-energy-from-the-mystic-dungeon","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","prefix-sum"]}
 {"id":3384,"frontendId":3137,"title":"Minimum Number of Operations to Make Word K-Periodic","titleSlug":"minimum-number-of-operations-to-make-word-k-periodic","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","counting"]}
 {"id":3385,"frontendId":3078,"title":"Match Alphanumerical Pattern in Matrix I","titleSlug":"match-alphanumerical-pattern-in-matrix-i","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string","matrix"]}
 {"id":3386,"frontendId":3123,"title":"Find Edges in Shortest Paths","titleSlug":"find-edges-in-shortest-paths","difficulty":"HARD","paidOnly":false,"tags":["depth-first-search","breadth-first-search","graph","heap-priority-queue","shortest-path"]}
@@ -3561,7 +3561,7 @@
 {"id":3863,"frontendId":3607,"title":"Power Grid Maintenance","titleSlug":"power-grid-maintenance","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","depth-first-search","breadth-first-search","union-find","graph","heap-priority-queue","ordered-set"]}
 {"id":3864,"frontendId":3577,"title":"Count the Number of Computer Unlocking Permutations","titleSlug":"count-the-number-of-computer-unlocking-permutations","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","brainteaser","combinatorics"]}
 {"id":3865,"frontendId":3521,"title":"Find Product Recommendation Pairs","titleSlug":"find-product-recommendation-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
-{"id":3866,"frontendId":3579,"title":"Minimum Steps to Convert String with Operations","titleSlug":"minimum-steps-to-convert-string-with-operations","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming","greedy"]}
+{"id":3866,"frontendId":3579,"title":"Minimum Steps to Convert String with Operations","titleSlug":"minimum-steps-to-convert-string-with-operations","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
 {"id":3867,"frontendId":3563,"title":"Lexicographically Smallest String After Adjacent Removals","titleSlug":"lexicographically-smallest-string-after-adjacent-removals","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
 {"id":3868,"frontendId":3588,"title":"Find Maximum Area of a Triangle","titleSlug":"find-maximum-area-of-a-triangle","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","math","greedy","geometry","enumeration"]}
 {"id":3869,"frontendId":3550,"title":"Smallest Index With Digit Sum Equal to Index","titleSlug":"smallest-index-with-digit-sum-equal-to-index","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
@@ -3589,7 +3589,7 @@
 {"id":3892,"frontendId":3573,"title":"Best Time to Buy and Sell Stock V","titleSlug":"best-time-to-buy-and-sell-stock-v","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
 {"id":3893,"frontendId":3582,"title":"Generate Tag for Video Caption","titleSlug":"generate-tag-for-video-caption","difficulty":"EASY","paidOnly":false,"tags":["string","simulation"]}
 {"id":3894,"frontendId":3572,"title":"Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values","titleSlug":"maximize-ysum-by-picking-a-triplet-of-distinct-xvalues","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","sorting","heap-priority-queue"]}
-{"id":3896,"frontendId":3594,"title":"Minimum Time to Transport All Individuals","titleSlug":"minimum-time-to-transport-all-individuals","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation","graph","heap-priority-queue","shortest-path","bitmask"]}
+{"id":3896,"frontendId":3594,"title":"Minimum Time to Transport All Individuals","titleSlug":"minimum-time-to-transport-all-individuals","difficulty":"HARD","paidOnly":false,"tags":["array","bit-manipulation","graph","heap-priority-queue","shortest-path","bitmask"]}
 {"id":3897,"frontendId":3625,"title":"Count Number of Trapezoids II","titleSlug":"count-number-of-trapezoids-ii","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","math","geometry"]}
 {"id":3898,"frontendId":3564,"title":"Seasonal Sales Analysis","titleSlug":"seasonal-sales-analysis","difficulty":"MEDIUM","paidOnly":false,"tags":["database"]}
 {"id":3899,"frontendId":3565,"title":"Sequential Grid Path Cover","titleSlug":"sequential-grid-path-cover","difficulty":"MEDIUM","paidOnly":true,"tags":["array","recursion","matrix"]}
@@ -3679,6 +3679,7 @@
 {"id":3998,"frontendId":3674,"title":"Minimum Operations to Equalize Array","titleSlug":"minimum-operations-to-equalize-array","difficulty":"EASY","paidOnly":false,"tags":["array","bit-manipulation","brainteaser"]}
 {"id":3999,"frontendId":3675,"title":"Minimum Operations to Transform String","titleSlug":"minimum-operations-to-transform-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
 {"id":4000,"frontendId":3676,"title":"Count Bowl Subarrays","titleSlug":"count-bowl-subarrays","difficulty":"MEDIUM","paidOnly":false,"tags":["array","stack","monotonic-stack"]}
+{"id":4002,"frontendId":3859,"title":"Count Subarrays With K Distinct Integers","titleSlug":"count-subarrays-with-k-distinct-integers","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","sliding-window","counting"]}
 {"id":4003,"frontendId":3708,"title":"Longest Fibonacci Subarray","titleSlug":"longest-fibonacci-subarray","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
 {"id":4005,"frontendId":3689,"title":"Maximum Total Subarray Value I","titleSlug":"maximum-total-subarray-value-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
 {"id":4006,"frontendId":3656,"title":"Determine if a Simple Graph Exists","titleSlug":"determine-if-a-simple-graph-exists","difficulty":"MEDIUM","paidOnly":true,"tags":["array","binary-search","graph","sorting","prefix-sum"]}
@@ -3688,6 +3689,7 @@
 {"id":4010,"frontendId":3695,"title":"Maximize Alternating Sum Using Swaps","titleSlug":"maximize-alternating-sum-using-swaps","difficulty":"HARD","paidOnly":false,"tags":["array","greedy","union-find","sorting"]}
 {"id":4011,"frontendId":3678,"title":"Smallest Absent Positive Greater Than Average","titleSlug":"smallest-absent-positive-greater-than-average","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table"]}
 {"id":4012,"frontendId":3683,"title":"Earliest Time to Finish One Task","titleSlug":"earliest-time-to-finish-one-task","difficulty":"EASY","paidOnly":false,"tags":["array"]}
+{"id":4013,"frontendId":3853,"title":"Merge Close Characters","titleSlug":"merge-close-characters","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string"]}
 {"id":4015,"frontendId":3698,"title":"Split Array With Minimum Difference","titleSlug":"split-array-with-minimum-difference","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
 {"id":4017,"frontendId":3662,"title":"Filter Characters by Frequency","titleSlug":"filter-characters-by-frequency","difficulty":"EASY","paidOnly":true,"tags":["hash-table","string","counting"]}
 {"id":4018,"frontendId":3776,"title":"Minimum Moves to Balance Circular Array","titleSlug":"minimum-moves-to-balance-circular-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting"]}
@@ -3696,6 +3698,7 @@
 {"id":4021,"frontendId":3694,"title":"Distinct Points Reachable After Substring Removal","titleSlug":"distinct-points-reachable-after-substring-removal","difficulty":"MEDIUM","paidOnly":false,"tags":["hash-table","string","sliding-window","prefix-sum"]}
 {"id":4022,"frontendId":3762,"title":"Minimum Operations to Equalize Subarrays","titleSlug":"minimum-operations-to-equalize-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","math","binary-search","segment-tree"]}
 {"id":4023,"frontendId":3677,"title":"Count Binary Palindromic Numbers","titleSlug":"count-binary-palindromic-numbers","difficulty":"HARD","paidOnly":false,"tags":["math","bit-manipulation"]}
+{"id":4024,"frontendId":3857,"title":"Minimum Cost to Split into Ones","titleSlug":"minimum-cost-to-split-into-ones","difficulty":"MEDIUM","paidOnly":false,"tags":["math","dynamic-programming"]}
 {"id":4025,"frontendId":3657,"title":"Find Loyal Customers","titleSlug":"find-loyal-customers","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
 {"id":4027,"frontendId":3686,"title":"Number of Stable Subsequences","titleSlug":"number-of-stable-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming"]}
 {"id":4029,"frontendId":3667,"title":"Sort Array By Absolute Value","titleSlug":"sort-array-by-absolute-value","difficulty":"EASY","paidOnly":true,"tags":["array","math","two-pointers","sorting"]}
@@ -3801,7 +3804,9 @@
 {"id":4156,"frontendId":3800,"title":"Minimum Cost to Make Two Binary Strings Equal","titleSlug":"minimum-cost-to-make-two-binary-strings-equal","difficulty":"MEDIUM","paidOnly":false,"tags":["string","greedy"]}
 {"id":4157,"frontendId":3775,"title":"Reverse Words With Same Vowel Count","titleSlug":"reverse-words-with-same-vowel-count","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","simulation"]}
 {"id":4158,"frontendId":3774,"title":"Absolute Difference Between Maximum and Minimum K Elements","titleSlug":"absolute-difference-between-maximum-and-minimum-k-elements","difficulty":"EASY","paidOnly":false,"tags":["array","sorting"]}
+{"id":4159,"frontendId":3869,"title":"Count Fancy Numbers in a Range","titleSlug":"count-fancy-numbers-in-a-range","difficulty":"HARD","paidOnly":false,"tags":["math","dynamic-programming"]}
 {"id":4160,"frontendId":3780,"title":"Maximum Sum of Three Numbers Divisible by Three","titleSlug":"maximum-sum-of-three-numbers-divisible-by-three","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue"]}
+{"id":4161,"frontendId":3858,"title":"Minimum Bitwise OR From Grid","titleSlug":"minimum-bitwise-or-from-grid","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","bit-manipulation","matrix"]}
 {"id":4162,"frontendId":3779,"title":"Minimum Number of Operations to Have Distinct Elements","titleSlug":"minimum-number-of-operations-to-have-distinct-elements","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table"]}
 {"id":4164,"frontendId":3782,"title":"Last Remaining Integer After Alternating Deletion Operations","titleSlug":"last-remaining-integer-after-alternating-deletion-operations","difficulty":"HARD","paidOnly":false,"tags":["math","recursion"]}
 {"id":4165,"frontendId":3787,"title":"Find Diameter Endpoints of a Tree","titleSlug":"find-diameter-endpoints-of-a-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["tree","breadth-first-search","graph"]}
@@ -3824,6 +3829,7 @@
 {"id":4187,"frontendId":3809,"title":"Best Reachable Tower","titleSlug":"best-reachable-tower","difficulty":"MEDIUM","paidOnly":false,"tags":["array"]}
 {"id":4189,"frontendId":3821,"title":"Find Nth Smallest Integer With K One Bits","titleSlug":"find-nth-smallest-integer-with-k-one-bits","difficulty":"HARD","paidOnly":false,"tags":["math","bit-manipulation","combinatorics"]}
 {"id":4190,"frontendId":3810,"title":"Minimum Operations to Reach Target Array","titleSlug":"minimum-operations-to-reach-target-array","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy"]}
+{"id":4192,"frontendId":3864,"title":"Minimum Cost to Partition a Binary String","titleSlug":"minimum-cost-to-partition-a-binary-string","difficulty":"HARD","paidOnly":false,"tags":["string","divide-and-conquer","prefix-sum"]}
 {"id":4194,"frontendId":3827,"title":"Count Monobit Integers","titleSlug":"count-monobit-integers","difficulty":"EASY","paidOnly":false,"tags":["bit-manipulation","enumeration"]}
 {"id":4195,"frontendId":3793,"title":"Find Users with High Token Usage","titleSlug":"find-users-with-high-token-usage","difficulty":"EASY","paidOnly":false,"tags":[]}
 {"id":4197,"frontendId":3807,"title":"Minimum Cost to Repair Edges to Traverse a Graph","titleSlug":"minimum-cost-to-repair-edges-to-traverse-a-graph","difficulty":"MEDIUM","paidOnly":true,"tags":["binary-search","breadth-first-search","graph"]}
@@ -3843,9 +3849,26 @@
 {"id":4214,"frontendId":3833,"title":"Count Dominant Indices","titleSlug":"count-dominant-indices","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
 {"id":4216,"frontendId":3838,"title":"Weighted Word Mapping","titleSlug":"weighted-word-mapping","difficulty":"EASY","paidOnly":false,"tags":["array","string","simulation"]}
 {"id":4217,"frontendId":3843,"title":"First Element with Unique Frequency","titleSlug":"first-element-with-unique-frequency","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
+{"id":4219,"frontendId":3854,"title":"Minimum Operations to Make Array Parity Alternating","titleSlug":"minimum-operations-to-make-array-parity-alternating","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
+{"id":4220,"frontendId":3863,"title":"Minimum Operations to Sort a String","titleSlug":"minimum-operations-to-sort-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
 {"id":4221,"frontendId":3844,"title":"Longest Almost-Palindromic Substring","titleSlug":"longest-almost-palindromic-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
 {"id":4224,"frontendId":3847,"title":"Find the Score Difference in a Game","titleSlug":"find-the-score-difference-in-a-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
 {"id":4226,"frontendId":3848,"title":"Check Digitorial Permutation","titleSlug":"check-digitorial-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["math","counting"]}
 {"id":4227,"frontendId":3832,"title":"Find Users with Persistent Behavior Patterns","titleSlug":"find-users-with-persistent-behavior-patterns","difficulty":"HARD","paidOnly":false,"tags":[]}
 {"id":4228,"frontendId":3837,"title":"Delayed Count of Equal Elements","titleSlug":"delayed-count-of-equal-elements","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","counting"]}
+{"id":4229,"frontendId":3856,"title":"Trim Trailing Vowels","titleSlug":"trim-trailing-vowels","difficulty":"EASY","paidOnly":false,"tags":["string"]}
+{"id":4230,"frontendId":3872,"title":"Longest Arithmetic Sequence After Changing At Most One Element","titleSlug":"longest-arithmetic-sequence-after-changing-at-most-one-element","difficulty":"MEDIUM","paidOnly":false,"tags":["array","enumeration"]}
+{"id":4231,"frontendId":3852,"title":"Smallest Pair With Different Frequencies","titleSlug":"smallest-pair-with-different-frequencies","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
+{"id":4239,"frontendId":3855,"title":"Sum of K-Digit Numbers in a Range","titleSlug":"sum-of-k-digit-numbers-in-a-range","difficulty":"HARD","paidOnly":false,"tags":["math","divide-and-conquer","combinatorics","number-theory"]}
+{"id":4240,"frontendId":3862,"title":"Find the Smallest Balanced Index","titleSlug":"find-the-smallest-balanced-index","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
+{"id":4241,"frontendId":3860,"title":"Unique Email Groups","titleSlug":"unique-email-groups","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","string"]}
+{"id":4242,"frontendId":3867,"title":"Sum of GCD of Formed Pairs","titleSlug":"sum-of-gcd-of-formed-pairs","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math","two-pointers","simulation","number-theory"]}
+{"id":4245,"frontendId":3870,"title":"Count Commas in Range","titleSlug":"count-commas-in-range","difficulty":"EASY","paidOnly":false,"tags":["math"]}
+{"id":4247,"frontendId":3861,"title":"Minimum Capacity Box","titleSlug":"minimum-capacity-box","difficulty":"EASY","paidOnly":false,"tags":["array"]}
+{"id":4248,"frontendId":3871,"title":"Count Commas in Range II","titleSlug":"count-commas-in-range-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["math"]}
+{"id":4249,"frontendId":3873,"title":"Maximum Points Activated with One Addition","titleSlug":"maximum-points-activated-with-one-addition","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","union-find"]}
 {"id":4250,"frontendId":3851,"title":"Maximum Requests Without Violating the Limit","titleSlug":"maximum-requests-without-violating-the-limit","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","greedy","sliding-window","sorting"]}
+{"id":4252,"frontendId":3866,"title":"First Unique Even Element","titleSlug":"first-unique-even-element","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
+{"id":4253,"frontendId":3868,"title":"Minimum Cost to Equalize Arrays Using Swaps","titleSlug":"minimum-cost-to-equalize-arrays-using-swaps","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","counting"]}
+{"id":4261,"frontendId":3865,"title":"Reverse K Subarrays","titleSlug":"reverse-k-subarrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers"]}
+{"id":4269,"frontendId":3874,"title":"Valid Subarrays With Exactly One Peak","titleSlug":"valid-subarrays-with-exactly-one-peak","difficulty":"MEDIUM","paidOnly":true,"tags":[]}