add 3028

Author: fishercoder1534

Diff for: paginated_contents/algorithms/4th_thousand/README.md

@@ -63,6 +63,7 @@
 | 3038 | [Maximum Number of Operations With the Same Score I](https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i/)                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3038.java) |                                                                               | Easy       |
 | 3033 | [Modify the Matrix](https://leetcode.com/problems/modify-the-matrix/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3033.java) |                                                                               | Easy       |
 | 3032 | [Count Numbers With Unique Digits II](https://leetcode.com/problems/count-numbers-with-unique-digits-ii/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3032.java) |                                                                               | Easy       |
+| 3028 | [Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3028.java) |                                                                               | Easy       |
 | 3010 | [Divide an Array Into Subarrays With Minimum Cost I](https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3010.java) |                                                                               | Easy       |
 | 3014 | [Minimum Number of Pushes to Type Word I](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3014.java) |                                                                               | Easy       |
 | 3006 | [Find Beautiful Indices in the Given Array I](https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/)                                           | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3006.java) |                                                                               | Medium     |

Diff for: src/main/java/com/fishercoder/solutions/fourththousand/_3028.java

@@ -0,0 +1,17 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3028 {
+    public static class Solution1 {
+        public int returnToBoundaryCount(int[] nums) {
+            int ans = 0;
+            int pos = 0;
+            for (int i = 0; i < nums.length; i++) {
+                pos += nums[i];
+                if (pos == 0) {
+                    ans++;
+                }
+            }
+            return ans;
+        }
+    }
+}