Goldman Sachs Interview Experience (2+ years Experienced) Last Updated : 26 Nov, 2019 Improve Improve Like Article Like Save Share Report Round 1: Hacker Rank It’s a Dynamic Programing based problem, don’t remember the exact question. There was also another easy question related to recursion. After a month, I was scheduled coderpad round: Round 2: Online coderpad round Given a string like ‘UUUDULR’, need to derive the final coordinates starting from (0, 0). This is pretty easy and he is asked to add a few other test cases if I would like to. Not much to add as it is not having any corner cases. Given a dictionary, and a list of letters ( or consider as a string), find the longest word that only uses letters from the string. Like Article Suggest improvement Previous Goldman Sachs Interview Experience Next Allgo Embedded Systems Interview Experience Share your thoughts in the comments Add Your Comment Please Login to comment...