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

Electronic Arts Senior QA Tester Interview Questions and Answers

Updated 12 Mar 2024

Electronic Arts Senior QA Tester Interview Experiences

1 interview found

Senior QA Tester Interview Questions & Answers

user image Shubham Jawadwar

posted on 12 Mar 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Mar 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. They ask on real time scenarios, who will you respond when u r in a situation. All about your technical abilities.

Interview questions from similar companies

I applied via Walk-in and was interviewed before Mar 2021. There were 2 interview rounds.

Round 1 - Coding Test 

Link list program, few objective based on cpp

Round 2 - One-on-one 

(2 Questions)

  • Q1. Good Core knowledge cpp
  • Q2. Pointer, static , constant used in multiple scenario. Oops, STL

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well practically, work culture and pay is good!!
Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Javascript and React fundamentals
Round 2 - Coding Test 

Question completely out of domain

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Oct 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

1. Questions related to python.
2. Find the count of unique elements in a list.

Round 3 - Coding Test 

1. Implementation of any sorting.
2. Questions related to testing and pytest framework.

Round 4 - Behavioral 

(3 Questions)

  • Q1. Casual conversation with Senior manager
  • Q2. Tell me about your self.
  • Q3. Discussion about job profile.
Round 5 - HR 

(1 Question)

  • Q1. Salary discussion.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared with the in depth knowledge abouts the job in which you are applying.

I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Question related to experience and basic questions on manual testing like what is the difference between sanity and smoke, test case strategy and planning and scenario. STLC Phases and Bug cycle

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep it simple and try to give generic examples around the questions.

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

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 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: A bit challenging but interesting.
Tips: 1) Solve as many problems as possible on the website "InterviewBit".
Duration: 75 minutes
Total Questions: 3

General Tips: Don't
Skill Tips: Need to have the ability to code on paper. This needs practice

Skills:
Duration: 2 months
College Name: IIT Madras
Motivation: An exciting company to work at.

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

Electronic Arts Interview FAQs

How many rounds are there in Electronic Arts Senior QA Tester interview?
Electronic Arts interview process usually has 1 rounds. The most common rounds in the Electronic Arts interview process are Technical.

Tell us how to improve this page.

Electronic Arts Senior QA Tester 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
 • 55 Interviews
Aristocrat Interview Questions
3.8
 • 45 Interviews
Light & Wonder Interview Questions
3.9
 • 29 Interviews
IDZ Digital Interview Questions
3.8
 • 22 Interviews
Games24x7 Interview Questions
3.7
 • 19 Interviews
View all
Electronic Arts Senior QA Tester Salary
based on 99 salaries
₹4.2 L/yr - ₹9 L/yr
16% less than the average Senior QA Tester Salary in India
View more details

Electronic Arts Senior QA Tester Reviews and Ratings

based on 8 reviews

3.8/5

Rating in categories

3.2

Skill development

4.5

Work-life balance

3.4

Salary

2.7

Job security

4.1

Company culture

2.6

Promotions

3.4

Work satisfaction

Explore 8 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