Daily Leetcode Challenge | NOV 18 | HINDI | Defuse the Bomb

[@darshankumar5546]

if you solved this question easily, try this question: kzbin.info/www/bejne/p4G5lYdojJuSqKM

[@darshankumar5546]

ENGLISH explanation: kzbin.info/www/bejne/jmWUqGV4bt6rldUsi=Zv7LJ2kXLv3ZEKgp

[@darshankumar5546]

class Solution: def decrypt(self, code: List[int], k: int) -> List[int]: n=len(code) if(k==0): return [0]*n modifiedNums=[] kk=k if(k0): ans.append(prefixSum[i+k+k]-prefixSum[i+k]) else: if(i==0): ans.append(prefixSum[i+kk-1]) else: ans.append(prefixSum[i+kk-1]-prefixSum[i+kk-1-kk]) return ans # code= [5,7,1,4] k=3 # [7, 1, 4, 5, 7, 1, 4, 5, 7, 1] # [7, 8, 12, 17, 24, 25, 29, 34, 41, 42]