Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso TrialPay nel mese di mag 2013
Colloquio
Finished a couple of technical questions before phone interview. A phone interview was arranged then. After the phone interview, it's an onsite 1:1 interview. My 1st interviewer told me "good luck" and told me stop the interview here after an one-hour design question discussion. Although I felt positive on my performance on this design problem, the interviewer rejected to provide feedback about my answer.
Pros: HR recruiter is very responsive.
Cons: No feedback.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso TrialPay (Mountain View, CA) nel mese di mar 2016
Colloquio
Total of 3 interviews: 1 telephonic interview, a code test, and an on-site interview which takes around 4 hours. The first interview was phone screen, just about getting to know you and if you are a potential candidate. Second interview was a code test, and the on-site interview included answering a variety of questions about algorithms and problem solving as well as whiteboard code tests.
Domande di colloquio [1]
Domanda 1
If you had a file system, how would you program the logic/ algorithm to find a certain file when you have multiple directories and the contents of all the files are unknown.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso TrialPay (Palo Alto, CA)
Colloquio
1 phone interview with the recruiter for cultural fit. 1 technical phone screen with an engineer. 1 on-site visit (4 technical interviews, lunch break, and coffee break).
Domande di colloquio [1]
Domanda 1
Given a dictionary of terms ('m' total terms with an average length of 'k'), and a large string (without any whitespace and of length 'n'), create an algorithm that finds when the terms in the dictionary are substrings within the large string such that (1) you can only visit/consider each character in the large string once, (2) 'n' is so large that you do not have the space to create any data structures based off the large string
