Python Stack Easy (self explanatory)
```\nclass BrowserHistory:\n    def init(self, homepage: str):\n        self.stack = [homepage]\n        self.curr = 0\n\n    def visit(self, url: str) -> None:
```\nclass BrowserHistory:\n    def __init__(self, homepage: str):\n        self.stack = [homepage]\n        self.curr = 0\n\n    def visit(self, url: str) -> None:\n        while len(self.stack) > self.curr+1:\n            self.stack.pop()\n        self.stack.append(url)\n        self.curr = len(self.stack) - 1\n        \n    def back(self, steps: int) -> str:\n        self.curr = max(0, self.curr - steps)\n        return self.stack[self.curr]\n\n    def forward(self, steps: int) -> str:\n \xA0 \xA0 \xA0 \xA0self.curr = min(self.curr + steps, len(self.stack) - 1)\n\t\treturn self.stack[self.curr]\n
['Stack', 'Python3']