AI TutorInterview PrepATS ResumeBlogsSign in
Back to Interview Prep

Warm Up · Loops 02

Find Smallest Number in an Array

Problem Statement

Write a function that returns the smallest number in an array.

Example

Input: arr = [2, -6, 4, 8, 1, -9]

Process: smallest goes 2 → -6 → -9

Output: -9

Approach

  • Initialize a variable smallest to Infinity.
  • Loop through the array.
  • If the current element is less than smallest, update smallest.
  • Return smallest after the loop ends.

Time & Space Complexity

Time Complexity: O(n) - where n is the number of elements in the array.

Space Complexity: O(1) - only a single variable is used.

Visualisation

1Start with the array[2, -6, 4, 8, 1, -9]
2Assume nothing is smaller yetlet smallest = Infinity;
3Smaller than current smallest? Replace itarr[i] < smallest
4Smallest number-9

Explanation

  • Starting at Infinity guarantees the first element always becomes the new smallest.
  • Each time a smaller value appears, smallest is updated: 2, then -6, then -9.
  • After one pass through the array, smallest holds the minimum value.

Your solution

Solve it in JavaScript and print the answer with console.log(). Run to see your output, then Submit to check it against the test cases.

// Write your solution in JavaScript
// Print the answer with console.log()
Console

No output yet. Use console.log() to print values here.

Write your own solution and press Submit once to unlock the answer.

Count Negative Numbers in an ArrayFind Largest Number in an Array
You're viewing a free lesson. Sign up free to track your progress and unlock the full course.Sign up freeSign in