Added task 2516

Author: javadev

README.md

@@ -1848,6 +1848,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.19'
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
+| 2516 |[Take K of Each Character From Left and Right](src/main/java/g2501_2600/s2516_take_k_of_each_character_from_left_and_right/Solution.java)| Medium | String, Hash_Table, Sliding_Window | 6 | 94.24
 | 2515 |[Shortest Distance to Target String in a Circular Array](src/main/java/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array/Solution.java)| Easy | Array, String | 1 | 62.21
 | 2514 |[Count Anagrams](src/main/java/g2501_2600/s2514_count_anagrams/Solution.java)| Hard | String, Hash_Table, Math, Counting, Combinatorics | 22 | 100.00
 | 2513 |[Minimize the Maximum of Two Arrays](src/main/java/g2501_2600/s2513_minimize_the_maximum_of_two_arrays/Solution.java)| Medium | Math, Binary_Search, Number_Theory | 0 | 100.00

src/main/java/g2501_2600/s2516_take_k_of_each_character_from_left_and_right/Solution.java

@@ -0,0 +1,34 @@
+package g2501_2600.s2516_take_k_of_each_character_from_left_and_right;
+
+// #Medium #String #Hash_Table #Sliding_Window #2023_03_30_Time_6_ms_(94.24%)_Space_43.5_MB_(46.60%)
+
+public class Solution {
+    public int takeCharacters(String s, int k) {
+        if (s.length() < 3 * k) {
+            return -1;
+        }
+        int[] cnt = new int[3];
+        char[] arr = s.toCharArray();
+        for (char ch : arr) {
+            cnt[ch - 'a']++;
+        }
+        if (cnt[0] < k || cnt[1] < k || cnt[2] < k) {
+            return -1;
+        }
+        int ans = arr.length;
+        int i = 0;
+        int j = 0;
+        while (j < arr.length) {
+            cnt[arr[j] - 'a']--;
+            if (cnt[0] >= k && cnt[1] >= k && cnt[2] >= k) {
+                ans = Math.min(ans, arr.length - (j - i + 1));
+                j++;
+            } else {
+                cnt[arr[i] - 'a']++;
+                i++;
+                j++;
+            }
+        }
+        return ans;
+    }
+}

src/main/java/g2501_2600/s2516_take_k_of_each_character_from_left_and_right/readme.md

@@ -0,0 +1,37 @@
+2516\. Take K of Each Character From Left and Right
+
+Medium
+
+You are given a string `s` consisting of the characters `'a'`, `'b'`, and `'c'` and a non-negative integer `k`. Each minute, you may take either the **leftmost** character of `s`, or the **rightmost** character of `s`.
+
+Return _the **minimum** number of minutes needed for you to take **at least**_ `k` _of each character, or return_ `-1` _if it is not possible to take_ `k` _of each character._
+
+**Example 1:**
+
+**Input:** s = "aabaaaacaabc", k = 2
+
+**Output:** 8
+
+**Explanation:**
+
+Take three characters from the left of s. You now have two 'a' characters, and one 'b' character.
+
+Take five characters from the right of s. You now have four 'a' characters, two 'b' characters, and two 'c' characters.
+
+A total of 3 + 5 = 8 minutes is needed.
+
+It can be proven that 8 is the minimum number of minutes needed. 
+
+**Example 2:**
+
+**Input:** s = "a", k = 1
+
+**Output:** -1
+
+**Explanation:** It is not possible to take one 'b' or 'c' so return -1. 
+
+**Constraints:**
+
+*   <code>1 <= s.length <= 10<sup>5</sup></code>
+*   `s` consists of only the letters `'a'`, `'b'`, and `'c'`.
+*   `0 <= k <= s.length`

src/test/java/g2501_2600/s2516_take_k_of_each_character_from_left_and_right/SolutionTest.java

@@ -0,0 +1,18 @@
+package g2501_2600.s2516_take_k_of_each_character_from_left_and_right;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+    @Test
+    void takeCharacters() {
+        assertThat(new Solution().takeCharacters("aabaaaacaabc", 2), equalTo(8));
+    }
+
+    @Test
+    void takeCharacters2() {
+        assertThat(new Solution().takeCharacters("a", 1), equalTo(-1));
+    }
+}