Problem Description

Given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order.

You must write an algorithm that runs in O(n) time and uses O(1) extra space.

Problem: https://leetcode.com/problems/lexicog...
Code link: https://k5kc.com/cs/algorithms/lexico...