Скачать с ютуб Subarray Sums Divisible by K | Brute Force | Optimal | Easy Explanation | codestorywithMIK в хорошем качестве

Subarray Sums Divisible by K | Brute Force | Optimal | Easy Explanation | codestorywithMIK

This is our 34th Video on our Array Playlist. In this video we will try to solve a very popular and good Qn "Subarray Sums Divisible by K" (Leetcode-974). We will do live coding after explanation and see if we are able to pass all the test cases. Problem Name : Subarray Sums Divisible by K Company Tags : Microsoft, Amazon, Paytm My solutions on Github : https://github.com/MAZHARMIK/Intervie... Leetcode Link : https://leetcode.com/problems/subarra... My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Intervie... Subscribe to my channel :    / @codestorywithmik   ╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗ ║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣ ╠╗║╚╝║║╠╗║╚╣║║║║║═╣ ╚═╩══╩═╩═╩═╩╝╚╩═╩═╝ 0:00 - Intro and Understanding Qn 2:24 - Brute Force - Approach-1 4:59 - Brute Force - Approach-2 (Cumulative Sum) 9:46 - Live Coding Approach-2 12:04 - Optimal Approach (% baba ki jayyy) 33:16 - Live Coding Optimal #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips #interviewpreparation #interview_ds_algo #hinglish