✔| 100% fast Solution in Golang | detailed video explanation | O(n)
I have created a detailed video to explain the logic and the code for this problem you can have a look at it incase you want better understanding on how I came 
I have created a detailed video to explain the logic and the code for this problem you can have a look at it incase you want better understanding on how I came up with the approch\n[Plus One| O(n) Solution by The Exception Handler](https://www.youtube.com/watch?v=mrYywKoIq-E&list=PL8-bdB4cHmXzuGvBnFmByq-4yyAy-ceaK&index=3)\n\n```\nfunc plusOne(digits []int) []int {\n    \n\tn := len(digits)\n\tfor i := n - 1; i >= 0; i-- {\n\t\tif digits[i] < 9 {\n\t\t\tdigits[i]++\n\t\t\treturn digits\n\t\t}\n\t\tdigits[i] = 0\n\n\t}\n\tdigits = append([]int{1}, digits...)\n\treturn digits\n}\n```\n\nPlease upvote this solution in case you like the explaniation
['Go']