**Problem Statement:**\n\nThere are some house in a cicular street. something like in the below picture\n\n![image](https://assets.leetcode.com/users/images/47b1379c-e17d-4070-9fe0-a2dd5d389b97_1653540757.977634.png)\n\n\neach house is connected to its neighbours, on each house you are allowed to do the below operations:\n\n* void openDoor()\n* void closeDoor()\n* boolean isDoorOpen()\n* House moveRight()\n* House moveLeft()\n\nSuppose Initially, it is given that all the House doors are closed. and you are standing at one random house. and you have to count the total number of houses in the Circle. (by moving to the right or left) . how will you count the number of houses?\n\n**My Approach**\n\n```\nint count = 1;\n// open the door of first house only\nopenDoor();\nmoveRight();\n// keep moving to right until we found that house of which we openned the door initially\nwhile(!isDoorOpen()){\n\tcount++;\n\tmoveRight();\n}\nreturn count;\n```\n\n\n**Followup Question:**\nNow Suppose the House doors are randomly closed and open initialliy and you are standing at one random house. you have given a `max` number, the `total_number_of_houses <= max`. now how will you count the total number of houses\n\n\n**Full Interview Experience Here**\nhttps://leetcode.com/discuss/interview-experience/2072074/google-software-engineer-l3-banglore-may-2022-reject\n

Problem Statement:\n\nThere are some house in a cicular street. something like in the below picture\n\n\n\n\neach house is connected to its neighbours, on each 