I could't crack it. But you can do it. OA questions will be hard. Expect questions from Leetcode hard level. Same for the string questions also. Practice is needed. POTD and leetcode medium and hard should be solvable
Interview questions [1]
Question 1
You are given a 2D integer array points, where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane.
The Manhattan distance between two points points[i] = [xi, yi] and points[j] = [xj, yj] is |xi - xj| + |yi - yj|.
The interview consisted of 2 technical + behavioral rounds and the last HR round. Easy questions. One round was on campus, while the other was on site. The interviewers are good.
General interview about history of work. Also included technical questions to determine skill level; however, was not extremely difficult or easy -- mid level. Good experience in general -- would recommend.
Interview questions [1]
Question 1
Questions related to development environment (agile/waterfall). Questions on SQL.
