A common interview question is to write
parseInt along with implementing it using basic ascii math.
[00:01] A common interview question is to write a function that takes a string, parses it, and returns its integer value. For example, the string 123 to its integer value 123. We start by creating our atoi function that takes a string and returns a number.
[00:40] When it encounters a character that is not numeral, it ignores it and all succeeding characters. It still returns a integer value parsed up to that point so far -123 extra, we'll still get -123. You can use this fact to easily ignore decimal positions as demonstrated in this example.
[01:03] Finally, if the string does not start with the decimal numeral, it returns NaN. That is, "Not a Number." If you go ahead and run the example, the output matches our expectations. Note that you can customize the behavior of parseInt quite easily by wrapping it in a function.
[01:23] For example, parseInt silently ignoring invalid trading characters can be considered a behavior you want to change. You can easily implement a more [inaudible] purpose function with a simple regex test that only allows strings containing things that we support.
[01:40] For example, a waiting sign followed by any number of decimal digits. In all other cases, it will return NaN. Now, all imperfect inputs to a function will return NaN, and we getting verify by running our example.
[02:21] First, we note down the corrective point for zero. This will allow us to convert each decimal digit from a string to its number value. The next thing we need to do is to parse out the sign. We can store this in the sign multiplier.
[02:39] Next, we create an accumulator for the integer result of parsing the digits. We go through the string left to right. At each point, we update the accumulator as the sum of the current accumulator multiplied by 10, and the number value of the current character which we get from its distance from the zero code.
[03:00] Finally, we return the accumulator multiplied by the sign. If you run through the example with binary inputs, you see that it works as expected. This answer shows your understanding of basic math, like the fact that digits represent powers of 10. This solution also shows an understanding of the fact that string digits represent code points that can be [inaudible] to get their integer representation.
[03:29] The interviewer might additionally ask you about things that can go wrong in this implementation. A good one worth mentioning is that we are assuming that the string only has valid digits. They might then ask you to fix that issue, and you can simply check the result of this difference to be in the range zero to nine.
Hey Basarat! First of all Congrats, you are probably the best programmer i've seen in my life, Not just the vids but your documentation on ts is really something out of this world and it was in fact a reason for me to subscribe to egghead to see all your contents. For everyone looking for this code at github is saved as atoi.