Skip to content

Latest commit

 

History

History
10 lines (9 loc) · 413 Bytes

33-find-the-smallest-integer-in-the-array.md

File metadata and controls

10 lines (9 loc) · 413 Bytes

Problem:

Given an array of integers your solution should find the smallest integer.

For example:

  • Given [34, 15, 88, 2] your solution will return 2
  • Given [34, -345, -1, 100] your solution will return -345

You can assume, for the purpose of this kata, that the supplied array will not be empty.

Solution