# Job Description\nCompany - Google\nBatch - 2026\nRole - SWE Intern (2 months)\nOncampus (Tier 1.5 Clg)\nStipend - 1.23L per month\n\n## OA\n\nThere were 2 questions - I could only partially solve both of them. \n\nQ1 - https://www.chegg.com/homework-help/questions-and-answers/collection-items-n-items-item-1-q86924479\n\nQ2 -\n```\nYou are given an array A of size N. A triplet of three numbers A[i] A[j], A[k] is said to be good if the following conditions are met: i < j < k\n\n- For every p(i < p < j) A[p] < A[l] and A[p] < A[j]\n- For every q(j < q < k) A[q] < A[j] and A[q] < A[k]\n\n\nTask\nAmong all possible triplets which are good, determine the maximum possible distance between A[i] and A[k]. Distance between two numbers say A[x] and A[y] in an array is |x - y|\n```\n\n## Interview Prep\n\n30 students were shortlisted for interviews which I believe was random as there were people with 0 testcases passed and there were also with 1.5/2. So if you don\u2019t make it, it\u2019s not your fault.\n\nA session was conducted by Google for students of a couple of colleges who were shortlisted, here we were clearly told that only DSA questions would be asked and you are expected to write clean and optimized code.\n\nI prepared DSA by doing past year interview questions of Google on Leetcode. You may find it here - https://github.com/jobream/Leetcode-Company-Wise-Problems\n\n## Interview - Round 1\n\nThe interviewer had my resume opened and the interview started with my introduction. We had a brief conversation over it and then the interviewer shared a google doc with me and pasted the first question. \n\nIt was a pretty easy question related to strings and hashing, I initially started with an O(n^2) approach and then after a bit of cross questioning finally gave an O(n * logn) answer. The interviewer seemed satisfied and extended the same question further, I answered them easily and the round ended over there.\n\nI was informed about my next round in about 10-15 mins, the next round was after an hour so I just tried to relax a bit and stood calm.\n\n## Interview - Round 2\n\nRound 2 interviews are generally taken by a senior interviewer, that was also the case here. After the introductions the interviewer gave me the following question - \n```\nGiven below pattern of license plates (Pattern only, not the actual list of license plates), Find the nth license plate\nAll license plates no are of size 5 chars\nEg, if n is 3, ans is - 00002\n\n00000\n00001\n00002\n........\n........\n99999\n0000A\n0001A\n0002A\n........\n.........\n9999A\n0000B\n0001B\n0002B\n.........\n.........\n9999B\n0000C\n........\n........\n9999Z\n000AA\n001AA\n.........\n.........\n999AA\n000AB\n..........\n..........\n999ZZ\n00AAA\n........\n........\nZZZZZ\n```\nI told the approach and we had a long discussion regarding it after which I was asked to code it. By covering multiple edge cases I had complicated my approach a lot and was facing difficulties in writing it down. \n\nBut I somehow managed to code it and the interviewer gave me a couple of test cases. The approach passed those cases but then he would think a bit and generate a new test case. \n\nThis kept on happening and I was not able to dry run the code for all the test cases that he gave me. I asked him hints a lot of times but he was rigid and told me to just think more. \n\nOn this note the interviewer ended the interview and I was sure enough that I am getting rejected. \n\n**Final Verdict - REJECTED**

Job Description\nCompany - Google\nBatch - 2026\nRole - SWE Intern (2 months)\nOncampus (Tier 1.5 Clg)\nStipend - 1.23L per month\n\n## OA\n\nThere were 2 quest