A Simple😉 beginner friendly😊 Repo for all programmers and coders. All contributors are requested to star🌟this repo and and folllllow me. Contribute to start your journey with hacktoberfest. Happy Hacking💻!!!
Q. 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.
Q. 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.
Please assign me this issue.