Java > Array-2 > sum28 (CodingBat Solution)

Problem:

Given an array of ints, return true if the sum of all the 2's in the array is exactly 8.

sum28({2, 3, 2, 2, 4, 2}) → true
sum28({2, 3, 2, 2, 4, 2, 2}) → false
sum28({1, 2, 3, 4}) → false


Solution:

public boolean sum28(int[] nums) {
  int sum = 0;
  boolean is8 = false;
  
  for (int i = 0; i < nums.length; i++) {
    if (nums[i] == 2)
      sum += 2;
  }
  if (sum == 8)
    is8 = true;
  return is8;
}

10 comments:

  1. AnonymousOctober 10, 2017 at 1:52 AM

    public boolean sum28(int[] nums) {
    int sum = 0;
    for (int i : nums) {
    if (i==2) sum += 2;
    }
    return sum==8;
    }

    ReplyDelete
  2. YvanneMay 5, 2018 at 4:01 PM

    public boolean sum28(int[] nums) {
    int count=0;
    for(int i=0; i<nums.length; i++){
    if(nums[i]==2){
    count++;
    }}
    if(count==4){
    return true;
    }

    return false;
    }

    ReplyDelete
  3. KnownJune 20, 2019 at 8:17 AM

    public boolean sum28(int[] nums) {
    int sum = 0;
    for(int i = 0; i < nums.length && sum <= 8; i++) {
    if(nums[i] == 2) sum += nums[i];
    }
    return sum == 8;
    }

    if we still left some cells in the array and sum is already grater then 8 then stop and return false

    ReplyDelete
  4. UnknownNovember 25, 2020 at 2:52 AM

    public boolean sum28(int[] nums) {
    int count = 0;
    for(int i = 0; i<nums.length; i++) {
    if(nums[i]==2) count++;
    }
    return count == 4;
    }

    ReplyDelete
  5. UnknownJanuary 17, 2021 at 9:32 AM

    public boolean sum28(int[] nums) {
    int sum=0;
    for(int i=0;i<nums.length;i++){
    if(nums[i]==2){
    sum+=nums[i];
    }
    }

    return sum==8?true:false;
    }

    ReplyDelete
  6. AnonymousJanuary 18, 2021 at 8:21 PM

    public boolean sum28(int[] nums) {
    boolean results = false;
    int sum = 0;

    for(int i = 0; i<nums.length; i++){
    if(nums[i] == 2)
    sum += nums[i];
    }
    if(sum == 8)
    {
    results = true;
    }
    return results;
    }

    ReplyDelete
  7. RajeshMay 14, 2021 at 9:32 AM

    public boolean sum28(int[] nums) {
    int sum=0;
    boolean counter = false;

    for(int i=0;i<nums.length;i++)
    if(nums[i]==2)
    sum+=nums[i];

    if(sum==8)
    counter=true;

    return counter;
    }

    ReplyDelete
  8. ambanielphasMarch 26, 2022 at 10:20 PM

    public boolean sum28(int[] nums) {
    int count = 0;

    for(int i=0; i < nums.length; i++){
    if(nums[i]==2){
    count++;
    }
    }

    if(count*2==8){
    return true;
    }

    return false;
    }

    ReplyDelete
  9. 8firoJuly 3, 2023 at 9:14 AM

    public boolean sum28(int[] nums) {
    int sum = Arrays.stream(nums)
    .filter(n -> n == 2).sum();
    if(sum == 8) return true;
    else return false;
    }

    ReplyDelete
  10. javaKingDecember 3, 2023 at 11:24 AM

    public boolean sum28(int[] nums) {
    boolean result = false;
    int count2 = 0;
    for (int i = 0; i < nums.length; i++){
    if (nums[i] == 2)
    count2++;
    }
    if (count2 == 4){
    result = true;
    }
    return result;
    }

    ReplyDelete