Hello Guys need help in preparing for the virtual onsite of Goldman Sachs.
I have done with coderpad round (phone screen)
1 - find longest substring with unique character.
2- find minimum subarray with sum greater than or equal to K.

Position - Early career (software engineer) USA
Experience - New Grad (No prior experience)