Solve Banana Speed and Interval Merge

During two technical phone screens for a new graduate software engineering role, the candidate was asked to solve the following coding problems: 1. **Minimum eating speed** You are given an array `piles` where `piles[i]` is the number of bananas in the `i`-th pile, and an integer `h` representing the number of hours available. A person chooses an integer eating speed `k` bananas per hour. In each hour, they may eat from only one pile, consuming up to `k` bananas from that pile. If the pile contains fewer than `k` bananas, they eat the entire pile and do not continue eating from another pile during that hour. Return the minimum integer `k` such that all bananas can be eaten within `h` hours. 2. **Merge overlapping intervals** You are given an array `intervals` where `intervals[i] = [start_i, end_i]`. Merge all overlapping intervals and return a new array containing non-overlapping intervals that cover all ranges in the input. The output may be returned in sorted order by start time.