Use a dictionary to implement anO

$($

n

$)$

$$solution for Two Sum

$($

click the title

$$

Two Sum

$$

to be linked to leetcode

$)$

$.$

$$In particular,place appropriate keys and values in a dictionary so you can use the O

$($

$1$

$)$

$$time

$$

i s an element of

$$

operation

$.$

$$Additional Requirements: Explain how your algorithm work sand why it isO

$($

n

$)$

$.$