Coding Challenges
1. Isomorphic Strings: Given two strings, determine if each character in the first can be replaced to form the second. Examples: “egg” → “add” (isomorphic), “xyz” → “abc” (isomorphic), “bbb” → “bbc” (not isomorphic).
2. Randomizer Interface (O(1) Operations): Implement methods (e.g., insert, remove) all in O(1). The trick was to swap the element to remove with the last element in the list, then pop the last element.
3. Compressed Vectors Dot Product: Given two integer vectors of the same length, each in a compressed form (e.g., [4, 4, 5] as [(4, 2), (5,1)]), compute their dot product. This was more about mapping and iterating pairs carefully and considering algorithmic complexity.
