Longest Sub-Array with Sum K

function maxLengthArray(arr,k){

let maxLength=0

for(let i=0; i<arr.length;i++){
let currentSum=arr[i]
let counter=1

for(let j=i+1; j<arr.length;j++){
  
currentSum+=arr[j]
counter++

if(currentSum=== k){

  maxLength = Math.max(maxLength,counter)

}
}
if(arr[i]=== k){
  maxLength = Math.max(maxLength,1)
}

}

return maxLength

}

console.log(maxLengthArray([13,7,6,0,13],13));