Single new question for testing

Author: Zanger67

README.md

@@ -280,6 +280,7 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
 | 2013 | [Detect Squares](<https://leetcode.com/problems/detect-squares>)                                                                                                                         | Medium  | N150           | [solution](<markdowns/_2013. Detect Squares.md>)                                                             | py                               |
 | 2037 | [Minimum Number of Moves to Seat Everyone](<https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone>)                                                                     | Easy    | Daily          | [solution](<markdowns/_2037. Minimum Number of Moves to Seat Everyone.md>)                                   | py, c                            |
 | 2083 | [Substrings That Begin and End With the Same Letter](<https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter>)                                                 | Medium  | Weekly Premium | [solution](<markdowns/_2083. Substrings That Begin and End With the Same Letter.md>)                         | py, c                            |
+| 2086 | [Minimum Number of Food Buckets to Feed the Hamsters](<https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters>)                                               | Medium  |                | [solution](<markdowns/_2086. Minimum Number of Food Buckets to Feed the Hamsters.md>)                        | java                             |
 | 2095 | [Delete the Middle Node of a Linked List](<https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list>)                                                                       | Medium  |                | [solution](<markdowns/_2095. Delete the Middle Node of a Linked List.md>)                                    | java, c                          |
 | 2130 | [Maximum Twin Sum of a Linked List](<https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list>)                                                                                   | Medium  |                | [solution](<markdowns/_2130. Maximum Twin Sum of a Linked List.md>)                                          | py                               |
 | 2149 | [Rearrange Array Elements by Sign](<https://leetcode.com/problems/rearrange-array-elements-by-sign>)                                                                                     | Medium  |                | [solution](<markdowns/_2149. Rearrange Array Elements by Sign.md>)                                           | py, c                            |

markdowns/_2086. Minimum Number of Food Buckets to Feed the Hamsters.md

@@ -0,0 +1,43 @@
+# 2086. [Minimum Number of Food Buckets to Feed the Hamsters](<https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters>)
+
+*First added: July 01, 2024*
+
+*First added: July 01, 2024*
+
+
+> *To see the question prompt, click the title.*
+
+**Topics:** String, Dynamic Programming, Greedy
+
+**AC %:** 46.157
+
+
+## Solutions
+
+- [m2086.java](<../my-submissions/m2086.java>)
+### Java
+#### [m2086.java](<../my-submissions/m2086.java>)
+```Java
+class Solution {
+    public int minimumBuckets(String hamsters) {
+        int counter = 0;
+
+        for (int i = 0; i < hamsters.length(); i++) {
+            if (hamsters.charAt(i) != 'H') {
+                continue;
+            }
+            counter++;
+            
+            if ((i == hamsters.length() - 1 || hamsters.charAt(i + 1) == 'H') && (i == 0 || hamsters.charAt(i - 1) == 'H')) {
+                return -1;
+            }
+            if (i != hamsters.length() - 1 && hamsters.charAt(i + 1) != 'H') {
+                i += 2;
+            }
+        }
+
+        return counter;
+    }
+}
+```
+

my-submissions/m2086.java

@@ -0,0 +1,21 @@
+class Solution {
+    public int minimumBuckets(String hamsters) {
+        int counter = 0;
+
+        for (int i = 0; i < hamsters.length(); i++) {
+            if (hamsters.charAt(i) != 'H') {
+                continue;
+            }
+            counter++;
+            
+            if ((i == hamsters.length() - 1 || hamsters.charAt(i + 1) == 'H') && (i == 0 || hamsters.charAt(i - 1) == 'H')) {
+                return -1;
+            }
+            if (i != hamsters.length() - 1 && hamsters.charAt(i + 1) != 'H') {
+                i += 2;
+            }
+        }
+
+        return counter;
+    }
+}