My OA had 4 coding questions in 70 mins.

- Given a list of integers, count the number of ‘good tuples’ that can be created. A ‘good tuple’ is defined as connectutive triplets having exactly 2 duplicate elements.
- Given two strings, s and t (consisting of alphanumeric characters), how many ways can you remove 1 digit from either s or t so that s is lexographically less than t?
- Given a rectangular matrix, m, and an int, k, return the sum of the distinct numbers contained in each k by k submatrix that sums to the maximum value.
- Given two arrays of ints, a and b, try to create an arithmetic sequence by adding ints from b into a. Return the maximum length of a or -1 if there does not exist an artimetic sequence.