Arm Embedded Technologies interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Arm Embedded Technologies

1 rounds | 1 Coding problems

Shefali Yadav

Experienced | Nov 2022

Rejected

Interview preparation journey

Journey

I started my coding journey when I was in the 6th standard. I began with Java programming as part of my curriculum at school since I was an ICSE board student. As I progressed through my school years and into college, I continued to study DSA and competitive programming in Java. I also worked on machine learning projects during my time in college as part of my research and development activities.

Application story

I received this opportunity through my campus placement drive. First, we were shortlisted based on our resumes, and then an online test was conducted, consisting of two DSA-based coding questions and basic MCQs. The students who solved both questions were shortlisted after the test. Following this, they conducted an online interview that focused on basic programming, OOP concepts, and other computer-related questions.

Why selected/rejected for the role?

I was rejected for this role in the final round of the interview process because they needed someone with proficiency in programming in C++.

Preparation

Duration: 12 Months

Topics: Programming in Java and Python, Machine Learning, Data Structures and algorithms, Web development, Dynamic Programming, Backtracking, sliding window.

Tip

Tip 1: As a fresher, include at least two projects on your resume.
Tip 2: You should have a clear understanding of data structures and algorithms and be proficient in at least one programming language.

Application process

Where: Campus

Eligibility: 70% Throughout

Resume tip

Tip 1: Mention the skills in which you are fluent.
Tip 2: Include a minimum of two projects.

Interview rounds

Round

Easy

Video Call

Duration30 minutes

Interview date18 Nov 2022

Coding problem1

1. Search In The Array

Easy

15m average time

85% success

0/40

Asked in companies

You are given two arrays ‘arr’ of size ‘n’ and ‘queries’ of size ‘q’. For each element ‘q’ in the array 'queries', your task is to find the sum of all elements in the array ‘arr’ which are less than or equal to ‘q’.

For example: given array ‘arr = { 1, 2, 3, 3, 4, 5, 6, 7, 9, 10}’ and ‘ queries= { 3, 5}’

Then the sum of all elements whose value is less than or equal to

‘queries[0] = 3’ is ‘ 1+2+3+3 =9’.

‘queries[1] = 5’ is ‘1+2+3+3+4+5 =18’.

You have to return the answer of every query { 9, 18}.

Problem approach

Step 1: First, I suggested the linear search approach, but it was not efficient.

Step 2: Then, I proposed the binary search approach.

Step 3: I would find the middle of the array and divide the array into two halves.

Step 4: I would check if the element is smaller than the middle element; if so, I would search in the first half; otherwise, I would search in the second half.

Step 5: The array must be sorted for this approach to work, but it provides the desired output with optimized complexity.

Try solving now