Minimum Indices HackerEarth

 

import java.util.*;
 
 
class TestClass {
    public static void main(String args[] ) throws Exception {
       Scanner sc=new Scanner(System.in);
       int n=sc.nextInt();
       int q=sc.nextInt();
       int arr[]=new int[n];
       for(int i=0;i<n;i++){
           arr[i]=sc.nextInt();
       }
	   ArrayList<Integer>aa=new ArrayList<Integer>();
	   ArrayList<Integer>ab=new ArrayList<Integer>();
	   int sum=0;
       for(int i=0;i<n;i++){
		   String s=String.valueOf(arr[i]);
           for(int j=0;j<s.length();j++){
               sum=sum+Integer.valueOf(String.valueOf(s.charAt(j)));
			   
           }
		   aa.add(sum);
		   sum=0;
       }
	   //System.out.println(aa+" ");
	   int count=0;
       for(int i=0;i<q;i++){
           int a=sc.nextInt();
		   int b=a;
		   
		   a--;
		   //System.out.println("Users entered index will be: "+a);
		   //System.out.println("Users entered index will be one more: "+b);
		   int sum1=aa.get(a);
		   //System.out.println("Sum will be: "+sum1);
		   int ele1=arr[a];
		   //System.out.println("Element at that index is: "+ele1);
		   if(b==n){
			   ab.add(-1);
			   //System.out.println("-1");
		   }
		   else{
			   for(int i1=b;i1<n;i1++){
				   int sum2=aa.get(i1);
				   
				   int ele2=arr[i1];
				   if(sum1>sum2 && ele1<ele2){
					   ab.add(i1+1);
					   count++;
					   break;
				   }
				   else{
					   count=0;
				   }
			   }
			   if(count==0){
				   ab.add(-1);
				   //System.out.println("Not present.");
			   }
			   
		   }
		    
       }
       for(int i2=0;i2<ab.size();i2++){
        System.out.println(ab.get(i2)+" ");
       }
	    //System.out.println();
 
    }
}

Language: Java