Just had my phone screen for Google L4 position. Question was [818: Race Car](https://leetcode.com/problems/race-car) framed as two questions\n\na. If given a race car string, convert it to the numeric position\nb. (actual race car problem) Given a numeric position, return a race car string\n\nFor b, the question was not to return the shortest possible string but just, return a valid string (reasonable length). For b I gave a greedy approach with correct code however, the final question was how could it be done to always return the shortest possible string. I was able to say that we would build an empty string out and go down an \'A\' or \'R\' branch at each character until reaching the target but didn\'t get time to code it out. First two parts were correct with correct code though.\n\nThoughts on if I\'ll move on? Seems pretty 50/50 to me/leaning towards no :(

Just had my phone screen for Google L4 position. Question was 818: Race Car framed as two questions\n\na. If given a race car string, convert it to the numeric 