i
Electronic Arts
Filter interviews by
Clear (1)
posted on 17 Dec 2021
I applied via Campus Placement and was interviewed in Sep 2021. There were 3 interview rounds.
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++.
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
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
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.
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
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.
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)
Top trending discussions
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
posted on 21 Aug 2016
I applied via Campus Placement
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.
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...
posted on 2 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
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 23 Aug 2015
I applied via Campus Placement
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
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.
posted on 23 Aug 2015
I applied via Campus Placement
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.
I applied via Campus Placement
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