Online Assesment
Question 1: Question on string subsequence [Easy]✅
Question 2: Monotonic Stack and string (https://leetcode.com/problems/construct-smallest-number-from-di-string/description/)✅

Round 1
Question 1: String [Easy]✅
Question 2: Find the Shortest path from 1 city to another [Medium]✅

Round 2
Question 1: Find minum number of moves needed in Chess to move bishop from (x1,y1) to (x2, y2) if not possible return -1

• solved using dfs but it was a simple observation based question
  solution:
  if color of source and target doesn't match its not possible to reach return -1
  => abs(x1-x1)%2 == abs(x2-y2)%2
  otherwise if y2-y1 == x2-x1 return '1'
  else '2' as we can always reach same color in at most 2 move.
  if target is placed diagonally to source then in 1 move it can be reached otherwise it takes 1 more turn to reach the target.

Verdict: [Rejected]

PS: I don't play chess, just bought a new one, hopefully i'll clear next time. 😆