#include
#include<unordered_set>
using namespace std ;
bool sumzero(int a[],int n){
int pre = 0 ;
unordered_set s ;
for(int i = 0 ;i < n ;i++){
pre += a[i] ;
if(pre == 0 or s.find(pre) != s.end()){
return true ;
}
s.insert(pre) ;
}
return false ;
}
int main(){
int n ;
int a[n] ;
cin >> n ;
for(int i = 0 ;i < n;i++){
cin >> a[i] ;
}
if(sumzero(a,n)) {
cout << “true” ;
}
else{
cout << “false” ;
}
return 0 ;
}
@guptarahul3100 first input n then assign it to array otherwise array of garbage size
hope its cleared if yes dont forget to mark doubt resolved 
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.