Round 1 -> DSA

1. Diagonal traversal

• approached using dfs (want more optimised)
• give solution using queue and right traversal

2. A Array of points(x, y) is given u can go either vertical or horizatal in one go . Need to return minimum points required to connect all points.

Round 2-> LLD
TASK Scheduler
- // depedencies // it has dependecy on other should not be done that way
// priority( 1,2,3 ) // highes priority shoub be picked first
// retry(if task failed 5 times)
// cancel (all of the dependent task should be executed first)
// parallleize
// history
// cicular dependency protection (last thing to check)

  these things to maitain 
  not able to run the code after finishing code 

Round-> don't think they will contact me