Round 1:\nWrite Java code for below, my approach was to build a graph and then compute the in degree of all the vertices then ask was to implement it in < O(V) time complexity\n/** \n\n\tsubordinate, manager\n\tA, C\n\tB, C\n\tC, F\n\tD, E\n\tE, F\n\tF, F\n\n\tcountReports(employeeId) -> num // sum of direct and indirect reports for employee with id=employeeId\n\n\teg. \n\n\tA -> 0\n\tC -> 2 // A, B\n\tF -> 6 // C, E, F, A, B, D\n\n\tAsk:\n\t * implement countReports\n\t \n\t*/\n\t\nRound 2: Add Strings "19999+1" similar to https://leetcode.com/problems/add-strings/\nRound 3: Search in rotated sorted array\nround 4: Hiring Manager\'s Behavioural round

Round 1:\nWrite Java code for below, my approach was to build a graph and then compute the in degree of all the vertices then ask was to implement it in < O(V) 