Statistics

Problem Statement for "Digits"

Problem Statement

The smallest digit in an integer is defined to be the digit closest to 0 out of the possible 0 - 9.

Create a class Digits that contains the method sumDigits, which takes in the parameter int[], numbers, and returns the sum of the smallest digit from all the numbers.

Definition

Class:
Digits
Method:
sumDigits
Parameters:
int[]
Returns:
int
Method signature:
int sumDigits(int[] numbers)
(be sure your method is public)

Notes

  • the integer 0 is seen as having a smallest digit of 0
  • no integers will have leading 0's (99 will never be seen as 099)

Constraints

  • numbers has between 1 and 20 elements, inclusive
  • Each element of numbers is between -1000 and 1000, inclusive
  • All integers are considered to be base 10, and will only have digits 0 - 9

Examples

  1. {987}

    Returns: 7

    7 is the smallest digit out of the possible digits 7, 8, and 9.

  2. {987, -990}

    Returns: 7

    7 is the smallest digit of 987, and 0 is the smallest digit from -990. 7 + 0 = 7

  3. {48, -88, 46, -45, 22}

    Returns: 22

  4. {675,-946,999,18}

    Returns: 19

  5. {87}

    Returns: 7

  6. {0, 43, 92}

    Returns: 5

  7. {-888}

    Returns: 8

  8. {999, 998, 997, 996, 995, 994, 993, 992, 991, 990, 989, 988, 987, 986, 985, 984, 983, 982, 981, 980}

    Returns: 89

  9. {999}

    Returns: 9

  10. {-987, 675, 942, 0, 49, 32, -6, -94, 100, -306}

    Returns: 30

  11. {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}

    Returns: 0

  12. {5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5}

    Returns: 95

  13. {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19}

    Returns: 54

  14. {-1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12, -13, -14, -15, -16, -17, -18, -19, -20}

    Returns: 54

  15. {654, -651, 81, 98, -265, -7, 0, -65, -786, 156, 8, 357, -963, -1000, 1000}

    Returns: 49

  16. {999, 888, 777, 666, 555, 444, 333, 222, 111, 0, -111, -222, -333}

    Returns: 51

  17. {11, 65, -8, -9, -35, 15, 94, 309, 987, 524, -64}

    Returns: 44

  18. {99}

    Returns: 9

  19. {81, 65, -6}

    Returns: 12

  20. {64}

    Returns: 4

  21. {399}

    Returns: 3

  22. {0}

    Returns: 0

  23. {0, 0, 0, 0}

    Returns: 0

  24. {0}

    Returns: 0

  25. {0, 91}

    Returns: 1

  26. {0}

    Returns: 0

  27. {0, 91}

    Returns: 1

  28. {-10, 5, 45, 456, 555}

    Returns: 18

  29. {0, 10}

    Returns: 0

  30. {0}

    Returns: 0

  31. {0}

    Returns: 0

  32. {0, 2, 0, 100}

    Returns: 2

  33. {0}

    Returns: 0

  34. {-463, 234, -934}

    Returns: 8

  35. {-235, 123, -963}

    Returns: 6

  36. {0}

    Returns: 0

  37. {987, 789, 123, 456}

    Returns: 19

  38. {0}

    Returns: 0

  39. {19}

    Returns: 1

  40. {0}

    Returns: 0

  41. {-10, 10, 1000, -1000, 999, 123, -123}

    Returns: 11

  42. {0}

    Returns: 0

  43. {0, 91}

    Returns: 1

  44. {0}

    Returns: 0

  45. {48, -88, 46, -45, 22}

    Returns: 22

  46. {675, -946, 999, 18}

    Returns: 19

  47. {399}

    Returns: 3

  48. {0}

    Returns: 0

  49. {0, 0, 0, 0}

    Returns: 0

  50. {0}

    Returns: 0

  51. {0, 91}

    Returns: 1

  52. {0}

    Returns: 0

  53. {0, 91}

    Returns: 1

  54. {-10, 5, 45, 456, 555}

    Returns: 18

  55. {0, 10}

    Returns: 0

  56. {0}

    Returns: 0

  57. {0}

    Returns: 0

  58. {0, 2, 0, 100}

    Returns: 2

  59. {0}

    Returns: 0

  60. {-463, 234, -934}

    Returns: 8

  61. {-235, 123, -963}

    Returns: 6

  62. {0}

    Returns: 0

  63. {987, 789, 123, 456}

    Returns: 19

  64. {0}

    Returns: 0

  65. {19}

    Returns: 1

  66. {0}

    Returns: 0

  67. {-10, 10, 1000, -1000, 999, 123, -123}

    Returns: 11

  68. {0}

    Returns: 0

  69. {0, 91}

    Returns: 1

  70. {0}

    Returns: 0

  71. {399}

    Returns: 3

  72. {0}

    Returns: 0

  73. {0, 0, 0, 0}

    Returns: 0

  74. {0}

    Returns: 0

  75. {0, 91}

    Returns: 1

  76. {0}

    Returns: 0

  77. {0, 91}

    Returns: 1

  78. {-10, 5, 45, 456, 555}

    Returns: 18

  79. {0, 10}

    Returns: 0

  80. {0}

    Returns: 0

  81. {0}

    Returns: 0

  82. {0, 2, 0, 100}

    Returns: 2

  83. {0}

    Returns: 0

  84. {-463, 234, -934}

    Returns: 8

  85. {-235, 123, -963}

    Returns: 6

  86. {0}

    Returns: 0

  87. {987, 789, 123, 456}

    Returns: 19

  88. {0}

    Returns: 0

  89. {19}

    Returns: 1

  90. {0}

    Returns: 0

  91. {-10, 10, 1000, -1000, 999, 123, -123}

    Returns: 11

  92. {0}

    Returns: 0

  93. {0, 91}

    Returns: 1

  94. {0}

    Returns: 0

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: