Round 1 (Online Test):
- 30 MCQ questions (Data Structures, Few aptitude questions) Easy to Medium level.
- 1 Coding question (String-based) Easy level.
- Find the minimum number of characters to be removed to make a string Magical:
Magical: The length of the string should be even and the first character should differ from the second, the third character should different from the fourth, the fifth character should different from the sixth, and so on
- Find the minimum number of characters to be removed to make a string Magical:
Example:
S = “good” Output: 0
S = “abaab” Output: 1Out of all 26 got selected for Round 2.
Round 2 (Technical Interview 1): Initially, the interviewer introduced himself and asked me to give a self-intro, Then straight away jumped into problem-solving He gave me total 3 questions
- Pair swap in a Linked List (https://www.geeksforgeeks.org/pairwise-swap-elements-of-a-given-linked-list) I gave a recursive approach and he was satisfied.
- Area of a circle, rectangle, and triangle with given inputs.
- Implement a binary tree and print the left view of the binary tree (https://www.geeksforgeeks.org/print-left-view-binary-tree) I gave BFS the approach and he was satisfied.
- He asked me to explain stacks and queues and their practical applications.
- And asked me to explain my project in detail and asked some questions about it.
This round happened for 1 hour. The difficulty of the questions completely depends on the panel. Out of 26, around 12 got selected.
Round 3 (Technical Interview 2): It is similar to the first technical round. He asked me to give a self-intro and asked me to explain my project in detail. Some basic questions on JAVA:
- What is final, finally and finalize keywords in java
- What are access modifiers, their types, and their differences?
- Some basic OOPS questions
Questions on DBMS
- Primary, Composite, Foreign and Super keys.
- Types of relationships.
- Relationship between user and hashtags in social media (Many to Many).
- Then as usual he started giving coding questions
- Implement a doubly linked list with functionalities like adding nodes at the end and beginning, removing nodes at the end and beginning, adding at an index, and removing at an index.
- A sorted array consisting of n numbers to find the missing numbers, the missing number is
If arr[] = {2, 3, 6, 7, 8, 9, 12} then the missing numbers are {4, 5, 10, 11} and the expected time complexity is O(N). I gave an iterative approach and he accepted. - Given an unsorted array of integers, print the longest consecutive elements sequence
arr[] = {30, 1, 5, 2, 31, 4, 16, 32, 29} then the largest consecutive sequence is {29, 30, 31, 32}
(https://leetcode.com/problems/longest-consecutive-sequence) - I gave a sorting approach and he asked me to optimize it. I gave HashSet the approach of time complexity O (N) and he was happy with that.
- Then some theory questions on SDLC (Software Development Life Cycle). It’s new to me so I said: “Sorry sir I am new to this topic, Thank you for introducing me to this, I’ll definitely work on it”. So he moved on.
This round happened for one and a half hours.Out of 12, 3 were selected for the next round.
Round 4 (Technical Interview 3): This round happened for only 15 minutes. He gave only one coding question on Strings (Hard level)
- Given two strings, print all common substrings.
a = “abcdef” b = “defxa” Output: “a”, “d”, “de”, “def”, “e”, “ef”, “f”
I gave a solution by generating all possible substrings of these strings and finding the common ones. Time complexity and Space complexity: O (length (a)!) + O (length (b)!) He was not happy and asked me to optimize it. So I gave DP tabulation approach of time complexity of O (length (a) * length (b)!) He was happy with that.
Out of 3, all three were selected for the HR round.
Round 5 (HR Round): I think this is not an elimination round. She asked some basic questions:
- Tell me about yourself.
- Short-term and long-term goals.
- Why Accolite digital?
And she told me about company policies, package discussions and about agreements, and bonds. All three were selected.
Verdict: SELECTED