Here is the code we wrote today:

public boolean tripleUp(int[] nums) {
  int i = 0;
  while(i+2 < nums.length) {
    if((nums[i]+1 == nums[i+1]) && (nums[i]+2 == nums[i+2])) {
        return true;
    }
    /*
    if(nums[i]+1 == nums[i+1]) {
      if(nums[i]+2 == nums[i+2]) {
        return true;
      }
    }
    */
    i++;
  }
  return false;
}

public int[] shiftLeft(int[] nums) {
  if(nums.length == 0) {
    return nums;
  }

  int i = 0;
  int zero = nums[0];
  while(i+1 < nums.length) {
    nums[i] = nums[i+1];
    i++;
  }
  nums[nums.length-1] = zero;
  return nums;
}

public int[] shiftLeft(int[] nums) {
  if(nums.length == 0) {
    return nums;
  }

  int[] nums2 = new int[nums.length];
  int i = 0;
  while(i+1 < nums.length) {
    nums2[i] = nums[i+1];
    i++;
  }
  nums2[nums.length-1] = nums[0];
  return nums2;
}

public int[] shiftLeft(int[] nums) {
  int[] nums2 = new int[nums.length];
  int i = 0;
  while(i < nums.length) {
    nums2[i] = nums[(i+1)%nums.length];
    i++;
  }
  return nums2;
}