![]() |
VOOZH | about |
There were two medium-to-hard-level questions. I solved both questions in 15 minutes. Fourteen students were shortlisted from my college, and I was one of them.
First, the interviewer asked me a coding question similar to this one (https://www.geeksforgeeks.org/dsa/partition-a-set-into-two-subsets-such-that-the-difference-of-subset-sums-is-minimum/). The question had additional constraints related to the frequency of elements, such as ensuring that an element present in one set should not be present in the other set, and minimizing the absolute difference between the two sets.
I was unable to implement a complete solution, managing to pass only four test cases (the interview was conducted on the HackerRank platform). However, I was able to explain my logic.
After that, they asked questions related to my project:
They also asked about my hobbies.
Finally, they asked if I had any questions, so I asked a couple of questions related to the interview process.
Verdict: Selected
Thank you.