#Leetcode
Here is the solution to "Plus one " leetcode question. Hope that you will like the way I have explained the solution.
You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.
Increment the large integer by one and return the resulting array of digits.
******* Table of content *******
00:00 Understanding the problem statement
02:08 understanding problem with an example
04:51 Algo
08:08 find time and space complexity of the algo
08:44 Final code in Golang
10:18 Thank you
Facebook Coding Interview question,
google coding interview question,
leetcode,
Plus One,
Plus One Golang
Plus One solution,
66. Plus One,
#leetcode #leetcodesolution #Amazon #Facebook #CodingInterview #LeetCode ##Google #66 #golang #go #amzon #facebook #google #plusone