Given two ints, each in the range 10..99, return true if there is a digit that appears in both numbers, such as the 2 in 12 and 23. (Note: division, e.g. n/10, gives the left digit while the % "mod" n ...
if(a.length() == 0 && b.length() == 0) return a + b; else if(a.length() == 0) return b; else if(b.length() == 0) return a; else return (a.charAt(a.length() - 1) == b ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results