---
title: "Discussion on \"You may find the right solution but not all conditions are accepted.\" | Hashnode"
description: "Discussion on \"You may find the right solution but not all conditions are accepted.\". Today while solving some leetcode problems I came across this 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,"
url: "https://hashnode.com/posts/you-may-find-the-right-solution-but-not-all-conditions-are-accepted/6a4e418e9dacefede9431026"
---

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

Discussion

# [You may find the right solution but not all conditions are accepted.](https://gagang.hashnode.dev/you-may-find-the-right-solution-but-not-all-conditions-are-accepted?utm_source=hashnode&utm_medium=feed)

Today while solving some leetcode problems I came across this 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,

Jul 8 · 2 min read · gagang.hashnode.dev  
Read the article

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

## Written by

[Gagan G Saralaya](https://hashnode.com/@GaganG)

@GaganG

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

Just a coder building cool stuff.

I'm passionate about coding and enjoy working with embedded systems, app development, and compiler design.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
