Me postulé en línea. Acudí a una entrevista en RetailMeNot (Bengaluru)
Entrevista
A standard interview process which begins with the call by HR and an online coding test and then the technical round. I completed the online coding round and then attended the technical round. The interviewer in the technical round was the most unprofessional one I have seen in my career. He just copy-pasted a question and said solve. No introduction, no collaborative approach and the guy was like a statue without even saying anything. I think this is one of those coders as robots culture. Never expected such strange engineering culture in a product company. Won't recommend spending time interviewing with them.
Anyway, I couldn't solve it and the interviewer was like a statue even to questions as it looks like they expect people to mug up and code and type it like a robot. Got the rejection mail the next day itself. That part at least is good from the HR process standpoint view as many companies these days don't even show the basic decency to inform candidates about interview results.
Me postulé en línea. El proceso tomó 2 semanas. Acudí a una entrevista en RetailMeNot
Entrevista
Applied on their website, got a phone interview within a week or so. They give you a problem and ask you to code online. It is a little bit tricky because there is no intellisense and you have to remember which namespace or package you need to include.
Preguntas de entrevista [1]
Pregunta 1
Given an array of strings ( may have duplicate), split them into multiple sub-arrays such that:
1. There is no duplicate in each sub-array.
2. The number of sub-array is minimum.
Acudí a una entrevista en RetailMeNot (Austin, TX)
Entrevista
Technical Phone Screen with a Manager via browser based scratch pad. Went through 2 or 3 questions and coded them out to sufficient detail (didn't have to explicitly compile and run). Post phone screen went in for a 1/2 day tech screen with 5 people. Back to Back tech screens until the last person all on the whiteboard, very CS heavy (big-O analysis of all solutions and a lot of recursion).
Preguntas de entrevista [1]
Pregunta 1
They had a fair number of recursive problems as well as a Tree problem
