Java: Find the length of the largest subarray with 0 Sum

Level : Intermediate
Mentor: Shailendra Chauhan
Type : GuidedLab
Points : 10
Duration : 00:25:00

Lab Details

Difficulty Level: MEDIUM

Problem Statement:

You are given an array arr[] of length N, find the length of the longest sub-array with a sum equal to 0.

Input:

arr[] = { 23, -1, 1, -4, 2, 7, 19, 43 };

Output:

Length of the longest 0 sum subarray is 2


Self-paced Membership
  • 22+ Video Courses
  • 800+ Hands-On Labs
  • 400+ Quick Notes
  • 55+ Skill Tests
  • 45+ Interview Q&A Courses
  • 10+ Real-world Projects
  • Career Coaching Sessions
  • Email Support
Upto 60% OFF
Know More
Still have some questions? Let's discuss.
CONTACT US
Accept cookies & close this