Assessment: frog question Phone: 1. simple logic question to start off: you have 4 pieces of paper in front of you, and each paper has a number on one side and a letter on the other. You currently see the following arrangement: [1] [2] [x] [y]. I assert that any paper that has an x also has an even number. What's the min num of papers to flip around to confirm or deny this? 2. Was asked an incrementally difficult question, i.e. design something simple then make optimizations to it. Initially was asked to describe a DS that held key-value pairs. Then I was asked to make various optimizations to the storage scheme for this DS given various constraints. For example, how am I storing these in memory? What if the size of our data is much larger than our memory address space? In this case, how do we minimize reads on disk? What if the size of each key-value pair doesn't fit within one memory address? etc. etc.