i see the way you arranged the companies to almost spell out faapng! 😂😂

this oneliner is not my solutiion, but works like a charm: return matrix and [*matrix.pop(0)] + self.spiralOrder([*zip(*matrix)][::-1])

Master dynamic programming and all data structures and algorithms for FREE at AlgoMap.io :)

1st

Nicely explained

Use Counter class for shortcut. Then find min of single letters ('b', 'a', 'n') and double letters ('l', 'o'). Return min of single, double //2 if single and double is not zero, else return zero.

Java

Thank you for your explanation. I love how you explain the theory, but I expected more about the coding section. I hope something from scratch to understand the theory. Anw, thank you so much

Love u content

Not as bad as u think is a massive understatement

Hi Greg

Yeah but why does it matter

The interpreter cannot find the definition for the class Solution when it is being instantiated. Smart but you did it deliberately for the content. Nice touch

Memoization or tabulation

A tree is a graph such that removal of any of its edges leaves it disconnected. Equivalently, it is an acyclic graph. Trees do not need to be rooted.

What about java springboot?

LRU Cache, hold my beer.

great video but please by a tablet and a pen, the writing is quite hard to understand, thanks

I don't understand; when you arrange the array in a heap, you are already iterating over the array once. Why can't I just track two max's and the second highest max is the solution?

I see, this resembles bottom-up approach, great explanation!

Bros actually the GOAT! explains things in a different way fr

BFS: Then push onto the queue, the node and time. For each neighbour add it to the queue with minute+1 and take the max time for any branch (since they are all occurring simulatenously)

Use lru cache bro

Java is best

why are you uploading the same video twice?

Just use matrix transformation and binpow

Isnt that super memory inefficient? Like i know the goal is speed, but if the user inputs 10,000 youre gonna use up a huge chunk of memory for a sec.

Why would you use a list of you only need the previous 2

Master Dynamic Programming and all Data Structures and Algorithms for FREE at AlgoMap.io!

These videos are great, can you do one for Combination Sum II?

🎉❤

Whats it real life application? Why do we need to know this?

Appreciate the detailed breakdown! I need some advice: I have a SafePal wallet with USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). Could you explain how to move them to Binance?

As a C++ dev: ain't no way it is an A tier interview language, there's so many strange bits to remember that would be a nightmare in a tense situation like an interview, and error messages that's designed to make you cry. It's a decent language for take homes, as it can do anything well, but I'd loathe programming in it in a high stress situation without the ability to google.

Why is php bad? What is it used for

That was a lot more steps than just moving them all in a circle.

just spent 4 hours trying to reverse a doubly linked list and this pops up smh

Python programmers: python is goat Javascript programmers: js is goat C and Assembly: every language from us, we are the goats Computers: chill guys we just understand 1s and 0s

The best way to do it is to know that no-one uses linked lists in production code. Use a deque and you're done.

Hi Greg, I think this algo is for finding all subsequences instead of subsets! Kindly revert me if I'm wrong!

Thanks!

???? The "Senior" solution is not even faster. In fact, it's like two times slower, mostly because of the constant factor of list of 26 elements.

Hey! I have a better solution to implement. Instead of heap push and heappushpop(), we can just use heapify method from beginning onwards and iterate through the array (n - k) times. heapq.heapify(nums) while len(nums) > k: heapq.heappop(nums) return nums[0]

Did not watch the vid fully, my guess is N = the number you would like to know While true( If i(the thing that says squared forgot the short thing, like ==,<?) < n: I==I+1 Else if i(same as before) == n: Print("your number is an square root of" I) Else: Print("your number isnt an square root of an natural number") )