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

  • yossefibrahim7oo
     + 0 comments

    using a hash_map in a simple O(n) sol

    def icecreamParlor(m, arr):
    # Write your code here
    hash_table = {}
    for index, element in enumerate(arr):
        if element in hash_table:
            return sorted((index+1, hash_table[element]))
        else:
            hash_table[m - element] = index+1