From 316e3bf63e6f93f694c4165efb91fcdf3ee476f3 Mon Sep 17 00:00:00 2001
From: Megha1209 <51127835+Megha1209@users.noreply.github.com>
Date: Wed, 30 Sep 2020 20:16:51 +0530
Subject: [PATCH] Create 354 Max Envelopes

Leetcode Question no 354 Max Envelopes DP solution in Java
---
 354 Max Envelopes | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 354 Max Envelopes

diff --git a/354 Max Envelopes b/354 Max Envelopes
new file mode 100644
index 0000000..6db4646
--- /dev/null
+++ b/354 Max Envelopes	
@@ -0,0 +1,23 @@
+public static int maxEnvelopes(int[][] arr) {
+
+		Arrays.sort(arr,(a, b)->{ 
+		if(a[0]==b[0]) return b[1] - a[1];  
+			else return a[0]-b[0];   
+		});
+
+		int n=arr.length;
+		int[] dp=new int[n];
+		int maxLen = 0;
+		for (int i =0;i<n;i++) {
+			dp[i] = 1;
+			for (int j = 0; j < i; j++) { 
+				if (arr[i][1] > arr[j][1]) { // compare height. 
+					dp[i] = Math.max(dp[i], dp[j] + 1);
+				}
+			}
+			maxLen = Math.max(maxLen, dp[i]);
+		}
+
+		return maxLen;
+	}
+