Find subarray with given sum 

Input: arr[] = {1, 4, 20, 3, 10, 5}, sum = 33
Ouptut: Sum found between indexes 2 and 4

Input: arr[] = {10, 2, -2, -20, 10}, sum = -10
Ouptut: Sum found between indexes 0 to 3

Input: arr[] = {-10, 0, 2, -2, -20, 10}, sum = 20
Ouptut: No subarray with given sum exists

 Naive Solution:

    We pick elements one by one in outer loop and find its sum with other elements to its right till we get the given sum.
Code:

 import java.util.*;

 public class Solution {

     
    public static void main(String[] args) {
       
        int[] a = {10, 2, -2, -20, 10};
        int n = a.length;
        int sum = -10, currsum = 0;
        int index1 = -1, index2 = -1;
        
        for(int i=0; i<n; i++){
            currsum = a[i];
            for(int j = i+1; j<n; j++){
                currsum +=a[j];
                if(currsum == sum){
                    index1 = i; 
                    index2 = j;
                    break;
                }
            }
            if(currsum == sum){
                break;
            }
        }
        
        System.out.println(index1+" "+index2);
        
        
       
    }
}

 Output:

 
0 3
Efficient Solution: (with only non negative elements)

     It is based on sliding window technique similar to https://www.geeksforgeeks.org/window-sliding-technique/
Code:

 import java.util.*;

 public class Solution {

     
    public static void main(String[] args) {
       
        int[] a = {1,4,20,3,10,5};
        int n = a.length;
        int sum = 33, currsum = a[0];
        int index1 = 0, index2 = 0;
        
        while(index2<n){
            if(currsum < sum){
                index2++;
                currsum += a[index2];
            }
            
            if(currsum > sum){
                currsum -= a[index1];
                index1++;
            }
            
            if(currsum == sum){
                    break;
                }
        }
        
        System.out.println(index1+" "+index2);
        
        
       
    }
}

 Output:

 
2 4
Efficient solution (negative numbers) : O(n) auxiliary space, O(n) time

   Here we keep track of sum find so far in  map. We will calculate the currsum. If currsum is equal to given sum we will print the indices. Else we will check if the difference between currsum and sum is present in the map. This can be better understood by the illustration following the code.

 Code:

 import java.util.*;

 public class Solution {

     
    public static void main(String[] args) {
       
        int[] a = {1,4,-20,-3,-10,5};
        int n = a.length;
        int sum = -33, currsum = a[0];
        Map<Integer,Integer> map= new HashMap<Integer,Integer>();
        
        for(int i=0; i<n; i++){
            currsum += a[i];
            if(a[i] == currsum){
                System.out.println("0"+" "+i);
                break;
            }
            
            if(map.containsKey(currsum-sum)){
                int index1 = map.get(currsum-sum)+1;
                System.out.println(index1+" "+i);
                break;
            }
            
            map.put(currsum,i);
        }

     }
}

 Output:
2 4

 Illustration:


   





Comments

Post a Comment

Popular posts from this blog

Rearrange Array in Maximum-Minimum form

Given a sorted array of positive integers, rearrange the array alternately i.e first element should be the maximum value, second minimum value, third-second max, fourth-second min and so on. Naive Solution: Here we will use an auxiliary array to store the elements in correct order. For even indices of the array  Large numbers from the given array are added. For odd indices small numbers are added. Code: import java.util.*; public class Test{        public static void main(String[] args) {          Scanner in = new Scanner(System.in);     int[] a = {1,2,3,4,5,6,7,8,9};     int n = a.length;     int[] temp = new int[n];     int small = 0;     int large = n-1;     for(int i=0; i<n; i++){         if(i%2 == 0){             temp[i] = a[large--];         }         else{             temp[i] = a[small++];         }              }     for(int i=0; i<n; i++){         System.out.print(temp[i]+" ");     }            
Read more

Second Largest Element

Given an array of integers, our task is to write a program that efficiently finds the second largest element present in the array. Example: Input : arr[] = {12, 35, 1, 10, 34, 1} Output : The second largest element is 34. Code: package sap; public class SecondLargest {         public static void main(String[] args){                 int[] a = {89, 24, 75, 11, 23};         int max = Integer.MIN_VALUE, secondMax = Integer.MIN_VALUE;                 for(int i=0; i<a.length; i++){                         if(a[i] > max){                                 secondMax = max;                 max = a[i];                             }             else if(a[i] > secondMax){                 secondMax = a[i];             }                     }                 System.out.println("The second maximum element is "+secondMax);             } } Output: The second maximum element is 75
Read more

Check if a number is a power of another number

Check if a number is a power of another number Input: x = 10, y = 1 Output: True x^0 = 1 Input: x = 10, y = 1000 Output: True x^3 = 1 Input: x = 10, y = 1001 Output: False Code: package sap; public class Power {         public static void main(String[] args){                int x = 27, y = 729;                 int val = (int)Math.log(y)/ (int)Math.log(x);                 double res = Math.log(y)/Math.log(x);                 if(val == res){             System.out.println(x+" can be expressed as a power of "+y);         }                 else{             System.out.println(x +" cannot be expressed as a power of "+y);         }             } } Output: 27 can be expressed as a power of 729
Read more