Problem
1st question - given an AP and one element is missing find the missing element. (Shared 3 approaches)

2nd question was - given a grid you can only move right or down find the number of ways to reach the end of the grid.

3rd question - Design a Data Structure, it was iterative approach based on requirements optimised the ds to O(1) reads and O(logn) writes.

Verdict - cleared