zippy_crane_9100

Write a function two_sum(nums, target) using a hash map

Write a function two_sum_sorted(nums, target) using two pointers on a sorted list

Write a function is_palindrome(s) using two pointers that checks if a string reads the same forwards

Given pairs = [('ada', 95), ('linus', 82), ('grace', 91), ('margaret', 78)], filter to scores >= 90

Given nums = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3], print the number of unique values

Find the common elements between two lists using sets for efficient O(n) membership testing

Use a dictionary to count how many times each word appears in the list

Complete is_sorted: compare consecutive pairs, returning False if any element is greater than the ne

Find both the minimum and maximum of the list in a single pass using O(1) extra space

Find all values that appear more than once in the list