Electronic Arts Software Development Engineering Intern Interview Questions, Process, and Tips

It was an online written round conducted on Coding Game platform. There were 2 sections including 15 MCQ and 2 coding questions.
The MCQs were based on C/C++ output based questions.
In the coding questions, we could only code in C++.

Q1. Return the letter in the string having the highest frequency
Ans. 
The answer is a letter in the string that appears most frequently.
• Iterate through each letter in the string and count its frequency

• Keep track of the letter with the highest frequency

• Return the letter with the highest frequency
Answered by AI
View 1 more answer
Q2. Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
Ans. 
Given a binary matrix, find the largest square containing only 1's and return its area.
• Use dynamic programming to solve the problem

• Create a 2D array to store the maximum size of square at each point

• For each point, check the top, left, and diagonal top-left values to calculate the maximum size of square

• Return the maximum size of square found
Answered by AI
Add your answer

Round duration - 70 minutes
Round difficulty - null
It was a DSA based round in which the interviewer asked me 2 DSA based questions. One was based on the sliding window technique and the other was based on binary search.

Q1. Return the maximum length of the alternating sequence and print the alternating sequence
Ans. 
The maximum length of the alternating sequence is returned along with the sequence itself.
• Iterate through the array and check if each element alternates with the previous one.

• Keep track of the current alternating sequence length and the maximum length seen so far.

• If the current element breaks the alternating pattern, update the maximum length and reset the current length.

• Print the alternating sequence by storing the el
Answered by AI
View 1 more answer
Q2. Given a sorted array in which every element occurs twice except one find the element occurring only once. It can be solved using xor, 2 pointers, hashmap and binary search.
Add your answer

Round duration - 60 minutes
Round difficulty - null
It was again a DSA based round in which the interviewer asked me 2 DSA based questions. One was based on a hashing technique that is using hashmap and the other was based on a binary tree.

Q1. Find the minimum number of arrows needed to burst balloons represented by an array where a[I] means the height of the balloon. The constraint was if we hit a balloon say the height of 4 then the arrow will...read more
Ans. 
Find minimum arrows needed to burst balloons in decreasing order of height
• Sort the array in decreasing order of height

• Initialize arrow count to 1 and max height to first balloon height

• Iterate through the array and if current balloon height is greater than max height, increment arrow count and update max height

• Return arrow count

• Time complexity: O(nlogn) for sorting, O(n) for iteration

• Space complexity: O(1)
Answered by AI
View 1 more answer
Q2. Question was based on the binary tree he asked me to print all paths in the binary tree having sum equal to a given target
Ans. I solved it using prefix tree and hashmap,
Answered by PrepInsta
Add your answer