CareerCup

public class NextGreatestElement {

    private static List<Integer> elementList_ = new ArrayList<Integer>(Arrays.asList(4,5,2,1,8,3,25));
    private static List<Integer> currentStack_ = new ArrayList<Integer>();
    
    public static void main(String[] args) {
        findNextGreatestElement(elementList_);
    }
    
    private static void findNextGreatestElement(List<Integer> elements) {
        
        int current=elements.remove(0);
        
        //4,5,2,1,8,3,25        
        while(elementList_.size()>0) {
            int nextGreatestElement=elements.remove(0);
            if (nextGreatestElement>current) {
                System.out.println(current+" --> "+nextGreatestElement);
                if (currentStack_.size()>0) {
                    current=currentStack_.remove(0);
                    elements.add(0, nextGreatestElement);
                }
                else {
                    current=nextGreatestElement;                    
                }
            }
            else {
                currentStack_.add(currentStack_.size(), nextGreatestElement);
            }
        }
        System.out.println(current+" --> -1");
    }
    
}

the question states "subsequence being in ascending order", didn't say to preserved the sequence

public class AdditiveNumberProperty {
    
    private static List<Integer> additiveNumbList_ = new ArrayList<Integer>(Arrays.asList(123459,314538,122436,123456579));
            
    public static void main(String[] args) {

        for (int i=0;i<additiveNumbList_.size();i++) {        
            StringBuilder builder = new StringBuilder();  
            
            boolean isAdditiveNumber = isAdditiveNumber(String.valueOf(additiveNumbList_.get(i)),builder);
            if (isAdditiveNumber) {
                System.out.println(isAdditiveNumber+" "+additiveNumbList_.get(i)+" ("+builder.toString().trim()+")");
            }
        }
    }
            
    private static boolean isAdditiveNumber(String number,StringBuilder builder) {
        boolean returnIsAdditiveNumber=false;
        
        if (number.length() % 3 == 0) {
            
            int sizeOfAdditiveNumber = number.length() / 3;
            int numb1=-1;
            int numb2=-1;
            int numb3=-1;
            int counter=0;
                            
            for (int i=0;i<number.length();i++) {                    
                if (i%sizeOfAdditiveNumber==0) {
                    counter++;
                }
                if (counter==1) {
                    numb1=Integer.parseInt(number.substring(0,sizeOfAdditiveNumber));
                }
                else if (counter==2) {
                    numb2=Integer.parseInt(number.substring(sizeOfAdditiveNumber,counter*sizeOfAdditiveNumber));
                }
                else if (counter==3) {
                    numb3=Integer.parseInt(number.substring(2*sizeOfAdditiveNumber,counter*sizeOfAdditiveNumber));
                }
            }
            
            if((numb1+numb2)==numb3) {
                //ie. 123459 (1+2=3, 4+5=9) 
                builder.append(" "+numb1+"+"+numb2+"="+numb3);
                return true;
            }            
                        
            if (number.length() % 2 == 0) {
                int middle=number.length()/2;
                returnIsAdditiveNumber = isAdditiveNumber(number.substring(0, middle),builder) & isAdditiveNumber(number.substring(middle, number.length()),builder);                
            }
        }
        
        return returnIsAdditiveNumber;
    }
    
}

public class FindMaxProduct
{
    private static List<Integer> input_ = new ArrayList<Integer>(Arrays.asList(6,7,8,1,2,3,9,10));    
    private static List<Integer> prodList_ = new ArrayList<Integer>();
    
    public static void main(String[] args) 
    {        
        for(int i=0;i<input_.size();i++) {
            int currentValue = input_.get(i);
            //System.out.println(currentValue);
            Collections.sort(prodList_);
                        
            if (prodList_.size() < 3) {
                prodList_.add(currentValue);
            }
            else {
                if (currentValue >= prodList_.get(0)) {
                    prodList_.set(0, currentValue);
                }
            }
        }
        Collections.sort(prodList_);

        for (int i=0;i<prodList_.size();i++) {
            System.out.println(prodList_.get(i));
        }
    }	
}