K-th Smallest in Lexicographical Order - Leetcode 440 - Python

[@studyaccount794]

Please don't stop doing daily problems. Your videos are the only one that make sense.

[@7Idiots-w2i]

+1

[@FizzaAhmad-up8ns]

Yeah his vedios make my habit to solve the daily problem.

[@patilrajesh2500]

+1

[@erick_ftw]

+1

[@hen56349]

Especially, the Hard problems.

[@satyamjha68]

A tough one! Unable to solve this on my own. Thanks for the solution!

[@akash-kumar737]

RIP to candidates who get these question and expected to come up with optimized solution 😢😢😢.

[@marcoaraujo9446]

When I was trying to solve this problem, I got the part that I needed to skip a path before starting to do the DFS. However, it's very complicated to get how many elements will be on a given path :(

[@muditkalra7077]

He still made a little intuitive to figure out... But this questions is too hard honestly!

[@blipbloping]

my glorious king neetcode

[@mcbotface]

Hey you were right.
I get memory limit exceeded for today's POTD.
return sorted([i for i in range(1,n+1)], key=lambda x:str(x))[k-1]

[@DevoteeInCorporate]

bro n is 10^9 😶‍🌫

[@mcbotface]

@@DevoteeInCorporate I am getting TLE for yesterday's neetcode solution.

[@anonymoususer9053]

that's why he gave a better solution

[@mcbotface]

@@anonymoususer9053 I mean even O(n) is not accepted?

[@onlywrestling7810]

@@mcbotface that's why the problem is hard.

[@baetz2]

Nice video, but each time you say "long story short" I get lost lol. I'm sitting with a piece of paper and drawing trees now trying to get it.

[@vio_tio12]

love your work! Helps us on our journey!

[@krishnapranav1892]

Sir, I really like your videos a lot. They are really helpful. But Please discuss the weekly leetcode contest solutions also sir.

[@ArminEghdamiDrums]

Honestly, if you have never seen this problem before and are in an interview setting, who would figure this out??

[@prakhar4585]

Difficult to understand.

[@gojou1621]

Love you , Thanks for doing this daily

[@EduarteBDO]

I feel like I'll never be smart enough to solve this kind of problem

[@dashdoom8452]

This is for sure one of the harder problems I have seen IMO, and I have done a lot of problems. The implementation is very easy but the ideas are quite tricky

[@keshavagrawal4546]

People doing in java in the helper function make res,nei and cur to long and do (int) to return int

[@jamesisaacson6414]

Could you please do 373. Find K Pairs with Smallest Sums? Didn't find any intuitive explanations anywhere else.

[@prashik4810]

Nice explanation, Loved it.

[@business_central]

Thank you for saving us

[@sahil-xz9en]

bro I am lost

[@jayjw1]

same.. this problem is one of the hardest ive seen tbh

[@studyaccount794]

13:50. WOn't that be 1100 instead of 1110?

[@vanshraj4724]

was waiting for this only

[@catwithlegz]

Could you potentially make a video on leetcode 835?

[@prasunroy2802]

Thank you

[@karolszymanowski518]

I get it but also I don't :/

[@kaiserandvlad]

You cant use yesterdays code cuz of time limit exceeded

[@buituan2909]

bye streak, this shit is too complicated.

[@Aanand-dd1kj]

Op🎉

[@DassVeryGood]

If I get asked this I’m definitely cooked

[@KishoreKumar-011]

Great Explanation, kindly use the given example for explaining the problems. Helps in better understanding.

[@7Idiots-w2i]

+1

[@kohaigun-de]

@@7Idiots-w2i Given examples frequently too trivial to properly illustrate the algorithm.

[@7Idiots-w2i]

@@kohaigun-de baga chepparu

[@adityamwagh]

What’s your LeetCode username?

[@professorpoke]

Neetcode

[@Piyush-ni5ek]

singhnav314

[@notbalding]

singhnav314