Maximum sum subarray :

public int subarraysDivByK(int[] nums, int K) {

if(nums==null || nums.length==0) return 0;

int ans=0;

int remSum=0;

HashMap<Integer,Integer> map=new HashMap<>();

map.put(0,1); //Freq of 0 as remainder is 1

for(int i=0;i<nums.length;i++){

remSum+=nums[i];

int temp=remSum%K;

if(temp<0) temp+=K;

if(map.containsKey(temp)){

ans+=map.get(temp);

map.put(temp,map.getOrDefault(temp,0)+1);

return ans;