1. Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
2. Describe the two-pointer technique and provide an example of an easy problem where it can be applied.
3. Write a program to create the longest palindromic substring from a string.