i
Electronic Arts
Filter interviews by
I applied via Naukri.com and was interviewed before Mar 2023. There was 1 interview round.
Top trending discussions
posted on 7 Mar 2022
I applied via Walk-in and was interviewed before Mar 2021. There were 2 interview rounds.
Link list program, few objective based on cpp
Question completely out of domain
posted on 16 Oct 2023
I applied via Referral and was interviewed before Oct 2022. There were 5 interview rounds.
1. Questions related to python.
2. Find the count of unique elements in a list.
1. Implementation of any sorting.
2. Questions related to testing and pytest framework.
posted on 2 Nov 2021
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I applied via Campus Placement
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Jan 2016. There were 5 interview rounds.
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.
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
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There was 1 interview round.
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
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.
posted on 21 Aug 2016
I applied via Campus Placement
posted on 21 Aug 2016
I applied via Campus Placement
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
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
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
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.
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
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
based on 1 interview
Interview experience
based on 8 reviews
Rating in categories
QA Tester
118
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior QA Tester
99
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Tester II
72
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Analyst
57
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Assurance Tester 2
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Ubisoft Entertainment
Nintendo
Microsoft Corporation
Tencent