Solve two algorithm problems from a menu

Choose two problems from an algorithms menu (arrays, strings, hash maps, graphs). For each:

1. state clarifying assumptions,
2. implement a correct solution in your preferred language,
3. analyze time and space complexity,
4. provide tests for edge cases and large inputs, and
5. discuss alternative approaches and trade-offs.