the technical assessment was a 90-minutes hackerrank test:
- some easy multiple options questions
- one problem solving task
- two machine learning coding problems: one to classify images (30-minutes time) and one to classify phrases (another 30-minutes)
And you cannot revisit a question.
Preguntas de entrevista [1]
Pregunta 1
one task was to implement a deep neural network for classifying images and another task was to implement a deep neural network for classifying phrases
Envié una solicitud electrónica. El proceso duró 2 semanas. Acudí a una entrevista en Adobe (San Jose, CA) en oct 2024
Entrevista
I had 1 interview round. Only one interviewer, but I heard few others has multiple interviewers. It was around 1hr. It will have a simple leetcode easy/medium question for first half an hour. And then he asked me to solve the same DSA question using Machine Learning. he wanted to me explain how I would approach the problem, how would I deal with the data and what algorithms would I use to solve the problem. (It was a array-pointer question)
Preguntas de entrevista [1]
Pregunta 1
Intro, Leetcode problem, ML approach for same problem.
Envié una solicitud electrónica. El proceso duró 3 semanas. Acudí a una entrevista en Adobe (San Jose, CA)
Entrevista
Pretty simple process. Applied through portal. No referral. Pure application shortlisting. Resume got shortlisted-> Coding Round Assessment -> Technical Round + Behavioural Round (Taken by Manager)
Interview was pretty chill, not too difficult
Preguntas de entrevista [1]
Pregunta 1
Coding Round simple mathematical Leetcode based questions followed by Behavioural round asked about previous company role and future prospects
Envié una solicitud electrónica. El proceso duró 4 meses. Acudí a una entrevista en Adobe en oct 2025
Entrevista
Applied online without referral. First round HackerRank assessment. Second round was a virtual 75 minute technical interview with manager and team member. 15 minutes for resume review. 1 hour for technical portion.
Preguntas de entrevista [1]
Pregunta 1
Implement k nearest neighbors from scratch. Was given a "whiteboard" and an area to write text into.
