I applied through other source. The process took 1 day. I interviewed at OpenText (Bengaluru) in Jun 2018
Interview
Hecker Rank (if you give or not give no impact)
written test -formality
F2F : Interviewer just want to listen the answer whatever he is knowing . technically zero
Interview questions [1]
Question 1
1.Implement queue using two stack (famous interview question)
2.find the anagrams maximum count {"aab", "baa","aba","abc"} that he was asking me to order of n. I have suggested different algo like Trie ,wordMap ,etc but he asked me to algo in o(n) ,i don't think so possible .if somebody know in o(n) share the code with me.
3.given array {10,20,12,10,18,2} etc find the sum of two element 20.
4.find the given no in binary tree ---my answer is level order traversal ..but he doesn't understand he want different solution.
5.continous data stream find the given word ...i have suggested maximum heap implementation and trie
The online assessment consisted of 15 multiple-choice questions and 2 DSA coding questions. The first coding question was based on the Longest Common Prefix problem, which was of easy difficulty level. The assessment was conducted online as part of the campus recruitment process.
Total thress rounds
1: Techical with DSA
2: Techical With DSA
3: Tech + maangeral round :
i was omplted the one and two rounds but at 3 rd round went off
I applied through an employee referral. I interviewed at OpenText
Interview
3 rounds of technical interview focused on data structure, system design, knowledge on technical stuffs as in Java, Spring Boot, Docker etc, and 1 manager mainly focused on how you will handle pressure and tackle production issues.