---
title: "Discussion on \"Day 20 - Search in Rotated Sorted Array\" | Hashnode"
description: "Discussion on \"Day 20 - Search in Rotated Sorted Array\". Question\nYou are given an array of length n which was originally sorted in ascending order. It has now been rotated between 1 and n times. For example, the array nums = [1,2,3,4,5,6] might become:\n\n[3"
url: "https://hashnode.com/posts/search-in-rotated-sorted-array/69a27f77d4053a09f3782dd4"
---

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

Discussion

# [Day 20 - Search in Rotated Sorted Array](https://blogs-himanshu.hashnode.dev/search-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed)

Question You are given an array of length n which was originally sorted in ascending order. It has now been rotated between 1 and n times. For example, the array nums = \[1,2,3,4,5,6\] might become: \[3

Feb 28 · 3 min read · blogs-himanshu.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#learning](https://hashnode.com/tag/learning)
-   [#learning-journey](https://hashnode.com/tag/learning-journey)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#learn-coding](https://hashnode.com/tag/learn-coding)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#leetcodedaily](https://hashnode.com/tag/leetcodedaily)
-   [#leetcode-medium](https://hashnode.com/tag/leetcode-medium)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[himanshu](https://hashnode.com/@Himanshu-)

@Himanshu-

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

Aspiring Web developer

Learning and learning

## Responses

Markdown supported · ⌘↵ to post

No responses yet.