1. How much spacing is required between smoke detectors?
2. How do you check tower load validation?
3. What is the change life cycle?
4. Can you draw a rough sketch of an RCC deck slab and level it?
5. Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1. put(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item. The cache is initialized with a positive capacity.