---
title: "Discussion on \"LeetCode 153. Find Minimum in Rotated Sorted Array\" | Hashnode"
description: "Discussion on \"LeetCode 153. Find Minimum in Rotated Sorted Array\". Question\nSuppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:\n\n[4,5,6,7,0,1,2] if it was rotated 4 times.\n\n[0,1,2,4,5,6,7] if it was rotated 7 times.\n\n\nNo..."
url: "https://hashnode.com/posts/leetcode-153-find-minimum-in-rotated-sorted-array/6860f587ebdbfcfd3df6cb04"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [LeetCode 153. Find Minimum in Rotated Sorted Array](https://blog.brucelinweb.com/leetcode-153-find-minimum-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed)

Question Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = \[0,1,2,4,5,6,7\] might become: \[4,5,6,7,0,1,2\] if it was rotated 4 times. \[0,1,2,4,5,6,7\] if it was rotated 7 times. No...

Jun 29, 2025 · 4 min read · blog.brucelinweb.com  
Read the article

-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#coding](https://hashnode.com/tag/coding)
-   [#cpp](https://hashnode.com/tag/cpp)

## Written by

[Bruce Lin](https://hashnode.com/@lalalala0620)

@lalalala0620

  
[View profile](https://hashnode.com/@lalalala0620)

## Responses

Markdown supported · ⌘↵ to post

No responses yet.