Array-2
public int countEvens(int[] nums) {
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] % 2 == 0) {
count++;
}
}
return count;
}public int bigDiff(int[] nums) {
int max = 0;
int min = nums[0];
for (int i = 0; i < nums.length; i++) {
if (max < nums[i]) {
max = nums[i];
}
if (min > nums[i]) {
min = nums[i];
}
}
return max - min;
}public int centeredAverage(int[] nums) {
int sum = 0;
for(int i = 0; i < nums.length; i++){
sum = sum + nums[i];
}
int minMax = min(nums) + max(nums);
sum -= minMax;
return sum / (nums.length -2);
}
public int min (int[] nums){
int min = nums[0];
for(int i = 0; i < nums.length; i++){
if(min > nums[i]){
min = nums[i];
}
}
return min;
}
public int max (int[] nums){
int max = nums[0];
for(int i = 0; i < nums.length; i++){
if(max < nums[i]){
max = nums[i];
}
}
return max;
}public int sum13(int[] nums) {
int sum = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 13) {
nums[i] = 0;
if (nums.length > i + 1) {
nums[i + 1] = 0;
}
}
sum += nums[i];
}
return sum;
}public int sum67(int[] nums) {
int before6 = 0;
int sum = 0;
int count6 = 0;
int count7 = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] != 6 && count6 == count7) {
sum += nums[i];
}
if (nums[i] == 6 && count6 == count7) {
before6 += sum;
count6++;
}
if (nums[i] == 7 && count6 != 0) {
count7++;
if (count6 == count7) {
sum = 0;
}
}
}
return before6 + sum;
}public boolean has22(int[] nums) {
int index2 = 0;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] == 2 && nums[i + 1] == 2) {
return true;
}
}
return false;
}public boolean lucky13(int[] nums) {
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 1 || nums[i] == 3) {
return false;
}
}
return true;
}public boolean sum28(int[] nums) {
int count8 = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 2) {
count8++;
}
}
if (count8 == 4) return true;
return false;
}public boolean more14(int[] nums) {
int count1 = 0;
int count4 = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 1) count1++;
if (nums[i] == 4) count4++;
}
if (count1 > count4) return true;
return false;
}public int[] fizzArray(int n) {
int[] nums = new int[n];
for(int i = 0; i < nums.length; i++){
nums[i] = i;
}
return nums;
}public boolean only14(int[] nums) {
for (int i = 0; i < nums.length; i++) {
if (nums[i] != 1 && nums[i] != 4) return false;
}
return true;
}public String[] fizzArray2(int n) {
String[] nums = new String[n];
String result = "";
for (int i = 0; i < n; i++) {
result += i;
nums[i] = result.valueOf(i);
}
return nums;
}public boolean no14(int[] nums) {
int count1 = 0;
int count4 = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 1) count1++;
if (nums[i] == 4) count4++;
}
if (count1 == 0 && count4 > 0) return true;
if (count1 > 0 && count4 == 0) return true;
if (nums.length <= 1) return true;
return false;
}public boolean isEverywhere(int[] nums, int val) {
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] != val && nums[i + 1] != val) return false;
}
return true;
}public boolean either24(int[] nums) {
int count2 = 0;
int count4 = 0;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] == 2 && nums[i + 1] == 2) count2++;
if (nums[i] == 4 && nums[i + 1] == 4) count4++;
}
if (count2 == count4) return false;
return true;
}public int matchUp(int[] nums1, int[] nums2) {
int count = 0;
for (int i = 0; i < nums1.length; i++) {
if (Math.abs(nums1[i] - nums2[i]) <= 2 && nums1[i] - nums2[i] != 0) count++;
}
return count;
}public boolean has77(int[] nums) {
for (int i = 0; i < nums.length - 2; i++) {
if ((nums[i] == 7 && nums[i + 1] == 7) || (nums[i] == 7 && nums[i + 2] == 7)) return true;
if (nums[i + 1] == 7 && nums[i + 2] == 7) return true;
}
return false;
}public boolean has12(int[] nums) {
int count1 = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 1) count1++;
if (nums[i] == 2 && count1 > 0) return true;
}
return false;
}public boolean modThree(int[] nums) {
for (int i = 0; i < nums.length - 2; i++) {
if (nums[i] % 2 == 0 && nums[i + 1] % 2 == 0 && nums[i + 2] % 2 == 0) return true;
if (nums[i] % 2 != 0 && nums[i + 1] % 2 != 0 && nums[i + 2] % 2 != 0) return true;
}
return false;
}public boolean haveThree(int[] nums) {
int count = 0;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] == 3 && nums[i + 1] != 3) {
count++;
}
}
if (nums.length > 1 && nums[nums.length - 1] == 3 && nums[nums.length - 2] != 3) {
count++;
}
if (count == 3) {
return true;
}
return false;
}public boolean twoTwo(int[] nums) {
boolean found = false;
int count = 0;
if (nums.length == 2 && nums[0] + nums[1] == 4) return true;
if (nums.length == 1 && nums[0] == 2) return false;
for (int i = 0; i < nums.length - 1; i++) {
if (nums[i] == 2) count++;
if (nums[i] == 2 && nums[i + 1] == 2) found = true;
if (nums.length > 1 && nums[nums.length - 2] != 2 && nums[nums.length - 1] == 2) {
return false;
}
}
if (count == 0 || (found == true && count % 2 == 0)) return true;
return false;
}public boolean sameEnds(int[] nums, int len) {
for (int i = 0; i < len; i++) {
if (nums[i] != nums[nums.length - len + i]) return false;
}
return true;
}public boolean tripleUp(int[] nums) {
for (int i = 0; i < nums.length - 2; i++) {
if (nums.length >= 3) {
if (nums[i] - nums[i + 1] == -1 && nums[i + 1] - nums[i + 2] == -1) return true;
}
}
return false;
}public int[] fizzArray3(int start, int end) {
int[] nums = new int[end-start];
for(int i = 0; i<nums.length; i++){
nums[i] = start;
start++;
}
return nums;
}public int[] shiftLeft(int[] nums) {
int[] nums1 = new int[nums.length];
if (nums.length == 0) return nums;
for (int i = 0; i < nums.length - 1; i++) {
int a = i;
nums1[i] = nums[a + 1];
}
nums1[nums1.length - 1] = nums[0];
return nums1;
}public int[] tenRun(int[] nums) {
int[] nums1 = new int [nums.length];
int multiTen = 0;
boolean found = false;
for(int i = 0; i < nums.length; i++){
nums1[i] = nums[i];
if(nums[i]%10 == 0){
found = true;
multiTen = nums[i];
}
if(found == true) nums1[i] = multiTen;
}
return nums1;
}public int[] pre4(int[] nums) {
int count = 0;
for(int i = 0; i<nums.length; i++){
if(nums[i] != 4) count++;
if (nums[i] == 4){
int[] res = Arrays.copyOf(nums, count);
return res;
}
}
return nums;
}public int[] post4(int[] nums) {
int count = nums.length;
for(int i = nums.length-1; i >= 0; i--){
if(nums[i] != 4) count--;
if(nums[i] == 4){
int[] res = Arrays.copyOfRange(nums, count, nums.length);
return res;
}
}
return nums;
}public int[] notAlone(int[] nums, int val) {
for(int i = 1; i< nums.length-1; i++){
if( nums[i] == val){
if(nums[i-1] != nums[i] && nums[i+1] != nums[i]){
nums[i] = Math.max(nums[i-1], nums[i+1]);
}
}
}
return nums;
}public int[] zeroFront(int[] nums) {
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 0) {
count++;
nums[i] = nums[count - 1];
nums[count - 1] = 0;
}
}
return nums;
}public int[] withoutTen(int[] nums) {
int count = 0;
int[] res = new int[nums.length];
for (int i = 0; i < nums.length; i++) {
if (nums[i] != 10) {
res[count] = nums[i];
count++;
}
}
return res;
}public int[] zeroMax(int[] nums) {
int pos0 = 0;
int maxOdd = 0;
for(int i = 0; i<nums.length; i++){
if(nums[i] == 0){
pos0 = i;
while(pos0 < nums.length){
if(maxOdd < nums[pos0] && nums[pos0]%2 != 0) {
maxOdd = nums[pos0];
}
pos0++;
}
nums[i] = maxOdd;
maxOdd = 0;
}
}
return nums;
}public int[] evenOdd(int[] nums) {
int count = 0;
int temp = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] % 2 == 0) {
temp = nums[count];
nums[count] = nums[i];
nums[i] = temp;
count++;
}
}
return nums;
}public String[] fizzBuzz(int start, int end) {
String result = "";
String[] nums = new String[end - start];
for (int i = 0; i < nums.length; i++) {
if (start % 3 == 0 && start % 5 != 0) nums[i] = "Fizz";
if (start % 5 == 0 && start % 3 != 0) nums[i] = "Buzz";
if (start % 5 == 0 && start % 3 == 0) nums[i] = "FizzBuzz";
if (start % 3 != 0 && start % 5 != 0) {
result += start;
nums[i] = result.valueOf(start);
}
start++;
}
return nums;
}Last updated