Commit 6dfecb0

authored

Merge pull request #150 from vaibhavkardate/master

some changes

2 parents 24f7b03 + e03e4cf commit 6dfecb0Copy full SHA for 6dfecb0

File tree

+28

-0

lines changed

+28

-0

lines changed

0 Bytes

Binary file not shown.

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,28 @@`
	`1`	`+Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.`
	`2`	`+`
	`3`	`+`
	`4`	`+`
	`5`	`+Example 1:`
	`6`	`+`
	`7`	`+Input: nums = [1,2,3,4,5]`
	`8`	`+Output: true`
	`9`	`+Explanation: Any triplet where i < j < k is valid.`
	`10`	`+Example 2:`
	`11`	`+`
	`12`	`+Input: nums = [5,4,3,2,1]`
	`13`	`+Output: false`
	`14`	`+Explanation: No triplet exists.`
	`15`	`+Example 3:`
	`16`	`+`
	`17`	`+Input: nums = [2,1,5,0,4,6]`
	`18`	`+Output: true`
	`19`	`+Explanation: The triplet (3, 4, 5) is valid because nums[3] == 0 < nums[4] == 4 < nums[5] == 6.`
	`20`	`+`
	`21`	`+`
	`22`	`+Constraints:`
	`23`	`+`
	`24`	`+1 <= nums.length <= 5 * 105`
	`25`	`+-231 <= nums[i] <= 231 - 1`
	`26`	`+`
	`27`	`+`
	`28`	`+Follow up: Could you implement a solution that runs in O(n) time complexity and O(1) space complexity?`

Comments

(0)