Skip to content

Commit 3c7b2f6

Browse files
committed
added Function
1 parent 13db038 commit 3c7b2f6

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -454,7 +454,7 @@ Input: nums = [5,4,3,2,1]
454454
Output: false
455455
Explanation: No triplet exists.
456456

457-
## 43) [Increasing Triplet Subsequence](https://github.com/mauricechouam/Leetcode-training/blob/main/Increasing%20Triplet%20Subsequence/code.js)
457+
## 44) [Increasing Triplet Subsequence](https://github.com/mauricechouam/Leetcode-training/blob/main/Increasing%20Triplet%20Subsequence/code.js)
458458
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.
459459
Example 1:
460460
Input: nums = [1,2,3,4,5]

0 commit comments

Comments
 (0)