Amazon

amazon: Round 1: simple sliding window leetcode direct question given 0s, 1s, and k - the maximum number of 0s that can be flipped. Find the longest length of consecutive 1's that can be obtained. Another question was given a matrix with rows sorted and columns sorted; search for an element , then project and behavioural questions. Round 2: implement lru cache. I had to write a linked list implementation(class) and then answer behavioural questions.