Increment base-36 strings This is a code golf version of a similar question I asked on stack earlier but thought it'd be an interesting puzzle.
Given a string of length 10 which represents a base 36 number, increment it by one and return the resulting string.
This means the strings will only contain digits from 0 to 9 and letters from a to z.
Base 36 works as follows:
The right most digit is incremented, first by using 0 to 9

0000000000 &gt; 9 iterations &gt; 0000000009

and after that a to z is used:

000000000a &gt; 25 iterations &gt; 000000000z

If z needs to be incremented it loops back to zero and the digit to its left is incremented:

000000010

Further rules:

You may use upper case or lower case letters.
You may not drop leading zeros. Both input and output are strings of length 10.
You do not need to handle zzzzzzzzzz as input.

Test Cases:
&quot;0000000000&quot; -&gt; &quot;0000000001&quot;
&quot;0000000009&quot; -&gt; &quot;000000000a&quot;
&quot;000000000z&quot; -&gt; &quot;0000000010&quot;
&quot;123456zzzz&quot; -&gt; &quot;1234570000&quot;
&quot;00codegolf&quot; -&gt; &quot;00codegolg&quot;
Japt, 13 bytes

n36 Ä s36 ù0A


Try it online! and Verify test cases

Takes input as a string

Explanation

n36            converts input to base 36
    Ä           +1
      s36       to base 36 string
          ù0A   left-pad with 0 to length 10