Q1: https://leetcode.com/problems/valid-number/description/\nVariation: Was *slightly* easier, they did not include numbers with exponents (+4e10, 3.6e2, -1.2E5, etc.). But I would reccomend understanding how the logic works when verifying numbers including exponents, and just omit the exponent checks if you don\'t need it.\n\nQ2: https://leetcode.com/problems/lru-cache/description/\nVariation: It did not have a capacity (no need to `pop()` the LRU), it could have any number of (key, value) pairs in the cache. There was an additional `def last()` function which should provide the most recent item that has been `def put()` or `def get()` called on it. Essentially, you should be able to find the *most recently used*, rather than the *least recently used* as this question asks.

Q1: https://leetcode.com/problems/valid-number/description/\nVariation: Was slightly easier, they did not include numbers with exponents (+4e10, 3.6e2, -1.2E5, 