#include <bits/stdc++.h> using namespace std; void findfactors(int n) { unordered_map<int, int> mpp; vector<int> v, v1; for (int i = 1; i <= sqrt(n); i++) { if (n % i == 0) { v.push_back(i); if (i != (n / i) && i != 1) v.push_back(n / i); } } […]

You are here: Home / Archives for Find the largest subarray with 0 sum