Round 1 (Screening Round): This was a HackerRank test with 4 coding questions to be solved in 90 min. It had 1 easy, 2 medium, and 1 hard coding question. Round 2 (Technical Interview): The interviewer asked multiple approaches to one coding problem. It was more like a discussion and the interviewer wanted to judge my thinking process and communication skills. The question was, Given 2 password arrays password_arr1 and password_arr2, where password_arr1 is the list of passwords previously used and password_arr2 is the list of passwords that are to be queried. Return the array indexes representing the time when the passwords in the password_arr2 array were last used. Note that the password is considered to be used if its anagram exists in the password_arr1 array. For Example, password_arr1 = [‘polo’, ‘neal’, ‘nodl’] , password_arr2 = [‘lean’, ‘ldon’, ‘loop’]. So the last times the passwords were used at [1,2,0], where 0,1 and 2 represent the indices of passwords in the password_arr1 array. Round 3 (System Design Round): Design a tagging system like tags used in LinkedIn. Some points discussed in the interview were: