ZERO SUM SUBARAAYS PROBLEM | HASHMAP | ARRAY | DATA STRUCTURE | PLACEMENT | INTERVIEW | HINDI смотреть онлайн

Question explanation : 0.0
Hashmap explaination :1.36
Code explaination : 4.16
Graph plot explaination : 6.08

GFG PRACTICE LINK : https://practice.geeksforgeeks.org/problems/zero-sum-subarrays/0

MY TELEGRAM LINK : t.me/Coding_Door

Max area of island : https://youtu.be/8Q5RVc1yUsw
Look and say sequence : https://youtu.be/aK-sfjSyv7c
Fractional knapsack : https://youtu.be/lhVTJIIh2mo
combination sum II : https://youtu.be/xn1tj7VUu4Y
Rotate 2D array without using extra space : https://youtu.be/zDsqWPAaqP0
Preorder to Postorder problem : https://youtu.be/TlmZOZwV8dg
MINIMUM PLATFORMS REQUIRED ON RAILWAY STATION : https://youtu.be/Mhg6XvaFyfE
SPIRALLY TRAVERSING A MATRIX : https://youtu.be/cn-UFGTfJ7w
ZERO SUM SUBARAAYS PROBLEM : https://youtu.be/GKtHdy941oM
Clone a Linked List with next & random pointer : https://youtu.be/Z628U42aoO0
MINIMUM SWAPS REQUIRED TO SORT AN ARRAY IN HINDI : https://youtu.be/4aWvCk1dpqo
Knight Walk Problem : https://youtu.be/tVHB7HC7L5w

A better approach is to use Hashing.

Do following for each element in the array

Maintain sum of elements encountered so far in a variable (say sum).
If current sum is 0, we found a subarray starting from index 0 and ending at index current index
Check if current sum exists in the hash table or not.
If current sum already exists in the hash table then it indicates that this sum was the sum of some sub-array elements arr[0]…arr[i] and now the same sum is obtained for the current sub-array arr[0]…arr[j] which means that the sum of the sub-array arr[i+1]…arr[j] must be 0.
Insert current sum into the hash table

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(N).

#zero sum subarrays
#hashmap
#array
#placement
#interview
#hindi
#gfg
#leetcode