I was asked two coding questions as part of OA for 90 minutes.\n\n1. Straightforward String comparison question. Initially I coded O(n ^ 2 * string len) solution but I got TLE for 2 test cases. I submitted and came back after problem 2 to optimize this. Just used a hashtable to arrive at O(n * string len) solution and all test cases passed successfully.\n\n2. Given an array, find the number of sub-arrays whose max - min value <=k. (There is a leetcode problem but I could not find the link). I was able to complete it using sliding window + monotonic queues.\n\n A general piece of advice is go over the recent OA questions shared in the leetcode community. The recent trend has been array questions being frequent.\n\nGot a mail about proceeding to virtual onsite. Now time to grind the LPs and prepare LP cases.

I was asked two coding questions as part of OA for 90 minutes.\n\n1. Straightforward String comparison question. Initially I coded O(n ^ 2 * string len) solutio