syntax-1 · NO.01

Two Sum

Easy

My rewrite: find the two indices whose values add up to a target — never the original copyrighted statement.

ArrayHash Table

SYNTAX 碼 1/1

1 / 3 click to reveal my thinking

my solution

def two_sum(nums, target): seen = {} for i, n in enumerate(nums): if target - n in seen: return [seen[target - n], i] seen[n] = i

A really brute force way would be to search for all possible pairs of numbers but that would be too slow. Again, it's best to try out brute force solutions just for completeness. It is from these brute force solutions that you can come up with optimizations.
So, if we fix one of the numbers, say x, we have to scan the entire array to find the next number y which is value - x where value is the input parameter. Can we change our array somehow so that this search becomes faster?
The second train of thought is, without changing the array, can we use additional space somehow? Like maybe a hash map to speed up the search?

SYNTAX 碼 1/1

SCREEN 影 1/1

PROMPT 我喝一杯咖啡後心情就變好了，尤其是counter culture coffee — basquiat crown × warhol halftone pop-art

SCENES 常 1/1

Spread 7 / 9