ye aap kon se board par padhate ho please can you share some details kyoki ye wala marker mere ko milta hi nahi maine bahut sare online board use kar liye please share some details related to software components nad hardware also. jisase padha sake online
@@sumeetsamsam Absolutely buddy, I know that sort take n log n , but still this answer got accepted and beats 90%? I thought it would not be accepted! 😕
perfect bro
Thank you ❤️❤️
Absolutely the Best Explanation, Bro! 🔥
acha explain kiya hai , bus ek bar dry run kar te toh aur acha
ye aap kon se board par padhate ho please can you share some details kyoki ye wala marker mere ko milta hi nahi maine bahut sare online board use kar liye please share some details related to software components nad hardware also. jisase padha sake online
App name - Goodnotes
def lexicalOrder(self, n: int) -> List[int]:
return list(map(int, sorted(list(map(str, range(1, n+1))))))
bro is this approach valid??
solve in O(n). sort use n log (n)
@@sumeetsamsam Absolutely buddy, I know that sort take n log n , but still this answer got accepted and beats 90%? I thought it would not be accepted! 😕
Constraints are small so it accepts it.
@@VaibhavNathe-k1w okk ! Thanks bro