974. Subarray Sums Divisible by K - Day 19/31 Leetcode January Challenge

preview_player
Показать описание
Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!

#leetcode #coding #programming
Рекомендации по теме
Комментарии
Автор

Were you able to walk around the subarrays?

Algorithmist
Автор

Was asked an interesting follow up question to this is in an interview. Return the number of non-empty subarrays that have k | sum but length >= m

FarzanHashmi
Автор

Nice video!

Footnote: The modulo operator on python always return the answer with the same sign as the denominator. Which is not true for every language. On Java you must use Math.floorMod(current, k);

AluSoft
Автор

Larry I've been meaning to ask for a long time. I'm not a native speaker. What do you say at the end of the videos? "took your mental health"? Or is it "take care" that winds up in my ears as "took"?😁Or is it something else?

Denol
Автор

To some of you who doesn't know the logic behind this problem and having trouble understand the explanation at the first time like I do, go take a look at Subarray Sum Equals K on Neetcode. It helped me a lot. No offense on this one. This one shows me how an experienced programmer approaches a problem, which inspired me a lot.

bdjsjjs