@@Codebagel This video hit 26,000 views, 5x more than expected, please you make amazing videos, and welll-defined ones, can you make for other companies as well.
Really nice video! Didn't come in with expectations of any good explanations since the video is 20min but covers 5 medium questions but to my surprise it very well did!
Hello, for the Search Suggestions System don't you think it's better this way: def TypeSearch(products,search_word): final = [] i=0 while(i3): proposed_products.sort() final.append(proposed_products[0:3]) else: final.append(proposed_products) i+=1 print(final) ty for the video btw!
The split method creates an array of strings that were surrounded by whitespace in the initial string. So index[0] actually refers to the entire identifier up to the whitespace. The split method on "test 123 456 789" would make an array of ["test", "123", "456", "789"] He was also sorting from index 1 (which is the first word) until the last index (the last word), not just index 1. Not sure if that's what you meant but I figured I'd clarify
Please continue posting these videos. If possible do separate videos for each type of the algorithm
Thanks, I'd love to! If this video hits 5,000 views I'll make a follow-up to it for some other large companies!
@@Codebagel This video hit 26,000 views, 5x more than expected, please you make amazing videos, and welll-defined ones, can you make for other companies as well.
Really nice video! Didn't come in with expectations of any good explanations since the video is 20min but covers 5 medium questions but to my surprise it very well did!
I didn't know we could custom sort!! Thanks for the video
love the video! very thorough
Hello, for the Search Suggestions System don't you think it's better this way:
def TypeSearch(products,search_word):
final = []
i=0
while(i3):
proposed_products.sort()
final.append(proposed_products[0:3])
else:
final.append(proposed_products)
i+=1
print(final)
ty for the video btw!
Thank you so much!
Are these questions were asked during the OA or during the final interviews?
i think that first one, the pointers should use exclusive gt not inclusive, it reduces redundancy and prevents OOB
I almost went for a trie for the first one
Num Islands could be more optimized just by marking the island was water/visited instead of using a set which is O(N)
keep the good work
Thanks! I’ll do my best!
Keep going bro
Will do, glad you’re enjoying it!
would you say this are intern leval type of question?
My destination 🧡
cant you do the 4th most common question in O(n) using the select algorithm
In the 3rd problem,
You sorted letter logs from index 1, and 0 if their contents are same. But the identifiers aren’t of length 1… right?
The split method creates an array of strings that were surrounded by whitespace in the initial string. So index[0] actually refers to the entire identifier up to the whitespace. The split method on "test 123 456 789" would make an array of ["test", "123", "456", "789"]
He was also sorting from index 1 (which is the first word) until the last index (the last word), not just index 1. Not sure if that's what you meant but I figured I'd clarify
not even one problem related to DP, hmm, highly doubt Amazon won't ask DP questions :)
Are these amazon coding questions fr ??