ArrayChallenge.java

importjava.util.*; 
importjava.io.*;

classMain {

publicstaticbooleanArrayChallenge(int[] arr) {

ArrayList<Integer> list = newArrayList<Integer>();
for(inti: arr){
list.add(i);
 }


intmaxNumber = list.get(0);
for(inti = 1;i<list.size();i++){
if(list.get(i)>maxNumber)
maxNumber= list.get(i);
 }
list.remove(Integer.valueOf(maxNumber));


intn = list.size();
for (inti = 0; i < (1<<n); i++)
 {
intsum = 0;


// Print current subset
for (intj = 0; j < n; j++)

// (1<<j) is a number with jth bit 1
// so when we 'and' them with the
// subset number we get which numbers
// are present in the subset and which
// are not
if ((i & (1 << j)) > 0){

sum+=list.get(j);
 }
if(sum == maxNumber){
returntrue;
 }



 }
returnfalse;
 }

publicstaticvoidmain (String[] args) { 
// keep this function call here 
Scanners = newScanner(System.in);
System.out.print(ArrayChallenge(s.nextLine())); 
 }

}