Round 1
Questions:
DSA Question: Group Anagrams (LeetCode 45)
Problem: Given an array of strings, group the anagrams together. Anagrams are words that can be rearranged to form one another.
Example Input:
["eat", "tea", "tan", "ate", "nat", "bat"]
Example Output:
[["bat"], ["nat", "tan"], ["ate", "eat", "tea"]]
Candidate's Approach
I approached the problem by using a HashMap to group strings that are anagrams. By sorting each string and using the sorted string as a key, I was able to group all the anagrams together efficiently.
Interviewer's Feedback
The interviewer gave me positive feedback on both my approach and implementation.
Java Technical Questions After solving the DSA question, the interviewer asked me a few Java-related questions to assess my understanding of the language and key concepts. Some topics included:
- Object-Oriented Programming (OOP) principles
- Java Collections Framework
- Exception Handling
- Multithreading
I was able to answer all the Java questions confidently, and the interviewer seemed satisfied with my responses.
Interviewer's Feedback
The interviewer appreciated my responses to the Java-related questions.
Outcome I received positive feedback from the interviewer at the end of the interview. They appreciated my approach to solving the DSA problem and were happy with my responses to the Java-related questions. However, I did not move on to the next round.
While I’m not sure of the exact reason, I’ve reflected on the experience and am determined to continue improving my problem-solving skills and technical knowledge. Interviews can be a learning process, and I’m grateful for the opportunity to have interviewed with Flyin.com. It has only motivated me to prepare more thoroughly for future opportunities.
This experience has been a great reminder that every interview is a step towards growth, and I’m excited about what’s next! 🙌