Lexicographical Numbers | Leetcode 386

This problem explains generating lexicographically ordered numbers from 1 to N using most optimal recursion approach.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
---------------------------------------------------------------------------------------------------------------------------------------------------------------

[niketandoddamani]

Perfect ! to the point thanks for the code walk through and the recursion tree

[rishabh._.raj]

Recursion will take stack space, this isn't an O(1) solution