Round 1 DSA

1. You are given two integer arrays, a of length n and b of length n + 1.
   transform array a -> b with minimum operations.
   You can perform the following operations on elements in
   array a:
   Increment by 1: Increase element in array a by 1.
   Decrement by 1: Decrease element in array a by 1.
   Copy an element from array a to the end of the array a:
   transformation should happen for respective index i.e a[i] should get transformed to b[i]
   For example:

Input 1: a = [1] b = [2, 3] Output: 3
Input 2: a = [3, 3, 3] b = [3, 3, 3, 3] Output: 1 
Input 3: a = [5,2,1,4,6] b = [4,1,5,4,6,7] output : 8

There was an edge case where I got stucked and wasn't able to find that and took a lot of time and despite interviewer warning, I did not able to get the case.

2. Book Allocation: I messed up the solution which I knew of.

Round 2 LLD + HLD

1. Design Leetcode
   Was asked to cover the functional requirements thorugh a diagram.
   [Tried to cover submissions and contest leaderboard]
   And main focus was on how database entites would interact with it, not on the HLD aspect.

Verdict: Rejected