We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Search
  4. Ice Cream Parlor
  5. Discussions

Ice Cream Parlor

  • jxu_live
     + 1 comment

    Python solution, O(n) runtime, no need to sort

    def icecreamParlor(m, arr):
    test = dict()
    for i in range(len(arr)):
        if arr[i] not in test: 
            test[m-arr[i]] = i+1 #dollar match amount is key, 1based index is value
        else:
            return sorted([i+1, test[arr[i]]])