วีดีโอ

Thank you for the explanation.

Very simple solution. Thank you.

Thank you Carter. I forget that the .add method of ArrayList has another paremeter index to insert into specific location, that is my pain point. Again, thank you Carter !

Nice solution! All the other solutions were too complicated, but this was easy to understand. I optimized it to run at 0ms and consume less memory. class Solution(object): def reorderLogFiles(self, logs): letter_log, digit_log = [], [] for i, log in enumerate(logs): if log.split()[1].isdigit(): digit_log.append(log) else: values = log.split(" ") letter_log.append([' '.join(values[1:]), values[0], i]) result = [] for log in sorted(letter_log): result.append(logs[log[2]]) return result + digit_log

this solution helps to understand backtracking, but doesn't use the 0/1 knapsack methodology fyi

Thanks a lot bro!

class Solution { public int romanToInt(String s) { int num = 0; String[] roman = {"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"}; int[] number = {1000,900,500,400,100,90,50,40,10,9,5,4,1}; for(int i=0; i<roman.length;i++) { int cur = number[s.charAt(i)]; int next = number[s.charAt(i+1)]; if(cur < next) { num = num+(next - cur); } else{ num = num + cur; } } return num; } } what is wrong with this code

In the book 10 is on the 4th position, that's why was looking whether this is correct or not

Thank you for explanation! You are great teacher

Great solution, exactly what I came up with. Better than some of the more popular videos out there.

Best solution

hey, this is insanely well made, thank you so much ❤

thanks!! helped me understand the daily problem for today :)

The time complexity is 2^n is it not?

Nice solution in problem 76, mate))

Great explanation. Keep doing this work

Thanks a lot. :)

I understand the logic of storing efficiently in the init function. What I struggle with is understanding at what point will v1 and v2 be used. Is self.hm containing the values for v1 and vec.hm containing the values for v2?

heavily underrated video

didn't understand the explanation

clear and creative, respect +

why is the bottom-up approach called a "true DP"? Is it because you are starting from smaller problem and building it up to the end result? If so, doesn't top-down, in principal, do the same thing by reaching the base case then unwinding the recursive stack from there?

Crazy clean solution - would love to see the recursive proof behind this

I mean, wont it grab the 8 since you are using num % 10, and not 3? And when you divide with 10, it wont take away 3, it will take away 8:)

This one was a fun problem!

The problem becomes clear once you realize computing the actual product is irrelevant.

This is the 3rd video I watched. Simplest explanation, I think.

Hmm, I kinda miss the point where you explain why the reset actually works.. Does it require to have a certain amount of items or does the cycle needs to have a certain length? Cause I read that it doesnt matter where the pointers meet initially, resetting will always make sure you get the start. But thats complete nonsense right? Cause if i have a list 1-2-3-4-5-6 and a cycle 456 with 6 pointing to 4, thats mathematically not possible, right?

I came here from Cracking the Interview because I was stumped by problem 4.3 which is this same problem, nice explanation!

Please provide the create & insert statement for every question you practice on leetcode. Provide questions in your github account.

Thanks, you really simplified the problem

Can't we deduce the whitespace_count by subtracting charr_array.length - actual_length?

Sorry But what is the point of leetcode or exercising if you still use some library which abstract the solution?

it seemed like a monotonic stack worked from right to left -- was really hoping it would also work from left to right

I cant thank you enough I was literally looking for someone to explain why we are using inclusion and exclusion!!!!!!! damn. I was using the initial intuition approach that you should was wrong and it was counting multiple times. And i was tryna use sets but that would be real inefficient. I still might have to understand it more, to really hit the spot but It was a really nice ice breaker. Basically I was thinking to prove how the code prevents {1,2,3} and {3,2,1} !

Hi, I am a beginner in sql, just started learning and side by side solving problems, I understood till half I kept myself stick to the concepts you were delivering, then at some point I lost, is it normal or it means I still need to study sql a lot?

Hello....can you please provide us the all pattern playlist....like two pointers, backtracking, dp , graphs , trees , sliding window and so on ...

Very good solution.

Please finish all blind 75 plsssss! Your video is so well explained! It's the best resource to learn using python to leetcode

My solution goes like that: for key in hash_map: key_end = key start = 0 While key_end <= len(hash_map[key]): res2 = [] for i in range(start_end, key_end): res_2.append(hash_map[key][i]) start = key_end key_end += key res.append(res2)

Hey Carter, Thanks

Love the blind 75 collection videos, I do leetcode a lot faster when I do it with you!

Thanks Man . Best solution video on yt by far for this question. 😄

FYI - the code used is not directed towards the most efficient time and space complexity, it's more so to understand the data structures in Python and the methods/functions applied on top of it. If you really want the time space complexity, refer to the original NeetCode videos. Thank you Carter, the videos are a good way of refresher for DE interviews

you made this problem look so easy 😲

thank you kind sir

thank you from Egypt you are great

wow!!!!!!!!!!! thankyouu!!!

Good

what tool do you use to write on the screen? I could really use that tool to help me organize my thoughts