Added Function

Author: mauricechouam

README.md

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