def merge_intervals(intervals):
    # Sort the intervals by their starting point
    intervals = sorted(intervals, key=lambda x: x[0])
    merged = []
    for interval in intervals:
        # If the current interval overlaps with the last interval in merged, merge them
        if merged and interval[0] <= merged[-1][1]:
            merged[-1][1] = max(merged[-1][1], interval[1])
        else:
            # If they don't overlap, add the current interval to merged
            merged.append(interval)
    return merged
 
# Example usage
intervals = [[1, 3], [2, 6], [8, 10], [15, 18]]
merged_intervals = merge_intervals(intervals)
print(merged_intervals)
# Output: [[1, 6], [8, 10], [15, 18]]

class Solution:
    def sort(self, nums):
        for i in range(len(nums) - 1):
            for j in range(i + 1, len(nums)):
                if nums[j] < nums[i]:
                    temp = nums[i]
                    nums[i] = nums[j]
                    nums[j] = temp
    
    def findContentChildren(self, g, s):
        self.sort(g)
        self.sort(s)
        count = 0
        i = 0  # pointer to g
        j = 0  # pointer to s
        
        while i < len(g) and j < len(s):
            if s[j] - g[i] >= 0:
                count += 1
                i += 1
                j += 1
            else:
                j += 1
        
        return count