Premium Employer

i

This company page is being actively managed by Electronic Arts Team. If you also belong to the team, you can get access from here

Electronic Arts Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Electronic Arts Specialist Testing Interview Questions and Answers

Updated 21 Feb 2024

Electronic Arts Specialist Testing Interview Experiences

1 interview found

Specialist Testing Interview Questions & Answers

user image Samatha Reddy

posted on 21 Feb 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Manual testing sanity smoke testing

Interview questions from similar companies

I applied via Campus Placement and was interviewed in Dec 2016. There was 1 interview round.

Interview Questionnaire 

3 Questions

  • Q1. Binary tree question. Check if left child is less than right child. Recursive and iterative implementation
  • Ans. 

    Check if left child is less than right child in a binary tree

    • Traverse the tree recursively and compare left and right child values

    • Use a stack to traverse the tree iteratively and compare left and right child values

    • Return true if all left children are less than right children, else false

  • Answered by AI
  • Q2. Check if a string is a substring in another string. Discussed speed (not time complexity). not neccessarily always correct but fast
  • Ans. 

    Use built-in string method to check substring presence for faster execution.

    • Use 'indexOf' method to check if substring is present in the main string.

    • If the method returns -1, the substring is not present.

    • If the method returns a non-negative integer, the substring is present.

  • Answered by AI
  • Q3. Maze question. write code on paper in 5 mins. automatically check if function is correct (not testcases)

Interview Preparation Tips

Round: Technical Interview
Tips: Practice writing code on paper

College Name: IIT Madras

I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Coding Questions and Thinking Process Analysis.
  • Q2. Analysis about app performance
  • Ans. 

    App performance analysis involves identifying and resolving bottlenecks to improve user experience.

    • Collect and analyze performance metrics such as response time, CPU usage, memory usage, and network latency.

    • Identify and prioritize bottlenecks based on impact on user experience and frequency of occurrence.

    • Implement optimizations such as caching, code refactoring, and database tuning.

    • Continuously monitor and test perform...

  • Answered by AI
  • Q3. Discussion about the project mentioned in resume.

Interview Preparation Tips

Round: Test
Experience: Two questions were given and we are supposed to write code for the same.
Tips: Whatever idea is there, just discuss with interviewer.
Duration: 1 hour
Total Questions: 2

Round: Problem Statement
Experience: You have to solve the question for next round.
Tips: Practice coding well.

Round: Technical Interview
Experience: A coding question was given, but much difficult one, they were looking for approach.
Tips: Share your thought Process Clearly.

Round: Case Study Interview
Experience: A full depth project round was there. They asked my role and responsibility.

Round: Technical Interview
Experience: An application was given to you and you have to make it better the way you can.

Skills: Technical Questions, Technical Analysis, Ability To Cope Up With Stress
College Name: IIT Madras

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Data structures

Interview Preparation Tips

Round: Test
Experience: 3 coding questions.
Tips: Prepare data structures well
Duration: 2 hours
Total Questions: 3

Round: Group Discussion
Experience: 2 coding questions on prem and paper.
Tips: Consider all test cases, provide comments on code
Duration: 1 hour 30 minutes

Round: Technical Interview
Experience: Mostly checked problem solving skills, some questions regarding your project, operating systems
Tips: Be confident, try and get the hints provided

College Name: IIT Madras

I applied via Campus Placement and was interviewed in Jan 2016. There were 5 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Finding a loop in a directed graph, find the last element in a binary tree
  • Ans. 

    To find a loop in a directed graph, use Floyd's cycle-finding algorithm. To find the last element in a binary tree, traverse the tree and return the rightmost leaf node.

    • For finding a loop in a directed graph, use Floyd's cycle-finding algorithm which uses two pointers moving at different speeds.

    • To find the last element in a binary tree, traverse the tree recursively or iteratively and return the rightmost leaf node.

  • Answered by AI
  • Q2. On circular queue and finding the last number which is highest and contains same number. Of digits a the given numbber
  • Ans. 

    The question is about finding the last number in a circular queue that has the highest number of digits.

    • Implement a circular queue data structure

    • Iterate through the circular queue to find the last number with the highest number of digits

    • Compare the number of digits of each number in the circular queue

    • Keep track of the last number with the highest number of digits

  • Answered by AI
  • Q3. Tell me your passions and what. Is the one thing I want to know about you

Interview Preparation Tips

Round: Test
Experience: Coding round based on logic was given
Tips: Practice coding
Duration: 2 hours
Total Questions: 3

College Name: IIT Madras

Skills evaluated in this interview

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. You have a Binary tree having numbers>=0 and a numeber N. Print all downwards paths from any node having the sum of elements equal to N
  • Ans. 

    Print all downward paths from any node in a binary tree with sum of elements equal to N.

    • Traverse the binary tree and keep track of the sum of elements in the path from root to current node.

    • If the sum equals N, print the path from root to current node.

    • Recursively traverse the left and right subtrees with updated sum.

    • Use a stack to keep track of the current path being traversed.

    • Example: Binary tree with root 1, left chil...

  • Answered by AI
  • Q2. You have a cuboid (m*n*p) each block of the cuboid is having a metallic ball. Now we are passing X-ray from front face and getting a bool matrix1 of m*p the elements are set if there is a black spot.(as...
  • Ans. 

    Yes, it is possible to get the accurate result from the given data.

    • The coordinates (i,j,k) where metallic balls are present can be determined by finding the set elements in both matrix1 and matrix2.

    • Additional data is not required as the given data is sufficient to determine the coordinates.

    • The coordinates can be obtained by iterating through the elements of matrix1 and matrix2 and checking for set elements.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Output questions
Tips: focus on basics
Duration: 30 minutes
Total Questions: 15

Round: Test
Experience: Two coding problems in one hour,on Cocobues.com

1. Given two arrays of numbers. The numbers are from 0-9 you have two maximize the first array by using the elements from the second array.
the elements can be used only once.
e.g. arr1[]={5,2,3,6,7};
arr2[]={9,2,8,4,5};
You should output the modified arr1 as {9,8,5,6,7}

2.Given a matrix of characters and a word.
you have to count the number of occurences of that word in that matrix. you can move to any of the eight valid directions from current position.
e.g. word="HELLO";
matrix[][5]={ {'H','E','L','L','O'},
{'E','H','E','A','B'},
{'L','L','O','C','D'}};
output should be : 5

Tips: DO AS MUCH AS PRACTICE
Duration: 60 minutes
Total Questions: 2

Round: Test
Experience: One Coding question was given to all the students ,You have to code and explain it.
You are given an string as input which represents a path. You have to normalize that path inplace(NO EXTRA SPACE).
e.g.
input : "\a\b\c\..\..\file.txt"
output: "\a\file.txt"
Hint: Double dot(..) means you have to skip the previous parent.
It was on paper.
Duration: 40 minutes
Total Questions: 1

Round: Technical Interview
Experience: The interviewer was very nice that was an amazing experience.
Tips: Be confident and relaxed.

Round: HR Interview
Experience: Again the interviewer was very nice. Firstly he asked me what i have done in technical till that time.
After the interview was over he looks impressed.
Tips: Don't see what others are doing . Take your time and try to short out the correct solution.

General Tips: Do coding as much as you can
Skills: Algorithm, Coding Skills And Knowledge On Data Structures
Duration: 2
College Name: NIT Bhopal
Motivation: It comes to our institute, and the name Microsoft is sufficient for motivation.
Funny Moments: The journey to Microsoft IDC Hydrabad was very beautiful.

Skills evaluated in this interview

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. Given a string of unknown length, what is a good approach to find n-k th element from last
  • Ans. 

    To find n-k th element from last in a string of unknown length

    • Traverse the string to find its length

    • Calculate the position of n-k th element from last

    • Traverse the string again to find the element at calculated position

  • Answered by AI
  • Q2. Given an array of strings, count the number of unique occurrences
  • Ans. 

    Count the number of unique occurrences in an array of strings.

    • Create a hash table to store the count of each string occurrence.

    • Iterate through the array and update the count in the hash table.

    • Count the number of unique occurrences by counting the number of keys in the hash table.

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: They checked my CGPA and my projects worked on. They also looked at previous internship I have done
Tips: Focus on CGPA and projects done. Also mention internship experience.

Round: Test
Experience: Easier questions and good amount of time to think.
Tips: Careful with IDE.
Duration: 60min minutes
Total Questions: 2

Round: Group Discussion
Experience: Enough time to think,solve. Questions were easy and only tested basic understanding of ds and algos.
Tips: Think well. They do not expect complete optimal solution. Discuss your ideas with members there

Round: Technical Interview
Tips: They do not expect optimal solution. they want to know thought process

General Tips: Be thorough in course work being done at present.
Revise the projects you have done in your semester
Skills: Data Structures, Algorithms, Probability theory, Basics of Machine Learning
Duration: 2 months
College Name: IIT Madras
Motivation: Microsoft !

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: objective test basically consists of programs written in diff languages like c,java and we need to give output of such programs.
programming section consisted of 2 questions which dealt with data structures,it was pretty much simple to code them.
Tips: command on data structures and algorithms is helpful.
Duration: 90minutes minutes
Total Questions: 15+2

Round: Group fly
Experience: A question (again based on algorithm) was given to a group of 6-8 people.Though it is named as "group fly" it is supposed to be solved individually.
Tips: again dsa is helpful

Round: Technical Interview
Experience: A couple of questions based on algorithms are asked by the interviewers.Even if we cannot solve them fully,your approach
to the question is what actually matters.

General Tips: Be confident about what you are telling
Skills: Data structures and algorithms
Duration: 2
College Name: IIT Madras
Motivation: Reputed company
Get exposed to corporate world

Interview Questionnaire 

2 Questions

  • Q1. Write the backend server code for a tic tac toe game
  • Ans. 

    Backend server code for a tic tac toe game

    • Create a RESTful API using a framework like Express.js

    • Implement game logic to check for winning conditions

    • Use a database to store game state and user information

    • Handle user authentication and authorization

    • Implement real-time updates using WebSockets

  • Answered by AI
  • Q2. Write a program to store a tree on a file. Also write code to reconstruct the tree from that file. Think of efficient techniques
  • Ans. 

    Program to store and reconstruct a tree from a file with efficient techniques.

    • Use a recursive approach to traverse the tree and write each node to the file

    • Include information about the node's parent and children in the file

    • Use a unique identifier for each node to reconstruct the tree from the file

    • Use a data structure like a hash table to store the nodes and their identifiers for efficient reconstruction

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: All types of C/C++ Aptitude and I/O questions were asked.
Was not a very easy round.
Tips: Prepare from -----/ and -----/
I had done everything in these 2 links.
Other than that, you can prepare from "Test your C Skills" by Yeshwant Kanetkar. PDF available online.
Duration: 30 minutes
Total Questions: 40-50

Round: Test
Experience: Two coding questions were asked. It was hosted on CoCubes website.
Questions were pretty basic.
First one was ad-hoc, requiring to count the number of set bits of a number.
Second one was the standard, minimum cost path DP problem.
Tips: Prepare from geeksforgeeks, careercup and ambitionbox.
If you know competitive programming, you should not have much of a problem.
Duration: 90 minutes
Total Questions: 2

Round: Test
Experience: Had to write code on paper. 2 questions.
First one was to rotate a matrix by 90 degrees. Pretty standard question.
Second one was to remove all negative elements in an array to the right end. Do it without extra memory.
Tips: Apart from correctness of solution, they check for code quality. Code written must be clean, indented and with properly named variables and functions.
Keep communicating your ideas to the people who will be supervising the test. They will understand your thought process that way.
Duration: 60 minutes
Total Questions: 2

Round: Technical Interview
Experience: Wrote the class in JAVA. Explained the methods, and optimized them. Variables were named properly.
Also generalized the class for an nxn matrix tic-tac-toe game.
Interviewer was very friendly. Wrote the code on paper.
Tips: Prepare on class design beforehand. They are quite likely to ask you questions on OOP.
Write clean code.

Round: Technical Interview
Experience: Just had to write the functions. Wrote code in C++.
The interviewer tested me on edge cases. Asked me to prepare test cases.
Tips: Make sure your code is ready to tackle those dirty edge cases.
Knowing standard library functions is beneficial. Make sure you learn some important ones. They can come in handy.
Write clean code. You can choose any language you are comfortable in.

General Tips: Stay calm. Prepare well.
Focus on the data structures that Microsoft usually asks about.
Skill Tips: A good internship helps in the process. I had interned at Google, so I got selected relatively easily as compared to other candidates. Make sure your resume is as impressive as you can make it.
Stay calm in the rounds. That way you can think better.
Communicate with the company officials. They will know you and your thought process that way.
Don't stay quiet in the interview rounds. If you have doubts, ask them. I had made this mistake when they came for internships and did not get selected because I didn't clear my doubts. The interview should be ideally like a discussion, where you present your thoughts and ideas, clear your doubts, and come up with a solution.
Skills: Resume, Communication, Analytical Skills, Algorithmic Approach To Problem Solving, Coding Skills And Knowledge On Data Structures
College Name: NIT Surathkal
Motivation: It is one of the biggest tech giants in the world. I definitely wanted to be a part of it.
Funny Moments: Since I had only 2 interviews, while others had 5, I came out so early that they thought I was rejected.
They later discovered, they were wrong.

Skills evaluated in this interview

Interview Preparation Tips

Round: Technical Interview
Experience: Technical Interview involved two questions, was asked to write code for the given tasks, which the interviewer would then "execute" manually to check it.
Was asked to go in detail on how the computer handles the program at a low level (like displaying the stack state after each call to a recursive function). Apart from that, I was questioned on some C fundamentals, namely memory allocation and segmentation faults.

Skills:
College Name: NIT Surathkal
Contribute & help others!
anonymous
You can choose to be anonymous

Electronic Arts Interview FAQs

How many rounds are there in Electronic Arts Specialist Testing interview?
Electronic Arts interview process usually has 1 rounds. The most common rounds in the Electronic Arts interview process are One-on-one Round.

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Oriserve

No Interviews

INTERVIEWS

Regami Solutions

No Interviews

INTERVIEWS

Brillo Technologies

10 top interview questions

INTERVIEWS

Kalvium

No Interviews

INTERVIEWS

Electronic Arts

No Interviews

INTERVIEWS

Electronic Arts

No Interviews

INTERVIEWS

Electronic Arts

No Interviews

SALARIES

Regami Solutions

Tell us how to improve this page.

Electronic Arts Specialist Testing Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Join Electronic Arts We exist to inspire the world to play.

Interview Questions from Similar Companies

Pole To Win Interview Questions
3.4
 • 54 Interviews
Aristocrat Interview Questions
3.8
 • 45 Interviews
Light & Wonder Interview Questions
3.8
 • 29 Interviews
PurpleTalk Interview Questions
3.9
 • 27 Interviews
IDZ Digital Interview Questions
3.8
 • 22 Interviews
Games24x7 Interview Questions
3.7
 • 19 Interviews
View all
QA Tester
118 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior QA Tester
99 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

QA Tester II
72 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Quality Analyst
57 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Quality Assurance Tester 2
53 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Electronic Arts with

Ubisoft Entertainment

3.8
Compare

Nintendo

5.0
Compare

Microsoft Corporation

4.0
Compare

Tencent

4.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview