Відео

Kindly zoom in while you are writing the code

Man. This is brilliant. I found it better than neetcode 🎉

This is very inefficient. There are cases where it will fail.

Did I just get pranked? There was literally nothing difficult about that. Was expecting some weird twist. Was it hard because you had to write all the uppercase and lowercase letters? 😂

ya, when you smoke regex in your crack pipe, and ask prospects this question, quit. It makes sense from an AI language analysis angle, but "is", "to", "it", "we", "he". The very premise behind the question is a koan, asking you for your method for no reason other than exhibition. Gotta ask my future employer to get real.

Hii Greg thanks a lot for this awesome video could you please make same content for HDBSCAN please

Forgive me if it’s flown over my head but isn’t there a fallacy in this algorithm? If you have [2,2,1,1,1,2,2,3,3,3] would the candidate not return as 3 even though 2 is the clear majority? So 1,2,1,0,1,0,1,0,1,2 where the final 2 is from the 3s. Maybe I’m just confused.

This is how I learned stacks in college

Yes 🙌 Please don’t feel guilty about looking at the solution.

Yes I also waiting for machine learning

Will you do some machine learning videos again as well :) ?

You missed the most important part which is it has to be sorted 😅

What is considered as DP here!?

GOAT ❤

Why did you make max_distance and prev a list?

Also, if a hash table gets too full (ie passes its load balance), then a new larger table is created which takes O(n) time. But this happens very infrequently. This is similar to how dynamic arrays resize. So insertion is also amortized O(1) time.

This doesn’t seem O(n) to me, I can imagine the worst case to be when the whole list is a sequence. Then this script would check i numbers for every number in the list. This would give us n(n-1)/2 operations, which is O(n^2). The best case, aka no sequences in the list, would be linear, because you’re only checking once per element.

Excellent explanation. Thanks!! Very helpful

If this is noob level , then i don't know what level i am 💀

Repeat the same question you’ve already done in a different language - even better!

I use Paint, brother. There is an another tip that works for me: If the solution is in the standart library, use it! There are always tricky moments in the question desctiptions or solutions, that u can ignore or miss, so for the first, I literally SOLVE the question, and THEN try to do it WITHOUT standart library functions to be sure, that I really got it. For example: Search Insert Position and single number. - They are solved in a single line of code using STD functions, so firstly I do it. Then I write solution by myself. It makes you good in STD knowledge and you can consentrate on really important parts of a question.

I think I am dumb. I did not understand what he did.

I have a serious doubt I can only solve all questions on python language, is that okay.. does interviews allow me to use language of my choice?

Kabhi kabhi lagta h, ki coding karte karte kahi me bhi iske jaisa na ho jau😢😢

it still works if there are more than 2 candidates?

its probablistically almost always o(1) with proper hashing and load factor calculation, you should cover the equation to derive this

yea the comments are are a bum but they arent wrong sometimes lol

abap?

Solved the same question like 3 hours ago lol

I just finished watching Lec 5 of CS50 course in which they talk about hash tables. And mins later I see this, How TF did yt know ?😰

Subscribe to the channel to get these in your feed everyday!

Real life work: first thing to do is checking is there is a library/package that already does it.

Log(2)base N ??

Just solved this yesterday and now this video comes in my feed

Sorry I might be dumb or not understanding the question but why don't you look at the smallest value of all intervals and the biggest one to create the lower and upper bound of the interval asked?

🟤🟢🔵🟣⚪️⚫️

Those are rookie number in this racket You need to solve atleast 500

And I have solved 1096

Big words, no listen

Latterly you are telling me what I need to hear 😂❤

What’s a RL agent policy function for the same??

Dont see why thats a big deal just look at your code and think lol