J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez Carta en mai 2017
Entretien
First an HR call to ask about your background. Then a 1.30 hrs face to face coding round involving 2 questions. Focus on code re-usability and OOPS. Got the rejection a week later in spite of executing everything. Don't know why.
Autres retours d’entretien d’embauche pour un poste comme Python/Django Full Stack Developer chez Carta
J'ai postulé en ligne. J'ai passé un entretien chez Carta (Seattle, WA) en juil. 2017
Entretien
Applied, quick 30 min chat with CTO, 1.5 hour tech challenge via screenshare, 4 hour on-site interview with 2 more similar tech challenges, follow up call with CTO for clarifications, received offer about a week later. The overall interview process was pleasant and well managed.
However, the offices are packed with employees. Work hours are set to a strict 8-5 with 8:30 meetings every day. You are only allowed a half-hour to one hour lunch around noon so it's pretty hard to escape to the gym or break up your day (I asked about this several times). The catered lunch seems there to keep everyone on-site and ensure a minimum 45+ hour on-site work-schedule. They called it "sports team mentality." Offer was low and the company said they do not negotiate "to be fair to other applicants." I think the company would do better to hire fewer engineers, pay them better, and give them some work-life balance and flexibility.
J'ai postulé en personne. J'ai passé un entretien chez Carta (Palo Alto, CA) en mai 2017
Entretien
I experienced a phone interview, online technical screen, and onsite 4-hour interview. They only asked applicable technical questions - no contrived algorithms or logic questions. With inperson interview, first spoke with someone from the Product team who asked about questions relating to my product vision abilities, then a technical screen reviewing a project and working on a coding question, then lunch with an engineer to discuss company culture.
Questions d'entretien [1]
Question 1
Given a list of unsorted numbers and an integer (n), return the n biggest and n smallest elements from that list of numbers.