3 Rounds total ( 2 coding and 1 behavioural)

Round 1 (Coding):

1. Similar question like https://leetcode.com/problems/simplify-path/. I had 2 inputs - Change directory (cd) and current working directory (pwd). Output: Absolute path by cd from pwd.
2. https://leetcode.com/problems/maximum-swap/

Round 2 (Coding):

1. https://leetcode.com/problems/valid-palindrome/
   Follow up 1: if a specific charset needs to be matched (a,e,z) and exclude anything else. How would you do it? (Use a hashset for charset to be matched).
   Follow up 2: if a string is infinitely large and you cannot load it all in RAM and can only access blocks of string which will contain some k contiguous chars. (Access 1st and last block and keep checking)
2. https://leetcode.com/problems/subarray-sum-equals-k/

Round 3 (Behavioural):

1. Dive deep in previous work experience and college projects.

Got Rejection. Behavioural didn’t went well. Common feedback in coding about duplicacy of code.