Q: Rapid fire of Core subjects (they really focus on it) Q: You are given n servers with different capability. Each server[i] represent the time taken by ith server to run an alogrithm completely. You can schedule another instance of same algorithm on the same server just after the execution of current algorithm. For eg. server[i] = 2s, so you can successfully execute algorithm at 2s, 4s, 6s so on (starting at time 0). You have to find minimum time in which total k algorithm are executed. Q: Simple DP problem (House Robber Type) Q: Design real-time Google Docs. Q: Solve producer-consumer in 1 lock and 0 lock. Q: Advance topics of OOPS. Q: Simple DSA. Q: Computer organization, L1 L2 L3 cache