Java: Find Minimum in Rotated Sorted Array

Difficulty Level: MEDIUM

Problem Statement:

Given a rotated sorted array `nums`, the task is to find the minimum element in it. It is guaranteed that the array does not contain duplicates.

Suppose an array of length `n` sorted in ascending order is rotated between `1` and `n` times. Return the minimum element of this array.

Input:

nums = [3,4,5,1,2]  

Output:

1
The minimum element in the array is 1.