Given three ints, a b c, return true if two or more of them have the same rightmost digit. The ints are non-negative. Note: the % "mod" operator computes the remainder, e.g. 17 % 10 is 7.

lastDigit(23, 19, 13) → true
lastDigit(23, 19, 12) → false
lastDigit(23, 19, 3) → true

1
2
3

public boolean lastDigit(int a, int b, int c) {
   return ((a % 10)==(b % 10) || (b % 10)==(c % 10) || (a % 10)==(c % 10));
}

Given three ints, a b c, return true if b is greater than a, and c is greater than b. However, with the exception that if "bOk" is true, b does not need to be greater than a.

inOrder(1, 2, 4, false) → true
inOrder(1, 2, 1, false) → false
inOrder(1, 1, 2, true) → true

1
2
3
4
5
6
7

public boolean inOrder(int a, int b, int c, boolean bOk) {
  if ((bOk && c>b) || (b>a && c>b)) {
    return true;
  } else {
    return false;
  }
}

We are having a party with amounts of tea and candy. Return the int outcome of the party encoded as 0=bad, 1=good, or 2=great. A party is good (1) if both tea and candy are at least 5. However, if either tea or candy is at least double the amount of the other one, the party is great (2). However, in all cases, if either tea or candy is less than 5, the party is always bad (0).

teaParty(6, 8) → 1
teaParty(3, 8) → 0
teaParty(20, 6) → 2

1
2
3
4
5
6
7
8
9

public int teaParty(int tea, int candy) {
  if ((tea>=5 && candy>=5) && (tea>=2*candy || candy>=2*tea)){
    return 2;
  } else if (tea>=5 && candy>=5){
    return 1;
  } else {
    return 0;
  }
}