Here is the code from today:

    public int numX(String str) {
        int r = 0;      //where we are in the string
        int count = 0;  //number seen so far
        while(r < str.length()) {
            if('X' == str.charAt(r)) {
                count++;
            }
            r++;
        }
        return count;
    }

    public int sum(int[] vals) {  //returns sum of ints in vals
        int retVal = 0;
        int i = 0;
        while(i < vals.length) {
            retVal = retVal + vals[i];
            i++;
        }
        return retVal;
    }

    public int max(int[] vals) {  //returns largest int in vals
        int retVal = vals[0];
        int i = 0;
        while(i < vals.length) {
            if(vals[i] > retVal) {
                retVal = vals[i];
            }
            i++;
        }
        return retVal;
    }

    public boolean firstLast6(int[] nums) {
        return ((nums[0] == 6) || (nums[nums.length-1] == 6));
    }

    public boolean sameFirstLast(int[] nums) {
        return (nums.length >= 1) && (nums[0] == nums[nums.length-1]);
    }

    public int[] makePi() {
        int[] retVal = new int[3];
        retVal[0] = 3;
        retVal[1] = 1;
        retVal[2] = 4;
        return retVal;
    }

    public int sum67(int[] nums) {  //version 1
        int retVal = 0;
        int i = 0;
        while(i < nums.length) {
            if(nums[i] == 6) {
                while(nums[i] != 7) {
                    i++;
                }
                nums[i] = 0;
            }
            retVal = retVal + nums[i];
            i++;
        }
        return retVal;
    }

    public int sum67(int[] nums) {  //version 2
        int retVal = 0;
        int i = 0;
        while(i < nums.length) {
            if(nums[i] == 6) {
                while(nums[i] != 7) {
                    i++;
                }
                retVal = retVal - 7;
            }
            retVal = retVal + nums[i];
            i++;
        }
        return retVal;
    }

    public int sum67(int[] nums) {  //version 3
        int retVal = 0;
        int i = 0;
        while(i < nums.length) {
            if(nums[i] == 6) {
                while(nums[i] != 7) {
                    i++;
                }
            } else {
                retVal = retVal + nums[i];
            }
            i++;
        }
        return retVal;
    }

    public int sum67(int[] nums) {  //version 4
        int retVal = 0;
        boolean skip = false;
        int i = 0;
        while(i < nums.length) {
            if(nums[i] == 6) {
                skip = true;
            } else {
                if(skip && (nums[i] == 7)) {
                    //need 1st condition so we don't skip 7s not associated with a 6 
                    skip = false;
                } else {
                    if(!skip) {
                        retVal = retVal + nums[i];
                    }
                }
            }
            i++;
        }
        return retVal;
    }