Defuse the Bomb - Leetcode 1652 - Python

[@NeetCodeIO]

I will be taking a break soon (this year). For now, will try to keep going as long as I can. A lot of these I already recorded last week - see the date at 13:50

[@AdityaSingh-nn2cd]

How can you pre record daily question?

[@tchsu1140]

gogo

[@togbot3984]

Don't push yourself too hard! It's essential to prioritize your health over everything else. Remember, taking breaks and resting is a sign of self-care and you of all people deserve it the most.

[@NeetCodeIO]

LC usually posts an editorial for problems that will soon be daily problems. You can see it on the homepage feed when youre signed in.

[@oldmajor5240]

Wow! Is that only transparent to premium users? Btw I love your videos! Make sure to not overwork yourself please!

[@Kaung1999]

King I thought you were taking a break. It’s good to see you make another vid

[@floriankubiak7313]

He will not forsake us! (albeit this one was really easy)

[@yhbarve]

Damn. He's back already 😂

[@hongjieqiu1799]

Here is an alternative solution that only compares the window size against k once, might be more intuitive for some. Hope it helps! class Solution: def decrypt(self, code: List[int], k: int) -> List[int]: n = len(code) res = [0] * n if k == 0: return res l = 0 curr_sum = 0 for r in range(n + abs(k)): curr_sum += code[r % n] if r - l + 1 == abs(k): if k > 0: res[(l - 1) % n] = curr_sum else: res[(r + 1) % n] = curr_sum curr_sum -= code[l % n] l = (l + 1) % n return res

[@ben94_]

The bomb blew up my confidence

[@TheRewindRoom]

😂

[@HariPrasad-d2d]

Thanks for doing it again😊

[@hargovind2776]

Glad to find this! Thanks

[@alexeytsar]

great explanations, thanks a lot

[@business_central]

good to see you back so fast! Yaaaay!

[@vivekmahajan5709]

loved to see you❤

[@hoyinli7462]

gd to see ur next leetcode video!

[@leeroymlg4692]

this problem should be a medium problem

[@Aaron-cp9tt]

bro, you are a legend

[@apoorvsharma6932]

Thanks

[@devmahad]

thanks :)

[@tommasocerruti998]

🐐

[@iamheroboss1655]

It's may be circular queue method

[@priyanshkashyap-nz5lx]

Thanks for defusing the bomb

[@shahzodshafizod]

We said goodbye to you yesterday

[@arjunc1482]

Ur back!!

[@antm9957]

🤝

[@dusvn1484]

Bro it’s 2:28 am in Europe and I’m jumping from my bed to solve problem when I see you upload every day.Your consistent give me motivation love you neet ❤

[@drain1635]

Goat

[@ajaymishra1511]

My solution before watching video ```js function defuse(code:number[], k:number):number[]{ const res = []; let n = code.length; let sum = new Array(code.length).fill(0); for(let i = 0; i < code.length; i++){ sum[i] = (sum[i - 1] ?? 0) + code[i]; } for(let i = 0; i < code.length; i++){ let sumUpTo = i + k res[i] = sumUpTo >= n ? sum[n - 1] - sum[i] + sum[sumUpTo % n] : sum[sumUpTo] - sum[i]; } return res; } function decrypt(code: number[], k: number): number[] { if(k > 0){ return defuse(code, k); } else if(k < 0){ return defuse(code.reverse(), Math.abs(k)).reverse(); } return new Array(code.length).fill(0); }; ````