CEVA Algorithm / Compiler Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 6 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at CEVA.
CEVA
Compiler Engineer
Mid Average Neutral experience Decline offer 6 rounds
Interview process
Recruiter call Technical screen Technical screen Technical screen Background check Offer
Interview formats
Technical Behavioral
So the interview process involved a phone call first, then 3 technical interviews, then an HR interview, and then finally an interview with the VP. If all went well, they offered me the job.
Confirmed questions2 questions
- Could you start by telling me about yourself?
- Can you describe your final university project?
CEVA
Compiler Engineer
Entry Difficult Positive experience No offer 1 round
Interview process
Technical screen Take home
Interview formats
Coding Technical
They were really nice people, we talked about my university projects, then we moved on to coding questions. The interviewer left the room, and the test took about 1.5 hours. Afterwards, they asked about time complexity and potential improvements.
Confirmed questions4 questions
- Write code to remove duplicates from an array.
- Implement a function to find the longest substring containing exactly two unique characters.
- What is the time complexity of the algorithm you developed?
CEVA
Compiler Engineer
Entry Difficult Positive experience No offer 4 rounds
Interview process
Technical screen Technical screen Recruiter call Recruiter call
Interview formats
Technical Behavioral
The interview process involved two technical interviews at CEVA offices in Hertzelia, followed by interviews with the CTO and HR. The process was quite quick and generally felt okay. They didn't ask about my previous projects and went straight to technical questions.
Confirmed questions1 question
- Given an NxN matrix of positive integers, find the path from the top-left cell (0,0) to the bottom row that yields the maximum sum, with allowed moves being only down or down-right.
CEVA Algorithm / Compiler Engineer Interview Questions
Quoted word for word from CEVA interview reports.
“Implement a function to find the longest substring containing exactly two unique characters.”
Read reports →“Write code to remove duplicates from an array.”
Read reports →“Given an NxN matrix of positive integers, find the path from the top-left cell (0,0) to the bottom row that yields the maximum sum, with allowed moves being only down or down-right.”
Read reports →“How can you check if two variables are equal using only INC, DEC, JNZ, and END instructions in an Assembly-like language?”
Read reports →“How can we optimize an algorithm involving two functions with given cycle counts?”
Read report →“Can you analyze the time complexity of this code and suggest optimizations?”
Read report →“What would be the output of this code snippet?”
Read report →“What is the time complexity of the algorithm you developed?”
Read report →“Are there any more optimal solutions or improvements you can suggest?”
Read report →Formats, difficulty and experience
Across all 6 CEVA interview reports.