Added solution for Leetcode 0056. Merge Intervals

Author: frankdavid-bp

problems/01. Arrays/Part 02/02. Leetcode Medium 0056. Merge Intervals/java/OptimizedSortingApproachUsingLinkedList.java

@@ -1,7 +1,7 @@
 import java.util.Arrays;
 import java.util.LinkedList;
 
-public class Solution {
+public class OptimizedSortingApproachUsingLinkedList {
     public static void main(String[] args) {
         int[][] intervals = {{1,3},{2,6},{8,10},{15,18}};
         Arrays.sort(intervals, (a, b) -> Integer.compare(a[0], b[0]));