黑车NG店面

  1. Given a binary tree, check whether it is a mirror of itself.
    https://leetcode.com/problems/symmetric-tree/
  2. Given an array find the number of distinct subarrays with atmost k odd elements
    https://leetcode.com/discuss/interview-question/278341/Uber-or-Phone-Screen-or-Distinct-subarrays-with-at-most-k-odd-elements

Given a time interval list which represents trips, find overlapping trip counts for each time interval
and return as a list.
Input: [(0, 3), (2, 7), (2, 5)]
Output: [(0, 1, 1), (2, 3, 3), (4, 5, 2), (6, 7, 1)]