I applied on the portal directly for SSE Backend\nYOE: 4\n\n**Round 1: Coding**\nQ1: Difference of frequencies between most frequent and least frequent\nQ2: Coin change dp, fumbled a bit but solved it correctly in the end\nSolved both, gave TC and SC.\n\n**Round 2: Architecture**\nDesign Top K heavy hitter problem with log aggregation and low latency requirements.\nWent really well according to me\n\n**Round 3: Culture fit (with EM)**\nBehavorial questions based on different scenarios. Was a good interaction overall.\n\n**Round 4: Coding (with HM)**\nQues 1: Sort array based on square of integers\nSolved optimally, but thinking of all the edge case and tests was a bit difficult. Had a discussion around thinking of more edge cases.\nQues 2: Top k frequent\ngave PQ approach, he wanted more optimized code, I was not able to recall quickselect code. Then time was almost up with all that discussion around optimization, and the code gave NPE somewhere as well. Couldn\'t debug it in last 2 mins.\n\n**Overall**: Good experience, but due to last question of the last round, I don\'t think I will get selected. Will update once and if they get back.\n\n**Update:** Surprisingly, I got selected :D\n

I applied on the portal directly for SSE Backend\nYOE: 4\n\nRound 1: Coding\nQ1: Difference of frequencies between most frequent and least frequent\nQ2: Coin ch