Google

Round 1 (Phone Screen): Given an array of integers, find the length of the longest subarray with sum equal to 0. (Used prefix sum + hashmap approach.) Round 2 (Technical Interview): Given a binary tree, return the diameter of the tree (longest path

1 telephonic round/screening: * Contains a DSA question (45 minutes). 3 online/onsite technical rounds (45 minutes each): * Emphasis on optimal solutions and approaches. * The last round's difficulty level was increased. * Focus was on edg

I had a 5-round virtual onsite interview. I failed in the coding part, specifically on a DP programming problem. I also performed poorly in the second system design interview round. Obviously, I did not prepare well for this interview, including Lee