Array given we need to return all possible subarrays with sum equal to k

Question

Answer · Accepted Answer

psvm(String[] args){
int arr[] = {10,-10,5,8};
int sum= 20;
int len = arr.length;
Syso(checkSubArray(arr,sum,len));

int checkSubArray(int []arr, int sum, int len){
Map hm = new HM();
int currsum=0; res=0;
for(int i=0; i

Sigiloso · Answer

Mainten 2 pointers start and regular iterator i. Add the element at i to sum variable. If sum greater then required k remove a[start], increment the start. If equal store that start and i in a map. If less keep adding next element.

Smarsh

Pergunta de entrevista da empresa Smarsh

Respostas da entrevista

Empresas seguidas

Buscas de vagas