add 2728

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -18,6 +18,7 @@
 | 2739 | [Total Distance Traveled](https://leetcode.com/problems/total-distance-traveled/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2739.java)                                       |  | Easy                           |
 | 2733 | [Neither Minimum nor Maximum](https://leetcode.com/problems/neither-minimum-nor-maximum/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2733.java)                                       |  | Easy                           |
 | 2729 | [Check if The Number is Fascinating](https://leetcode.com/problems/check-if-the-number-is-fascinating/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2729.java)                                       | | Easy                           |
+| 2728 | [Count Houses in a Circular Street](https://leetcode.com/problems/count-houses-in-a-circular-street/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2728.java)                                       | | Easy                           |
 | 2716 | [Minimize String Length](https://leetcode.com/problems/minimize-string-length/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2716.java)                                       | [:tv:](https://youtu.be/aMJ3T0K8LjI) | Easy                           |
 | 2710 | [Remove Trailing Zeros From a String](https://leetcode.com/problems/remove-trailing-zeros-from-a-string/)                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2710.java)                                       |                                 | Easy                           |
 | 2706 | [Buy Two Chocolates](https://leetcode.com/problems/buy-two-chocolates/)                                                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2706.java)                                       |                                 | Easy                           |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2728.java

@@ -0,0 +1,52 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2728 {
+    public static class Street {
+        //dummy class to make compilation possible
+        public Street(int[] doors) {
+
+        }
+
+        public void openDoor() {
+
+        }
+
+        public void closeDoor() {
+
+        }
+
+        public boolean isDoorOpen() {
+            return false;
+        }
+
+        public void moveRight() {
+
+        }
+
+        public void moveLeft() {
+
+        }
+    }
+
+    public static class Solution1 {
+        public int houseCount(Street street, int k) {
+            //close all doors
+            for (int i = 0; i < k; i++) {
+                street.closeDoor();
+                street.moveRight();
+            }
+            //open one door
+            street.openDoor();
+            int houses = 1;
+            for (int i = 0; i < k; i++) {
+                street.moveRight();
+                if (street.isDoorOpen()) {
+                    return houses;
+                }
+                houses++;
+            }
+            return houses;
+        }
+
+    }
+}