I was doing the same questions today, and it was on my feed nice.
@arsenypogosov720612 күн бұрын
ans = [1] * len(nums) prod, zero_count = 1, 0 for i in nums: if i != 0: prod *= i else: zero_count += 1 for i in range(len(nums)): ans[i] = 0 if zero_count - (nums[i] == 0) > 0 else prod // (nums[i] if nums[i] != 0 else 1) return ans
@pravinkumarprabakaran374216 күн бұрын
Nice. I solved it in a different way
@kamiloweluckypanczoweblend195725 күн бұрын
nice
@divyaakula60526 күн бұрын
your approach is genius! opened a new perspective for me. thanks so much for sharing!
27 күн бұрын
Hello! try to improve the sound, it's very hard to hear you.
@theycallmesir1Ай бұрын
Where would you say is the best place to learn about data structures like this (I've never heard of a trie structure before)
@user-wm4bl8yo8oАй бұрын
Thank you keep doing
@nikhilyadav65822 ай бұрын
I like how you're targetting all coding platforms, just sort them in a playlist too for the ease of it 👍🏻
@GuilhermeNunes-ss6hk2 ай бұрын
Thanks for the explanation. I've got stuck with this * k operation
@nandomax33 ай бұрын
That's the worst hackerrank exercise i ever did. Zero coding, zero algorithm. This shiuldnt be in hacker rank