How to Use Temporary Data Structure (Hashmap) in Python

with the Example of Leet Code Two-Sum Puzzle

Pavol Kutaj
Apr 28, 2022
  • Given
  1. an array of integers nums
  2. and an integer target
  • Return: indices of the two numbers such that they add up to the target.
  • You may assume that each input would have exactly one solution and you may not use the same element twice. Return the answer in any order.
<!-- EXAMPLE -->
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

2. HASHTABLE

3. SLICING

  • instead of doing a look-up in a helper data structure, you can perform a lookup directly on the rest of the list utilizing python slicing
  • then, use index() returning the first index of the looked-up value

4. SOURCES

--

--

No responses yet