L3 Assessment - Dictionary Data Structure

Problem 1

Use your own words, explain what is a dictionary data structure.

Problem 2

Can a key in a dictionary have duplicates?

Problem 3

What is the time complexity of accessing a key and its paired value in a dictionary?

Problem 4

Write an if else statement that check if the key "cherry" exist in the dictionary.

grocery = { "orange": 27, "mango": 10, "cherry": 43 }

Problem 5

Write a program that stores all keys in a dictionary into a list.

Example:

dict = { "Andrew": 27, "Kevin": 35, "Rapi": 18, "Dola": 29 }

# expected values in the list
keys = ["Andrew", "Kevin", "Rapi", "Dola"]

Problem 6

Write a program that flips the keys and its associated values. You can assume there will be no duplicate values.

Example:

dict = { "Andrew": 27, "Kevin": 35, "Rapi": 18, "Dola": 29 }

# expected dictionary
flipped = { 27: "Andrew", 35: "Kevin", 18: "Rapi", 29: "Dola" }

Problem 7

Leetcode: Two Sum

Given a list of integers

Your solution has to have a linear time complexity

Problem 8

Leetcode: Contains Duplicate

Given a list of integers

Your solution has to have a linear time complexity

Problem 9

Leetcode: Find the Difference

Given two stings

Find the letter that was added to