So we had an Interview Question at Codenation, This is the question [Image linkQuestion Image](/predownloaded/32/9a/329aaaae254e740829958075c76938080e8ad99a.jp2f/c0/2fc02228f50de5a1e49400cb686829a3ac58e607.png). I understand that we can do the update node and sum of values through segment trees but what I can't understand is how to find the aith beautiful number, can someone help me out please!↵
Also the constraints of X in the question are below 10^5
Also the constraints of X in the question are below 10^5