Tier 1 College
On Campus
3 technical Rounds + 1 HR Round

1 Round
Coding Question:
Given a vector of strings you have to find the number of complementary pairs.
A complementary pair is if you concatenate a string at ith position and jth position such that (i!=j) if any permutation of the string is palindrome then (i,j) is complemetary pair.
Output the number of complementary pairs.
(i,j) and (j,i) are treated as same.
I/P: ["aba","abc","d","aa"]
O/P: 2.(aba+aa, d+aa)

Interviewer wanted O(N) approach for this question.

2 Round:
Asked CS fundamental question based on CN, OS, DBMS.

3 Round
Explained Projects and Asked Project Related Questions.