import java.util.List;
import java.util.ArrayList;
import java.util.Arrays;
/**
 * Created by leon on 1/29/18.
 */
public class StringArrayUtils {
    /**
     * @param array array of String objects
     * @return first element of specified array
     */ // TODO
    public static String getFirstElement(String[] array) {
       return array[0];
    }

    /**
     * @param array array of String objects
     * @return second element in specified array
     */
    public static String getSecondElement(String[] array) {
        return array[1];
    }

    /**
     * @param array array of String objects
     * @return last element in specified array
     */ // TODO
    public static String getLastElement(String[] array) {
        return array[array.length -1];
    }

    /**
     * @param array array of String objects
     * @return second to last element in specified array
     */ // TODO
    public static String getSecondToLastElement(String[] array) {
        return array[array.length -2];
    }

    /**
     * @param array array of String objects
     * @param value value to check array for
     * @return true if the array contains the specified `value`
     */ // TODO
    public static boolean contains(String[] array, String value) {
        
       
       for(String string : array)
       if(string.equalsIgnoreCase(value)){
           return true;
        }
         return false;
    }
    
    //     for(int i=0;i<array.length;i++){
   //         if(array[i]== value){
                
   //             return true;
  //          }
    

   // }
    
   // return false;
//}
    



    /**
     * @param array of String objects
     * @return an array with identical contents in reverse order
     */ // TODO
    public static String[] reverse(String[] array) {
        String[] answer = new String[array.length];
        for(int i =0; i<array.length; i++)
            answer[i] = array[array.length-1-i];
        return answer;
    }

    

    /**
     * @param array array of String objects
     * @return true if the order of the array is the same backwards and forwards
     */ // TODO
    public static boolean isPalindromic(String[] array) {
       boolean answer = false;
        if(Arrays.equals(array,reverse(array))){
       answer=true;
       }
        return answer;
    }
    


    /**
     * @param array array of String objects
     * @return true if each letter in the alphabet has been used in the array
     */ // TODO
    public static boolean isPangramic(String[] array) {
        boolean isPangramic = false;
        for(char i = 'A'; i <= 'Z'; i++) {
        if(Arrays.toString(array).indexOf(i) < 0 && (Arrays.toString(array).indexOf((char) i + 32) < 0)) {
        isPangramic = false;
        }else{
           isPangramic = true;
         }
         
        }
         return isPangramic; 
    }
   


    /**
     * @param array array of String objects
     * @param value value to check array for
     * @return number of occurrences the specified `value` has occurred
     */ // TODO
    public static int getNumberOfOccurrences(String[] array, String value) {
        //int count = 0;
        //for(String s : array){
            //if(s.equals(value)){
                //count +=1;
                //}
             //}
             //return count;
            //}
        
        int count=0;
        for(int i =0;i<array.length; i++){
        if(array[i].equals(value)){
            count++;
        }
    }
    return count;
}



    /**
     * @param array         array of String objects
     * @param valueToRemove value to remove from array
     * @return array with identical contents excluding values of `value`
     */ // TODO
    public static String[] removeValue(String[] array, String valueToRemove) {
       //use method from above
       int index = 0;
        int count = getNumberOfOccurrences(array,valueToRemove);
        String[] arr2 = new String[array.length -count];
        
        for(int i= 0; i<array.length;i++){
            if(array[i] != valueToRemove){
                arr2[index]=array[i];
            index++;
        
     }
    
  }
  return arr2;
 }

    

    /**
     * @param array array of chars
     * @return array of Strings with consecutive duplicates removes
     */ // TODO
    public static String[] removeConsecutiveDuplicates(String[] array) {
        String removeString = array[0] + " ";
        for(int i =1; i<array.length; i++){
         if(!array[i].equals(array[i-1])){
             removeString+=array[i] + " ";
            }
        }
        String [] removeStringA = removeString.split(" ");
        return removeStringA;
    }
    
    
    

    /**
     * @param array array of chars
     * @return array of Strings with each consecutive duplicate occurrence concatenated as a single string in an array of Strings
     */ // TODO
    public static String[] packConsecutiveDuplicates(String[] array) {
        String removeString = array[0];
        for(int i =1; i<array.length; i++){
            if(array[i].equals(array[i-1])){
            removeString+=array[i];
            }
            else if(!array[i].equals(array[i-1])){
                removeString += " " + array[i];
            }   
                
                
        }   
            String[] removeStringA= removeString.split(" ");
            
            return removeStringA;
            
        
    }


 }