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 Quality Assurance Tester 2 Interview Questions and Answers

Updated 22 Jun 2022

Electronic Arts Quality Assurance Tester 2 Interview Experiences

1 interview found

Round 1 - Aptitude Test 

English, maths and gamesSalary

Round 2 - Technical 

(1 Question)

  • Q1. About games, previous projects

Interview Preparation Tips

Interview preparation tips for other job seekers - recantly played games and Ready to accept hr terms

Interview questions from similar companies

I applied via Campus Placement

Interview Questionnaire 

6 Questions

  • Q1. Testing whether every left child's value is less than the right child's value in a binary tree
  • Ans. 

    To test if every left child's value is less than the right child's value in a binary tree.

    • Traverse the binary tree using any traversal algorithm (e.g., in-order, pre-order, post-order)

    • Compare the value of each left child with its right child

    • If any left child's value is greater than or equal to its right child's value, return false

    • If all left child's values are less than their right child's values, return true

  • Answered by AI
  • Q2. Cloning a linked list-like structure
  • Ans. 

    Cloning a linked list-like structure

    • Create a new node for each node in the original linked list

    • Set the value of the new node to the value of the corresponding node in the original linked list

    • Set the next pointer of the new node to the new node corresponding to the next node in the original linked list

    • Repeat the above steps until all nodes in the original linked list are cloned

  • Answered by AI
  • Q3. Finding the nth character in a stream of bytes
  • Ans. 

    To find the nth character in a stream of bytes, we need to read the stream byte by byte until we reach the nth position.

    • Start reading the stream byte by byte until you reach the nth position

    • Return the byte at the nth position

    • If the stream ends before reaching the nth position, return null or throw an exception

  • Answered by AI
  • Q4. Rearranging a string so no consecutive characters are the same
  • Ans. 

    Rearrange a string to avoid consecutive same characters.

    • Iterate through the string and keep track of the previous character.

    • If the current character is the same as the previous, swap it with the next different character.

    • Repeat until no consecutive same characters are left.

  • Answered by AI
  • Q5. Finding the next highest palindrome
  • Ans. 

    The task is to find the next highest palindrome number given a number.

    • Convert the given number to a string

    • Check if the number is already a palindrome

    • If not, increment the number by 1 and check if it is a palindrome

    • Repeat the previous step until a palindrome is found

  • Answered by AI
  • Q6. To canonicalize a directory path
  • Ans. 

    Canonicalizing a directory path involves simplifying and standardizing the path to remove any redundant or unnecessary elements.

    • Remove any consecutive slashes and replace them with a single slash

    • Remove any trailing slashes

    • Resolve any relative paths (e.g., '..' and '.')

    • Handle special cases like the root directory ('/')

    • Normalize the path by removing any unnecessary elements

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: The test started an hour late, which could have been avoided with some better planning. The test experience was pretty good for me since I am used to using HackerRank's online platform for competitive coding.
Tips: Maybe a little sample session before the actual test would help.
Duration: 75 minutes

Round: Technical Interview
Experience: I enjoyed the interview experience; the panel was friendly and encouraging.

General Tips: Nice interview, questions were well thought out.
Skills: Algorithms And Data Structures
Duration: 2
College Name: IIT Madras
Motivation: What interests me about Microsoft is the nature and the scale of the work they're doing. Every day they impact billions of people worldwide, and I would love to be a part of this organization.

Skills evaluated in this interview

I applied via Campus Placement

Interview Questionnaire 

1 Question

  • Q1. Algorithmic Coding, Testing, Databases & other CS Concepts

Interview Preparation Tips

Round: Test
Experience: Decent knowledge of coding was needed.Speed was of essence.
Tips: Practice coding and be quick.
Duration: 75 minutes
Total Questions: 3

Round: Technical Interview
Experience: I had 3 technical interviews.The interviewers were very friendly.It involved writing paper on code which required me to be very precise and error free.
Tips: Practice coding.Practice writing code on paper and thinking out loud.

General Tips: Prepare well and be confident.
Skills: Unit Testing, Implementation Of Code Using OOPS, Database, Algorithms And Data Structures
Duration: 2
College Name: IIT Madras
Motivation: Microsoft.The company speaks

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. 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

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

Interview Preparation Tips

Round: Test
Experience: Questions on linked list, basic logic and an adhoc math problem. Questions were very doable, but time maybe the only constraint
Tips: Manage time, get used to fluently coding in C Java or C++. You wont have access to Internet, man pages during contest so practice coding g without them.
Duration: 3 minutes
Total Questions: 75

Skills:
Duration: 2
College Name: IIT Madras
Contribute & help others!
anonymous
You can choose to be anonymous

Electronic Arts Interview FAQs

How many rounds are there in Electronic Arts Quality Assurance Tester 2 interview?
Electronic Arts interview process usually has 2 rounds. The most common rounds in the Electronic Arts interview process are Aptitude Test and Technical.

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Electronic Arts

No Interviews

INTERVIEWS

HSBC Group

No Interviews

INTERVIEWS

Electronic Arts

No Interviews

INTERVIEWS

Brillo Technologies

No Interviews

INTERVIEWS

Electronic Arts

No Interviews

DESIGNATION

INTERVIEWS

Brillo Technologies

No Interviews

INTERVIEWS

Brillo Technologies

No Interviews

Tell us how to improve this page.

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
Electronic Arts Quality Assurance Tester 2 Salary
based on 53 salaries
₹4 L/yr - ₹6.8 L/yr
At par with the average Quality Assurance Tester 2 Salary in India
View more details

Electronic Arts Quality Assurance Tester 2 Reviews and Ratings

based on 5 reviews

4.9/5

Rating in categories

4.0

Skill development

4.9

Work-life balance

4.6

Salary

4.9

Job security

4.9

Company culture

4.2

Promotions

4.7

Work satisfaction

Explore 5 Reviews and Ratings
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