@@ -142,7 +142,7 @@ My accepted leetcode solutions to some of the common interview problems.
 - [Longest Paliandromic Substring](problems/src/dynamic_programming/LongestPaliandromicSubstring.java) (Medium)
 - [Longest Palindromic Subsequence](problems/src/dynamic_programming/LongestPalindromicSubsequence.java) (Medium)
 - [Maximum Product Subarray](problems/src/dynamic_programming/MaximumProductSubarray.java) (Medium)
-- [Min Cost Climbing Stairs](problems/src/dynamic_programming/MinCostClimbingStairs.java) (Medium)
+- [Min Cost Climbing Stairs](problems/src/dynamic_programming/MinCostClimbingStairs.java) (Easy)
 - [Palindrome Partitioning II](problems/src/dynamic_programming/PalindromePartitioningII.java) (Hard)
 - [UniqueBinary Search Trees](problems/src/dynamic_programming/UniqueBinarySearchTrees.java) (Medium)
 - [Unique Binary Search Trees II](problems/src/dynamic_programming/UniqueBinarySearchTreesII.java) (Medium)
@@ -180,6 +180,7 @@ My accepted leetcode solutions to some of the common interview problems.
 - [Minimum Number of Arrows to Burst Balloons](problems/src/greedy/BurstBalloons.java) (Medium)
 - [Queue Reconstruction By Height](problems/src/greedy/QueueReconstructionByHeight.java) (Medium)
 - [Task Scheduler](problems/src/greedy/TaskScheduler.java) (Medium)
+- [Maximum Length of Pair Chain](problems/src/greedy/MaximumLengthOfPairChain.java) (Medium)
 
 #### [Hashing](problems/src/hashing)
 
 
@@ -0,0 +1,50 @@
+package greedy;
+
+import java.util.Arrays;
+
+/**
+ * Created by gouthamvidyapradhan on 01/05/2018.
+ * You are given n pairs of numbers. In every pair, the first number is always smaller than the second number.
+
+ Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c.
+ Chain of pairs can be formed in this fashion.
+
+ Given a set of pairs, find the length longest chain which can be formed. You needn't use up all the given pairs.
+ You can select pairs in any order.
+
+ Example 1:
+ Input: [[1,2], [2,3], [3,4]]
+ Output: 2
+ Explanation: The longest chain is [1,2] -> [3,4]
+ Note:
+ The number of given pairs will be in the range [1, 1000].
+
+ Solution: O(N log N) sort the pairs with ending interval (greedy sort) and try to accommodate as many pairs
+ as possible. If any current pair violates the chaining condition (b < c) then, ignore that particular pair.
+ */
+public class MaximumLengthOfPairChain {
+
+    /**
+     * Main method
+     * @param args
+     * @throws Exception
+     */
+    public static void main(String[] args) throws Exception{
+        int[][] A = {{1,2}, {2,3}, {3,4}};
+        System.out.println(new MaximumLengthOfPairChain().findLongestChain(A));
+    }
+
+    public int findLongestChain(int[][] pairs) {
+        Arrays.sort(pairs, (o1, o2) -> o1[1] == o2[1] ? Integer.compare(o1[0], o2[0]) : Integer.compare(o1[1], o2[1]));
+        int count = 1;
+        int[] curr = pairs[0];
+        for(int i = 1; i < pairs.length; i ++){
+            if(pairs[i][0] > curr[1]){
+                count++;
+                curr = pairs[i];
+            }
+        }
+        return count;
+    }
+
+}