{ "data": { "question": { "questionId": "153", "questionFrontendId": "153", "boundTopicId": null, "title": "Find Minimum in Rotated Sorted Array", "titleSlug": "find-minimum-in-rotated-sorted-array", "content": "

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:

\n\n\n\n

Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].

\n\n

Given the sorted rotated array nums of unique elements, return the minimum element of this array.

\n\n

You must write an algorithm that runs in O(log n) time.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [3,4,5,1,2]\nOutput: 1\nExplanation: The original array was [1,2,3,4,5] rotated 3 times.\n
\n\n

Example 2:

\n\n
\nInput: nums = [4,5,6,7,0,1,2]\nOutput: 0\nExplanation: The original array was [0,1,2,4,5,6,7] and it was rotated 4 times.\n
\n\n

Example 3:

\n\n
\nInput: nums = [11,13,15,17]\nOutput: 11\nExplanation: The original array was [11,13,15,17] and it was rotated 4 times. \n
\n\n

 

\n

Constraints:

\n\n\n", "translatedTitle": null, "translatedContent": null, "isPaidOnly": false, "difficulty": "Medium", "likes": 6591, "dislikes": 387, "isLiked": null, "similarQuestions": "[{\"title\": \"Search in Rotated Sorted Array\", \"titleSlug\": \"search-in-rotated-sorted-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find Minimum in Rotated Sorted Array II\", \"titleSlug\": \"find-minimum-in-rotated-sorted-array-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", "exampleTestcases": "[3,4,5,1,2]\n[4,5,6,7,0,1,2]\n[11,13,15,17]", "categoryTitle": "Algorithms", "contributors": [], "topicTags": [ { "name": "Array", "slug": "array", "translatedName": null, "__typename": "TopicTagNode" }, { "name": "Binary Search", "slug": "binary-search", "translatedName": null, "__typename": "TopicTagNode" } ], "companyTagStats": null, "codeSnippets": [ { "lang": "C++", "langSlug": "cpp", "code": "class Solution {\npublic:\n int findMin(vector& nums) {\n \n }\n};", "__typename": "CodeSnippetNode" }, { "lang": "Java", "langSlug": "java", "code": "class Solution {\n public int findMin(int[] nums) {\n \n }\n}", "__typename": "CodeSnippetNode" }, { "lang": "Python", "langSlug": "python", "code": "class Solution(object):\n def findMin(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ", "__typename": "CodeSnippetNode" }, { "lang": "Python3", "langSlug": "python3", "code": "class Solution:\n def findMin(self, nums: List[int]) -> int:\n ", "__typename": "CodeSnippetNode" }, { "lang": "C", "langSlug": "c", "code": "\n\nint findMin(int* nums, int numsSize){\n\n}", "__typename": "CodeSnippetNode" }, { "lang": "C#", "langSlug": "csharp", "code": "public class Solution {\n public int FindMin(int[] nums) {\n \n }\n}", "__typename": "CodeSnippetNode" }, { "lang": "JavaScript", "langSlug": "javascript", "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar findMin = function(nums) {\n \n};", "__typename": "CodeSnippetNode" }, { "lang": "Ruby", "langSlug": "ruby", "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef find_min(nums)\n \nend", "__typename": "CodeSnippetNode" }, { "lang": "Swift", "langSlug": "swift", "code": "class Solution {\n func findMin(_ nums: [Int]) -> Int {\n \n }\n}", "__typename": "CodeSnippetNode" }, { "lang": "Go", "langSlug": "golang", "code": "func findMin(nums []int) int {\n \n}", "__typename": "CodeSnippetNode" }, { "lang": "Scala", "langSlug": "scala", "code": "object Solution {\n def findMin(nums: Array[Int]): Int = {\n \n }\n}", "__typename": "CodeSnippetNode" }, { "lang": "Kotlin", "langSlug": "kotlin", "code": "class Solution {\n fun findMin(nums: IntArray): Int {\n \n }\n}", "__typename": "CodeSnippetNode" }, { "lang": "Rust", "langSlug": "rust", "code": "impl Solution {\n pub fn find_min(nums: Vec) -> i32 {\n \n }\n}", "__typename": "CodeSnippetNode" }, { "lang": "PHP", "langSlug": "php", "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @return Integer\n */\n function findMin($nums) {\n \n }\n}", "__typename": "CodeSnippetNode" }, { "lang": "TypeScript", "langSlug": "typescript", "code": "function findMin(nums: number[]): number {\n\n};", "__typename": "CodeSnippetNode" }, { "lang": "Racket", "langSlug": "racket", "code": "(define/contract (find-min nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", "__typename": "CodeSnippetNode" }, { "lang": "Erlang", "langSlug": "erlang", "code": "-spec find_min(Nums :: [integer()]) -> integer().\nfind_min(Nums) ->\n .", "__typename": "CodeSnippetNode" }, { "lang": "Elixir", "langSlug": "elixir", "code": "defmodule Solution do\n @spec find_min(nums :: [integer]) :: integer\n def find_min(nums) do\n\n end\nend", "__typename": "CodeSnippetNode" } ], "stats": "{\"totalAccepted\": \"903.8K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 903751, \"totalSubmissionRaw\": 1886816, \"acRate\": \"47.9%\"}", "hints": [ "Array was originally in ascending order. Now that the array is rotated, there would be a point in the array where there is a small deflection from the increasing sequence. eg. The array would be something like [4, 5, 6, 7, 0, 1, 2].", "You can divide the search space into two and see which direction to go.\r\nCan you think of an algorithm which has O(logN) search complexity?", "
    \r\n
  1. All the elements to the left of inflection point > first element of the array.
    2. \r\n
  2. All the elements to the right of inflection point < first element of the array.
    3. \r\n
      " ], "solution": { "id": "549", "canSeeDetail": true, "paidOnly": false, "hasVideoSolution": false, "paidOnlyVideo": true, "__typename": "ArticleNode" }, "status": null, "sampleTestCase": "[3,4,5,1,2]", "metaData": "{\r\n \"name\": \"findMin\",\r\n \"params\": [\r\n {\r\n \"name\": \"nums\",\r\n \"type\": \"integer[]\"\r\n }\r\n ],\r\n \"return\": {\r\n \"type\": \"integer\"\r\n }\r\n}", "judgerAvailable": true, "judgeType": "large", "mysqlSchemas": [], "enableRunCode": true, "enableTestMode": false, "enableDebugger": true, "envInfo": "{\"cpp\": [\"C++\", \"

      Compiled with clang 11 using the latest C++ 17 standard.

      \\r\\n\\r\\n

      Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

      \\r\\n\\r\\n

      Most standard library headers are already included automatically for your convenience.

      \"], \"java\": [\"Java\", \"

      OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

      \\r\\n\\r\\n

      Most standard library headers are already included automatically for your convenience.

      \\r\\n

      Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

      \"], \"python\": [\"Python\", \"

      Python 2.7.12.

      \\r\\n\\r\\n

      Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

      \\r\\n\\r\\n

      For Map/TreeMap data structure, you may use sortedcontainers library.

      \\r\\n\\r\\n

      Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

      \"], \"c\": [\"C\", \"

      Compiled with gcc 8.2 using the gnu99 standard.

      \\r\\n\\r\\n

      Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

      \\r\\n\\r\\n

      Most standard library headers are already included automatically for your convenience.

      \\r\\n\\r\\n

      For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

      \\r\\n\\r\\n

      1. Adding an item to a hash.\\r\\n

      \\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
      \\r\\n

      \\r\\n\\r\\n

      2. Looking up an item in a hash:\\r\\n

      \\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
      \\r\\n

      \\r\\n\\r\\n

      3. Deleting an item in a hash:\\r\\n

      \\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
      \\r\\n

      \"], \"csharp\": [\"C#\", \"

      C# 10 with .NET 6 runtime

      \\r\\n\\r\\n

      Your code is compiled with debug flag enabled (/debug).

      \"], \"javascript\": [\"JavaScript\", \"

      Node.js 16.13.2.

      \\r\\n\\r\\n

      Your code is run with --harmony flag, enabling new ES6 features.

      \\r\\n\\r\\n

      lodash.js library is included by default.

      \\r\\n\\r\\n

      For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

      \"], \"ruby\": [\"Ruby\", \"

      Ruby 3.1

      \\r\\n\\r\\n

      Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

      \"], \"swift\": [\"Swift\", \"

      Swift 5.5.2.

      \"], \"golang\": [\"Go\", \"

      Go 1.17.6.

      \\r\\n\\r\\n

      Support https://godoc.org/github.com/emirpasic/gods library.

      \"], \"python3\": [\"Python3\", \"

      Python 3.10.

      \\r\\n\\r\\n

      Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

      \\r\\n\\r\\n

      For Map/TreeMap data structure, you may use sortedcontainers library.

      \"], \"scala\": [\"Scala\", \"

      Scala 2.13.7.

      \"], \"kotlin\": [\"Kotlin\", \"

      Kotlin 1.3.10.

      \"], \"rust\": [\"Rust\", \"

      Rust 1.58.1

      \\r\\n\\r\\n

      Supports rand v0.6\\u00a0from crates.io

      \"], \"php\": [\"PHP\", \"

      PHP 8.1.

      \\r\\n

      With bcmath module

      \"], \"typescript\": [\"Typescript\", \"

      TypeScript 4.5.4, Node.js 16.13.2.

      \\r\\n\\r\\n

      Your code is run with --harmony flag, enabling new ES2020 features.

      \\r\\n\\r\\n

      lodash.js library is included by default.

      \"], \"racket\": [\"Racket\", \"

      Run with Racket 8.3.

      \"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", "libraryUrl": null, "adminUrl": null, "challengeQuestion": null, "__typename": "QuestionNode" } } }