Hi Everyone,\n\nI was invited for the analyst role at Goldman Sachs with 1st round as a codepair round.\n\nThe first round started with a quick introduction followed by 2 easy DSA questions:\n* Given the integer, return true if it\'s a power of 10 else return false, it got extended to test decimals also, then the interviewer started pushing me to cover all the corner cases.\n* https://leetcode.com/problems/trapping-rain-water/description/, here again i was asked to design and test the code for edge cases.\n\nI\'m comfortable in C++ for CP, but here i was restrained to use Java only, i solved both the questions and got an invite for next 2 rounds after 20 days.\n\nFirst round which was DSA was scheduled from 12-1 and the second round was Software Engineering Practices from 2-3pm.\nBut the interviewer didn\'t turned up at 12, on multiple follow up on recruiter rounds were rescheduled as Software Engineering Practices from 2-3pm &  DSA was scheduled from 3:15-4:15pm.\n\n**Software Engineering Practices:**\n* There were 2 interviewers, with one of them being same as in the previous round and was very sharp at cornering you with edge cases.\n* First question was a DSA, on finding the square root of any integer correctly upto 2 decimal places later the second interviewer asked me to extend this to 20 decimal places for which i answered only long division method will be feasible and i can\'t recall the method as of now.\n* Secondly was a brief project discussion, where he asked me how will i make an autocomplete feature when using a search bar. I convinced him as we are already using DB, we could make SQL query using ***like***, and can later cache making complexity of O(nlogn).\n* Expectation here was to use Trie data structure which could perform the feature in O(n) complexity, but i didn\'t expected goldman sachs to ever ask for Trie and didn\'t studied this.\n\n**DSA round:**\n\n* This was pretty standard and was asked 2 medium DSA questions:\n* https://www.geeksforgeeks.org/minimum-steps-reach-target-knight/\n* https://leetcode.com/problems/longest-increasing-subsequence/description/, expected O(nlogn) solution.\n* I answered both the questions and the second one with O(n^2) complexity.\n\nIt\'s been almost 1 month now since the last interview, the recruiter is not picking up my calls, the application site is still showing my application status as \'Selected for Interview\'. \nPractically i think there is almost no chance for me now.\n\nHope this Helps !!\nHappy Coding !!

Hi Everyone,\n\nI was invited for the analyst role at Goldman Sachs with 1st round as a codepair round.\n\nThe first round started with a quick introduction fol