Coding 1: https://leetcode.com/problems/word-ladder-ii/ - Return any one sequence, optimize the solution for visiting only relevant paths with shortest distance
Coding 2: Implement a leaky bucket rate limiter method - shouldAllowRequest()-> it is to be used for concurrent calls by request which would be processed if returned true. No threading to be used , only concurrency - synchronized, locks etc...
Coding 3: This was a 2 hour coding. Essentially you need to have classes and unit test and need to use your own IDE. Shoul run it with taking input from prompt- Implement In-memory database:
GET(key) - O(1)
SET(key, value)- O(1)
GETCOUNT_OF_VALUES(value) - O(1) - count the number of times value is in database

BEGIN - O(log N) - Can be nested, can begin multiple traansactions before commiting.
COMMIT - O(log N) - commit all the transactions to databse
ROLLBACK - O(log N) - Rollback only single transaction began in memory if present else return NULL

Technical Deep Dive: Talked about a project that you have done
Behavioral Questions