OA Round
Questions:
- 1 DSA question, rest MCQs on OOPs, Linux, data structures, data analysis, DBMS, Python, code snippets, etc.
- Specific question not provided.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 1
Questions:
- Tell me about yourself.
- Discuss my work during internship.
- Given a linked list, how can you check if it is a palindrome (do it in-place)? (TC: O(n), SC: O(1))
- Given a sorted array, how can you find the number of occurrences of a given number? (solved, TC: O(log(n)), SC: O(1))
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Introduce yourself.
- Tell me about your project/work (went on to explain a task in which I had to handle time complexity).
- Given a list of strings, return them in groups of anagrams (TC: O(n*k)) (solved, never visited this question before. There is a trick to reduce search complexity when implementing map).
- Given a string, return the number of unique palindromic subsequences with length 3 (solved kinda, TC: O(n^2) worst case).
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3 (HR)
Questions:
- Introduce yourself.
- Talked about my work in previous organization.
- Went into full detail about a certain task (frontend + backend flow).
- Explain one of the challenging tasks of your choice.
- Mention an achievement in your academic life.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.