Longest Sub-Array with Sum K

package org.ms.ds.hashing;

import java.util.HashMap;
import java.util.Map;

class FindMaximumLengthSubArrayHavingGivenSum
{
    public static void maxLengthSubArray(int[] A, int K)
    {
        Map<Integer, Integer> map = new HashMap<>();
        map.put(0, -1);
        int sum = 0;
        int maxLen = 0;
        int ending_index = -1;
        for (int i = 0; i < A.length; i++)
        {
            sum = sum + A[i];
            map.putIfAbsent(sum, i);
            if (map.containsKey(sum - K) )
            {
                if(i-map.get(sum-K) > maxLen) {
                    maxLen = i - map.get(sum - K);
                    ending_index = i;
                }
            }
        }

        // print the max length
        System.out.println("Array with max length for given sum is "+ maxLen);
        // print the sub-array
        System.out.println("[" + (ending_index - maxLen + 1) + ", " + ending_index + "]");
    }

    public static void main (String[] args)
    {
        int[] A = { 5, 6, -5, 5, 3, 5, 3, -2, 0 };
        int sum = 8;

        maxLengthSubArray(A, sum);
    }
}