Gave the rounds of Google for L3 position.\n\n**Phone Screening Round** : A word problem typically to check if we can have two subsets such that their sum are same. (Tough to decode the word problem)\n\n**OA 1** : Given src and dst , find whether information from src can reach to dst, given that an information can only flow if distance between nodes is less than a threshold value. Follow up --> find the minimum distance between src and dst if it is possible to reach.\n\nMyApproach 1 : Simple BFS . (either make edges satisfying the threshold value , or while doing BFS use the threshold condition.)\n\n**OA2**: Given a 2D plane. And a points array having element of the form (xi,yi) . We need to find the count of magical rectangles. A rectangle is called magical if its parallel to x and y axes, also no other point lies inside or on the rectangle. \n\nMy Approach : Brute Force : Fix two points (x1,y1) and (x2,y2) . Now to form a rectangle parallel to axes, other two diagonals would be (x1,y2) and (x2,y1) . Now to find whether any other point lies inside the rectangle I used another for loop (I was not aware of the Line Sweep technique(which gave result whether a given interval intersect with other in O(1)) . Hence my time complexity was O(n^3). \nAfter the feedback received from recruiter : Interviwer was not satified with the brute force approach, he was expecting something else. For this round my feedback was negative.\n\n**OA3**: Two friends, A and B, want to reach a common destination, D. They can either travel separately or meet at an intermediate point to share a cab. The goal is to determine the minimum number of edges that they would share if they choose to meet and travel together. (Not sure if this is the exact question, used chat gpt to generate.\n\n**Googlyness:** Typical behavioural and assumption based questions. \n\nRecruiter gave positive feedback for all rounds except round 2. Overall feedback was positive. Recruiter asked to wait if any Manager shortlists my resume and then may be Hiring Manager Round will take place.\n\nWhat are my chances? Can another DSA round be scheduled as one round\'s feedback was negative?

Gave the rounds of Google for L3 position.\n\nPhone Screening Round : A word problem typically to check if we can have two subsets such that their sum are same.