Great opportunity to learn and grow.
A stressful and fast-paced environment.
The interview began with mutual introductions and quickly transitioned into technical topics. I was asked to explain Trees vs. Graphs and their differences. Then came two DSA problems: * One on greedy scheduling (N meeting rooms + merging overla
I participated in a coding round, but unfortunately, I couldn't make it to the next stage and was eliminated. Despite my efforts, I wasn’t able to clear the round and advance further in the selection process. It was a learning experience, and I hop
Questions were fully based on data structures, mainly focusing on linked lists and trees. Time complexity and space complexity were asked in each question, along with ways to improve them and find optimized solutions.
The interview began with mutual introductions and quickly transitioned into technical topics. I was asked to explain Trees vs. Graphs and their differences. Then came two DSA problems: * One on greedy scheduling (N meeting rooms + merging overla
I participated in a coding round, but unfortunately, I couldn't make it to the next stage and was eliminated. Despite my efforts, I wasn’t able to clear the round and advance further in the selection process. It was a learning experience, and I hop
Questions were fully based on data structures, mainly focusing on linked lists and trees. Time complexity and space complexity were asked in each question, along with ways to improve them and find optimized solutions.