Codeforces 1133C
LeetCode: Partition Array Into Two Arrays to Minimize Sum Difference
Approach:
Solved the first question using a brute-force approach (O(n²)) and later optimized it to O(n log n) within 25 minutes.
For the second question, I explained the DP-based logic and managed to complete the full code in the remaining 30 minutes.
Verdict: Positive — moved to the LLD round.
Started with a brief self-introduction (~5 minutes).
The interviewer asked me to design and implement a Splitwise.
I spent around 10 minutes discussing functional requirements and identifying key objects.
The interviewer was heavily focused on coding. I started with a UML diagram, but begin to panic due to the too much requirements and limited time.
I managed to start coding in VS Code and implemented partial functionality, but the interviewer expected a fully working application.
Verdict: Rejected.