YOE: 4 years\nInterview Dates: March, April 2022\nPosition: Frontend Engineer\n\n**Phone screening**: DSA\nGraph based problem. Need to balance a graph where one vertex has a value and need to distribute equally to all neigbouring vertices.\n* It went well and proceeded to onsite interviews.\n\nOnsite interviews were 5 interviews 45 minutes each:\n\n**Round 1**: Googleyness\nInterviewer was nice. Standard past experience and behivoural questions.\n* I think it went well.\n\n**Round 2**: DSA\n2D array based problem. Given 2 lists, need to merge depending on value and sort depending on weight.\n* I was able to provide a solution but not the optimal one.\n\n**Round 3**: DSA\nArray/Recursion based problem. Same like first bad version problem but a bit harder and tricker than it.\nhttps://leetcode.com/problems/first-bad-version/\n* Nearly optimal solution just needed to make it recursive.\n\n**Round 4**: DSA\nNumber based problem. It had 3 questions. First, find if the number is lucky number, next lucky number for this number and every lucky number between 2 given numbers.\n* It didn\'t go well. I gave a solution but not optimal and had hard time to find a good one.\n\n**Round 5**: DSA\nMatrix based problem. Same like Shortest Path in a Grid with Obstacles Elimination.\nhttps://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/\n* Was able to provide an optimal solution for it.\n\n**Verdict** : Reject\nGot an email after 3 days from HR, still waiting for a feedback from their side.\n

YOE: 4 years\nInterview Dates: March, April 2022\nPosition: Frontend Engineer\n\nPhone screening: DSA\nGraph based problem. Need to balance a graph where one ve