CS fundamentals and algorithms
Base-36 string addition
You need to add two base-36 strings made of digits and letters without converting them to integers (so no overflow) and return the result as a string. How do you implement the per-digit conversion, carry handling, and leading zero removal?
How would an interviewer hear this answer? You'll see whether they'd move on, dig in, or say no, and which sentences would trip you up. Your score doesn't change.