diff --git a/LeetCode/increasingTripletSubsequence.cpp b/LeetCode/increasingTripletSubsequence.cpp
new file mode 100644
index 0000000..9f560bd
--- /dev/null
+++ b/LeetCode/increasingTripletSubsequence.cpp
@@ -0,0 +1,17 @@
+// https://leetcode.com/problems/increasing-triplet-subsequence/
+#include<bits/stdc++.h>
+using namespace std;
+bool increasingTriplet(vector<int>& nums) {
+    int i=INT_MAX, j=INT_MAX;
+    for(int in=0;in<nums.size();in++){
+        if(nums[in]<=i)i=nums[in];
+        else if(nums[in]<=j)j=nums[in];
+        else return true;
+    }
+    return false;
+}
+int main()
+{
+
+    return 0;
+}
\ No newline at end of file
diff --git a/LeetCode/searcha2DMatrix.cpp b/LeetCode/searcha2DMatrix.cpp
new file mode 100644
index 0000000..d2c7135
--- /dev/null
+++ b/LeetCode/searcha2DMatrix.cpp
@@ -0,0 +1,18 @@
+// https://leetcode.com/problems/search-a-2d-matrix-ii/
+#include<bits/stdc++.h>
+using namespace std;
+bool searchMatrix(vector<vector<int>>& matrix, int target) {
+    int i=0, j=matrix[0].size()-1;
+    int rows=matrix.size();
+    while(i<rows && j>=0){
+        if(matrix[i][j]==target)return true;
+        if(target>matrix[i][j])i++;
+        else if(target<matrix[i][j])j--;
+    }     
+    return false;   
+}
+int main()
+{
+
+    return 0;
+}
\ No newline at end of file