Today I had my coderpad round with GS. We dived straight into the code. This was the **first question**:\n\nA string was given. I needed to find the first non-repeating counter. If there is no such character, return 0.\n\n**Input**: \nasubsebusapd\n\n**Output**: \ne\n\n**Input**: \naabbcc\n\n**Output**: \n0\n\nPretty straight-forward. \n* Used a hashmap to count the frequency.\n* Traverse the array to find the first element with frequency = 1 and return it.\n* If there is no such element, return 0.\n\nThe interviewer did not ask me to optimize it. If anyone has any idea, please comment.\n\n**Second question**:\nhttps://leetcode.com/discuss/interview-question/1837465/Goldman-Sachs-or-Coderpad-or-Find-the-maximum-gold-that-can-be-collected\n\n**Third question**:\nhttps://leetcode.com/discuss/interview-question/1837497/Goldman-Sachs-or-Coderpad-or-Find-the-largest-tree\n\nThanks!

Today I had my coderpad round with GS. We dived straight into the code. This was the first question:\n\nA string was given. I needed to find the first non-repea