Interview Process:

1. First online coding round.
2. Second technical round.
3. Third HR round.

Interview Questions:

1. There is a stream of characters. At any time, we need to find and remove (set occurrence to 0) the character with the maximum occurrence up to that point. Design a data structure and algorithm for this. (I used a standard heap and hash table setup, then was asked if we could replace O(log n) heap operations with something more efficient in a practical scenario. I suggested a doubly linked list and moving characters to the front based on their occurrences.)

2. Given a gold mine of nm dimensions. Each cell in this mine contains an integer representing the amount of gold in tons. Initially, the miner is in the first column but can be at any row i. The miner can move only right (→), right-up (╱), or right-down (╲). Find the maximum amount of gold the miner can collect and the path followed.

3. Given two strings, str and pat. Find the minimum window in str that contains all characters from string pat.