Good
L1 coding - hackerrank based
Intermediate and hard
P1 - Maximum Length Good Subarray (Python):
Find the longest contiguous subarray with a sum less than or equal to k by using prefix sums and a hashmap to track first occurrences efficiently in linear time.
Domande di colloquio [1]
Domanda 1
Python Questions.
P1 - Maximum length good subarray
Ho sostenuto un colloquio presso Avathon (Austin, TX)
Colloquio
Pretty smooth and average interview with coding/algorithm exercise. The interviewers also asked questions from resume while had some behavorial part as well. I would suggest brushing up on algorithms and data structures because a lot of the interview revolves around it.
Domande di colloquio [1]
Domanda 1
svm/xgboost/random forest, coding about finding the smallest word you can make from a string
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 7 settimane. Ho sostenuto un colloquio presso Avathon (Austin, TX) nel mese di giu 2022
Colloquio
7 weeks from phone call to end. Phone call with recruiter 2x, meeting with heads of engineering, technicals, socials.
Colossal waste of time. The fact that a company can ask to meet with you over 7 weeks just to reject you with no reason given is ridiculous. Add this to the fact that signs of a toxic workplace were subtly noticed in several interviews.