---
title: "Discussion on \"Find Minimum in Rotated Sorted Array\" | Hashnode"
description: "Discussion on \"Find Minimum in Rotated Sorted Array\". # written by Ashir\nclass Solution:\n    def findMin(self, nums: List[int]) -> int:\n        m = nums[0]\n        mid = 0\n\n        if len(nums) == 1:\n            return nums[0]\n        for i in range(len(nums) - 1):\n            if nums[i + 1] < nums[i]:\n..."
url: "https://hashnode.com/posts/find-minimum-in-rotated-sorted-array/6662e4c8d20d673962abcf6b"
---

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

Discussion

# [Find Minimum in Rotated Sorted Array](https://ashirmehmood.hashnode.dev/find-minimum-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed)

\# written by Ashir class Solution: def findMin(self, nums: List\[int\]) -> int: m = nums\[0\] mid = 0 if len(nums) == 1: return nums\[0\] for i in range(len(nums) - 1): if nums\[i + 1\] < nums\[i\]: ...

Jun 7, 2024 · 1 min read · ashirmehmood.hashnode.dev  
Read the article

## Written by

[Ashir](https://hashnode.com/@AshirMehmood)

@AshirMehmood

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

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
