1 st round -> greater element than the target in an sorted array(Impement upper_bound) Nearest zero to one in binary matrix (multisource bfs) good questions on runtime and complile time polymorphism and string pool and string literal. 2nd round :- equibrillium idx of an array left sum== right sum. Height balanced Binary tree Number of islands Core java questions on static and polymorphism , basic spring boot questions, Query param vs path variable HAteos,etc. 3rd round :- Deep project discussion , scaling of APplications, justify the optimisation in the past projects.
