I underwent three technical interviews focusing on my coding and algorithmic skills.

The interviews didn't involve overly complex tasks.

However, I faced difficulty in the third interview, as I was anticipating architecture-related questions instead of another coding stage.

1. Calculate the maximum length of consecutive 1s in an array when removing one element (deletion is mandatory).

Example: [1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1]

In this case, the result is 6.

1. Given two arrays of the same size, return an array of the same size where each element represents the count of identical elements between the two arrays. Identical elements within the same array are not counted.

Example 1: array1: [0, 2, 4, 1, 3, 6, 5] array2: [2, 1, 0, 3, 2, 2, 3] result: [0, 0, 0, 0, 0, 0, 0] (Note: The example provided in the original text seems to have an error in the expected output. The calculation based on the description would yield an array of zeros if no identical elements are present at the same index across the arrays.)

Example 2: array1: [0, 0, 0] array2: [1, 1, 1] result: [0, 0, 0]