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 React Js Frontend Developer Interview Questions and Answers

Updated 26 Nov 2024

Electronic Arts React Js Frontend Developer Interview Experiences

1 interview found

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

I applied via Naukri.com and was interviewed in Oct 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Coding test was of 1hr 20mins the test was totally on reactjs coding questions which consists of 22 questions , 10 mcqs 10 output based and 2 coding questions

Round 2 - One-on-one 

(1 Question)

  • Q1. React scenario based questions

Interview questions from similar companies

Interview Questionnaire 

4 Questions

  • Q1. Given a compact data structure to store strings sequentially, one byte stores length l of the string, next l bytes contain the string characters. Write a code to insert the given string at the ith place, m...
  • Ans. 

    The code inserts a given string at the specified position in a compact data structure that stores strings sequentially.

    • To insert the string at the ith place, we need to shift all the strings after the ith position by the length of the new string.

    • We can use a loop to iterate through the data structure and find the ith position.

    • After finding the ith position, we can calculate the new length of the data structure and allo...

  • Answered by AI
  • Q2. How will you construct parse tree for ((a+b)*c)/d? what all data structures can you use?
  • Ans. 

    Constructing parse tree for ((a+b)*c)/d using data structures.

    • Use stack data structure to keep track of operators and operands.

    • Start with the innermost parentheses and work outwards.

    • Create a node for each operator and operand and link them together.

    • The root node will be the final result of the expression.

    • Example: ((a+b)*c)/d can be represented as / -> * -> + -> a, b, c, d.

  • Answered by AI
  • Q3. Given a function f that returns true or false based on whether the input string satisfies some hidden criterion C, write a function that verifies that all sub strings satisfy C
  • Q4. You hand over 'n' identical linked lists to n salespersons. After the day's work, these salesperson return the lists. Merge these lists such that all insertions, deletions, updates are taken care of, so th...
  • Ans. 

    Merge 'n' identical linked lists from 'n' salespersons to handle insertions, deletions, and updates.

    • Iterate through each linked list and merge them into a single linked list

    • Handle insertions, deletions, and updates by traversing the merged list and making necessary changes

    • Repeat the process for the next day by resetting the merged list

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: It was an online test. The company who hosted the test messed up with the interface, and a lot of people had trouble with a coding question that could not be solved because of the faulty interface. There was no retest.
The shortlisting was done after studying compile attempts, time devoted to various sections and other performance measures.

Round: Technical Interview
Experience: Told about myself, my interests, my internship projects and my work so far.
A few coding questions were asked too.
In the end, they asked if i have any questions.
Tips: Interviewers are friendly. Be calm, give your best.

General Tips: Start preparing early.
Develop priorities both sector wise and company wise.
Take sufficient water and food with you. Interviews can start at 4 am on the first day!
Have enough copies of resume and transcripts with you.
If you have been shortlisted for many companies, it is preferable to have a portfolio manager who manages your phone during the day and enables you to focus on the interviews.
College Name: IIT KANPUR

Skills evaluated in this interview

Interview Preparation Tips

General Tips: Before going for the interviews, take a sheet of paper and write an error free code, with extremely well named variables and optimized runtime each on Matrices, Linked List and Binary Tree. This will ensure that you have confidence and don't feel rusty while writing the code. Check your code twice to make it error free before showing the interviewer.
Skill Tips: geeksforgeeks is the most valuable site. The questions are generally taken from there. Careercup.com has the most common questions asked by Microsoft. Try to even brush up on OS concepts. Some interviewers ask that too. Practice all questions on linked list. This is generally the first interview question.
College Name: NIT SURATHKAL

Interview Preparation Tips

General Tips: Don't ignore aptitude because it is really important. Never give up on any question in interview. Tell your interviewer anything you know about the question even if it is too simple to tell. Be confident.
College Name: NIT SURATHKAL

Interview Preparation Tips

General Tips: 0. The most important thing. Know your level. Improve yourself by practicing more and be well aware of how smart you are. Wishful thinking can only get you so far.1. Writing fluent and optimized code is an art. I was lucky because I have been coding for a long time. If your coding skills aren't great, practice! I answered one crucial question completely wrong and still got through because of this skill.2. If you know an answer to a question, do not answer it immediately. Try to derive that answer from scratch and understand it before you go about blurting out the answer out of excitement. Let it look like a challenge.3. Learn External Sorting and Kadane's algorithm.4. Learn some basic OS facts like details about a program stack and what not.Make a CV right now! Compress it to one page. No one cares about your extra-curricular activities as much as you do. Include relevant details. Selection Procedure Preparation
College Name: NIT SURATHKAL

Interview Preparation Tips

General Tips: As I got PPO from the company it was little better-luck for me as I escaped from On-Campus Competition.But yeah for getting intern and then PPO it was well challenging. But you can enjoy in parallel with little continuous hard work and smart preparation/work-out. Better find what will be asked in interview then learn accordingly concepts instead running behind CGPA(its enough 8- 8.5). You might get disappointed some time just try to catch plus from it and move forward. I have seen cases a student got rejected in one company placed in better one. You never know where is your destination. Better fix multiple than one.Now the pattern for Aptitude is changing. You will be given 60-90 min. and you have to code solutions for problems. Many of our batch-mates were not used to it. I was also rejected in more than 2 companies just because of not having good efficiency in handing online test. Be ready well before for such cases. Follow code-chef etc. Your preference for preparation should be DSA>OS>DBMS
Skill Tips: For Data-Structure and Algorithms preparation I followed NPTEL lectures and Corman. Whatever concept you learn from these try to implement using C/C++ or any language you like. It improved my coding as I started writing more Structured/Modular code which makes you more impressive in interviews. For more problems refer Careercup.com and GeekforGeeks.org. It was really luck for me during both intern and PPI interview I was asked questions from these websites. As these are favorites for all interviewers. Its better to write code first on paper than on compiler it reduces bugs/errors like NULL-pointer error. Aptitude C/C++ follow any good book and go through once. For C refer Dennis Ritchie. For DBMS/OS follow ppts or their standard textbooks. Try to learn as many concept as possible. Don't depend on your prof did he teach or not.
College Name: NIT SURATHKAL

Interview Preparation Tips

General Tips: The interviews take up almost your complete day. Each round lasts for 45 min .The level of difficulty keeps increasing with each round. It is a bit exhausting and by the time you get to final round but trust me guys it's worth it.
Skill Tips: For Microsoft your code should be perfect and written in perfect programming style
College Name: NIT SURATHKAL

Interview Questionnaire 

5 Questions

  • Q1. Find the nth element in a tribonacci(a variation of Fibonacci) series. t(n)=t(n-1)+t(n-2)+t(n-3)
  • Ans. 

    Find the nth element in a tribonacci series.

    • Use recursion to solve the problem.

    • Handle base cases for n=0, n=1, and n=2.

    • For n>2, use the formula t(n)=t(n-1)+t(n-2)+t(n-3).

    • Return the value of t(n) for the given n.

  • Answered by AI
  • Q2. Given three sides of a triangle, find whether a triangle is right angled, isosceles, equilateral, scalene in nature
  • Ans. 

    Given three sides of a triangle, determine its nature.

    • Check if any two sides are equal to determine if it's isosceles

    • Check if all three sides are equal to determine if it's equilateral

    • Use Pythagoras theorem to check if it's right angled

    • If none of the above, it's a scalene triangle

  • Answered by AI
  • Q3. What are the products that I have used of Microsoft? Why I would like to join Microsoft?
  • Ans. 

    I have used Microsoft Office, Windows OS, Visual Studio, and Azure. I want to join Microsoft because of its innovative culture and impact on the tech industry.

    • I have used Microsoft Office for word processing, spreadsheet management, and presentation creation.

    • I have used Windows OS for personal and professional use.

    • I have used Visual Studio for software development.

    • I have used Azure for cloud computing and hosting.

    • I wan...

  • Answered by AI
  • Q4. He then asked me to rate myself on a scale of 10 in any of my favorite language
  • Q5. Questions based on testing was asked like how do you test your code for bugs

Interview Preparation Tips

Round: Test
Experience: It was an online round conducted by cocubes. It had about 15 questions and time allotted was 30 minutes.
Duration: 30 minutes
Total Questions: 1

Round: Test
Experience: Note: Only allowed language was C.
Duration: 60 minutes

Round: Behavioural Interview
Experience: The interview was scheduled at around 6:00 pm. It started with a brief intro by the interviewer followed by mine. He then asked some behavioral questions. What are the products that I have used of Microsoft? Why I would like to join Microsoft? He then asked me to rate myself on a scale of 10 in any of my favorite language. Questions based on testing was asked like how do you test your code for bugs.
He gave a scenario with details as follows:
Suppose you are given a tablet and you need to explain your great great grandfather the features of it so that he understands what you say and thinks it as a useful gadget. Assuming your grandfather has no idea about gadgets like mobile, computer etc.
He also asked me to mention my strength and weakness. No such algorithmic questions were asked in this round.

Round: Technical Interview
Experience: This was the last round.
It was a group coding round.We were made to sit around a round table with paper and pencil and the HR gave us two questions to code.

General Tips: The interviewer wanted a clean code with minimum cuts as possible. So I would suggest practice writing code on a piece of paper. Puzzles were also part of interview
Skills: c, trees, string, data structures
College Name: NA

Interview Questionnaire 

8 Questions

  • Q1. “Compress a text string in place”. Having seen the famous string expansion in place problem many times, I promptly said run length encoding (i.e. compress aaaaaabbbbbccc to a6b5c3 for example). He asked me...
  • Ans. 

    Code a run length encoding algorithm to compress a text string in place.

    • Use a loop to iterate through the string and count consecutive characters

    • Create a new string to store the compressed version of the original string

    • Add the character and its count to the new string

    • Compare the length of the new string to the original string to determine if compression was successful

  • Answered by AI
  • Q2. Given a binary search tree and a no. N in the tree, print the leftmost node at the same level as N
  • Ans. 

    Print the leftmost node at the same level as a given node in a binary search tree.

    • Traverse the tree level by level using BFS

    • Keep track of the leftmost node at each level

    • Return the leftmost node at the level of the given node

    • If the given node is not found, return null

  • Answered by AI
  • Q3. WAP to print a matrix spirally. I told him I knew the problem so he skipped it
  • Q4. Search for an element in a rotated sorted array (of course in sublinear time!)
  • Ans. 

    Search for an element in a rotated sorted array in sublinear time.

    • Use binary search to find the pivot point where the array is rotated.

    • Determine which half of the array the target element is in.

    • Perform binary search on the appropriate half of the array to find the target element.

    • Time complexity is O(log n).

  • Answered by AI
  • Q5. Nice DP problem. Given an amount and an array containing possible coin denominations, determine the smallest no of coins in which the amount may be formed. Assume you have infinite units of each denominati...
  • Ans. 

    Given an amount and coin denominations, find the smallest no of coins to form the amount.

    • Use dynamic programming to solve the problem

    • Create a table to store the minimum number of coins required for each amount

    • Iterate through the denominations and update the table accordingly

    • Return the minimum number of coins required for the given amount

  • Answered by AI
  • Q6. Given a linked list, swap its nodes pairwise. A good test of pointer manipulation with many edge
  • Q7. Given an array, bring all its distinct elements to the top in any order, the rest of the array is not
  • Ans. 

    Move all distinct elements of an array to the top in any order.

    • Create a new array to store distinct elements

    • Loop through the original array and check if element is already in new array

    • If not, add it to the new array and remove it from the original array

    • Concatenate the new array with the remaining elements of the original array

  • Answered by AI
  • Q8. Given a matrix, find an element that is max in its row and min in its col. The actual question (after I wrote the function) was whether there can be more than one such element in the matrix,
  • Ans. 

    There can be multiple such elements in the matrix.

    • Multiple elements can be max in their row and min in their col

    • The function should return all such elements

    • The elements can be in different rows and columns

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 60 minutes

Round: Technical Interview
Experience: 1. After that he asked me a problem.“Compress a text string in place”. Having seen the famous string expansion in place problem many times, I promptly said run length encoding (i.e. compress aaaaaabbbbbccc to a6b5c3 for example). He asked me to code it and write a few test cases for it. The most important test case in my opinion is the following:
a -> a and not a1, i.e. for a single occurrence of a character, do not write its count – the reason
being that the string, instead of getting compressed, gets expanded in that case.
Tips: nitially he started with a discussion of my final year project. After about 10 minutes of discussion, I think he concluded it was too early for me to know my own project topic well. Since the area of my project is network security, the rest of the discussion revolved around it. He went into the details of cryptography and attacks like buffer overflow, asking me to basically just assure him I knew what I was speaking (discuss those things orally, and occasionally write small snippets). One particularly ridiculous part of this interview that I happen to remember was me having uttered the term ‘canary bit’, followed by him torturing me around it for about 10 minutes, he asked me what exactly it is, how I thought it could be implemented, if I could draw a rudimentary design of such a subsystem and all. The whole discussion went on for say 50 minutes or so.

Round: Technical Interview
Experience: This was a nice, pure problem-solving round.
First, he asked me the famous “Tell me about yourself” and “How were your earlier rounds”
questions. But they were just ice-breakers.

Round: Technical Interview
Experience: This was the most enjoyable round. The interviewer was a final round specialist!
First, he asked me about my internship, which I explained to him. He discussed it for hardly 10
minutes.
Then he started his attack! (Yes, it literally felt like an attack – just like Ronnie O’Sullivan There were three questions here:
Q1. Given a linked list, swap its nodes pairwise. A good test of pointer manipulation with many edge
Q2. Given an array, bring all its distinct elements to the top in any order, the rest of the array is not
important. First I suggested in O(n) space. Then he asked me to do it without extra space. I
needed a sorted array for that, which he asked me to assume. The rest of it is based on swapping
elements in order to bring the required elements to the top.
Q3. Given a matrix, find an element that is max in its row and min in its col. The actual question
(after I wrote the function) was whether there can be more than one such element in the matrix,
assuming all elements are distinct. Wrote a small proof that there cannot. He literally asked for a
formal proof “as I would write it in an exam”!Finally I got placed. I was on cloud 9.. All the best

Skills: Data srtructure, Cryptography, Algorithm
College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

12 Questions

  • Q1. Two numbers are stored in two linked lists, with one digit in each node. Add the numbers and return the resultant sum in a linked list. eg. if LL1= 2 ­> 3 ­> 5, LL2= 1­>4­>5, result should be LL3= 3­>8­>0
  • Ans. 

    The question asks to add two numbers represented as linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously, adding the corresponding digits and carrying over the carry.

    • Create a new linked list to store the sum digits.

    • Handle cases where one linked list is longer than the other.

    • Consider cases where the sum has an additional carry digit at the end.

  • Answered by AI
  • Q2. Check the no of repeated occurences of a substring in a string
  • Ans. 

    Count the number of times a substring appears in a string.

    • Use a loop to iterate through the string and check for the substring at each index.

    • Use the count() method to count the number of occurrences of the substring.

    • Consider using regular expressions to find all occurrences of the substring.

    • Handle edge cases such as empty strings or substrings.

  • Answered by AI
  • Q3. Data compression: Given a string “aabbbccc”, save it as “a2b3c3”. Here, I was asked to write a pseudocode, followed by a code in C++, optimize it and then all the testcases. Eg. “aabcc” would become “a2bc2...
  • Ans. 

    The task is to compress a given string by replacing consecutive repeated characters with the character followed by the count of repetitions.

    • Iterate through the string and keep track of the current character and its count.

    • If the next character is the same as the current character, increment the count.

    • If the next character is different, append the current character and its count to the result string.

    • Return the compressed

  • Answered by AI
  • Q4. Given a node in a binary tree, find the leftmost node in the same level
  • Ans. 

    Find the leftmost node in the same level as a given node in a binary tree.

    • Traverse the tree level by level using BFS

    • For each level, keep track of the leftmost node encountered

    • Return the leftmost node in the level of the given node

  • Answered by AI
  • Q5. Find the nth largest number in a binary tree
  • Ans. 

    Find the nth largest number in a binary tree

    • Traverse the tree in-order and store the values in an array

    • Return the (n-1)th index of the sorted array in descending order

    • Use a max heap to keep track of the largest n elements

  • Answered by AI
  • Q6. Insert an element into a sorted circular linked list. (Consider all cases, inserting in the beginning, end and middle)
  • Ans. 

    Insert an element into a sorted circular linked list.

    • Find the correct position to insert the element based on its value

    • Update the pointers of the previous and next nodes to include the new node

    • Handle special cases such as inserting at the beginning or end of the list

    • Example: Inserting 5 into a list with values 1, 3, 4, 6, 7 would result in 1, 3, 4, 5, 6, 7

  • Answered by AI
  • Q7. Given 5 points in a plane, prove that there will be atleast two points such that their midpoint is an integer
  • Ans. 

    Prove that given 5 points in a plane, there will be at least two points such that their midpoint is an integer.

    • Consider the x and y coordinates of the 5 points.

    • If any two points have the same x and y coordinates, their midpoint will be an integer.

    • If not, consider the differences between the x and y coordinates of each pair of points.

    • If any two pairs have differences that are both even or both odd, their midpoints will ...

  • Answered by AI
  • Q8. Given a room with points pertaining to different groups, check whether the connection is planar or non­planar i.e. while connecting all the points in the same group, the wires of different groups should no...
  • Q9. Find the nth power of a number in shortest computational time
  • Ans. 

    Use exponentiation by squaring algorithm to find nth power of a number in shortest computational time.

    • Use recursion to divide the power by 2 and multiply the base accordingly

    • If power is odd, multiply the base with the result of recursive call

    • If power is negative, take reciprocal of base and make power positive

    • Handle edge cases like power=0 and base=0 or 1

    • Time complexity is O(log n)

  • Answered by AI
  • Q10. There is a roller which can have two types of wood blocks, 49 cm and 50 cm. Given two sensors 50 cm apart which call a function ring( ) whenever the sensor changes state, write the function ring( ) to cal...
  • Ans. 

    The function ring() calculates the number of blocks of both types based on sensor state changes.

    • Create a variable to keep track of the number of 49 cm blocks

    • Create another variable to keep track of the number of 50 cm blocks

    • Initialize both variables to 0

    • Whenever the sensor changes state, increment the corresponding block variable

    • Return the count of both block types as an array of strings

  • Answered by AI
  • Q11. Given a linked list, invert every two nodes in the list.Eg. Given a ­> b ­> c ­> d, result should be b ­> a ­> d ­> c
  • Ans. 

    The given linked list needs to be inverted in pairs of two nodes.

    • Iterate through the linked list, swapping every two adjacent nodes.

    • Keep track of the previous node to update the next pointers correctly.

    • Handle the edge cases of odd number of nodes or empty list.

  • Answered by AI
  • Q12. A file or a directory can be represented as a node. The node has properties like ID no, parent ID no, name, no of children( 0 for a file). The entire file structure is represented as a linked list of the ...

Interview Preparation Tips

Round: Technical Interview
Experience: After 3 interviews, I was called for a final interview. He started by asking me about my best project and the drawbacks I faced in it. He asked about my internship and the workingexperience. This interview went on for more than an hour with him grilling me on two questions and their testcases.Q1. Given a linked list, invert every two nodes in the list.Eg. Given a ­> b ­> c ­> d, result should be b ­> a ­> d ­> c
Q2. A file or a directory can be represented as a node. The node has properties like ID no, parent ID no, name, no of children( 0 for a file). The entire file structure is represented as a linked list of the nodes. Only thing known to us is that the parent directory will always come before the children in the LL. It need not come immediately before.We have to implement a GUI such that when I press on the + button next to the root directory, I see its children folders and files. The child directories have a + button next to them and can be expanded similarly.Write a pseudocode to implement this in minimum time and space.I suggested the use of a tree, wrote a code to convert it to a tree. He wanted a better way of finding children from the parent so I suggested a hash table comprising a hashing of the parent IDs to a LL of the children IDs.
He was satisfied with the answer.

Skills: Algortihm, Data structure, C++
College Name: Na

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Electronic Arts Interview FAQs

How many rounds are there in Electronic Arts React Js Frontend Developer interview?
Electronic Arts interview process usually has 2 rounds. The most common rounds in the Electronic Arts interview process are Coding Test and One-on-one Round.

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Regami Solutions

No Interviews

INTERVIEWS

Brillo Technologies

No Interviews

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

Tell us how to improve this page.

Electronic Arts React Js Frontend Developer 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