Upload Button Icon Add office photos

HARMAN

Compare button icon Compare button icon Compare

Filter interviews by

HARMAN React Js Frontend Developer Interview Questions and Answers

Updated 17 Feb 2024

HARMAN React Js Frontend Developer Interview Experiences

2 interviews found

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Walk-in and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - Coding Test 

First round was coding test they have given paper and pen to write ToDoList component, Grocerry App and Javascript questions like deep cloning, Merge sort, Reversing the array.


The worst part most of them got rejected Since they didnt write performance based code using pen and paper, A very long question in React given 45 mins to write it.

I was called to Harman office in bengaluru, and waited till evening 5 pm only to get results, the process is so long and worst.


Even though we got best marks in exam we are rejected because our code is not doing performance in pen and paper

All of the questions which were written is correct and got good marks, but not selected because there are no technical people to correct the answers, only HR people check the answers and evaluate.


No interviews conducted and they mentioned interviews will be conducted again virtually.

Interview Preparation Tips

Interview preparation tips for other job seekers - Never faced such kind of interviews, Pls stop going to such interviews.

Hr people are worst to take interviewz
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Recruitment Consulltant and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. JS predict output question Life cycle methods in react middlewares in react redux redux architecture virtual dom unit testing simple js program to use reducer fetch api simple task using grid controlled vs...

React Js Frontend Developer Interview Questions Asked at Other Companies

asked in Simform
Q1. 1. What is difference between abstract class and interface ?
asked in Simform
Q2. 3. What is Difference between primary key and unique key ?
asked in Simform
Q3. 2. What is Arrow Function in Javascripts?
asked in Simform
Q4. 5. Why we require interface and what is interface in java ?
asked in Simform
Q5. 4. how you join three different tables in SQL ?

Interview questions from similar companies

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

I applied via Naukri.com and was interviewed in Jan 2023. There were 4 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 

Data structures, linq and .net core related questions

Round 3 - Technical 

(1 Question)

  • Q1. Angular and .net core related questions
Round 4 - HR 

(1 Question)

  • Q1. About salary discussion
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Simple question on the datatypes, DSA,
  • Q2. Basic full stack questions

Software Developer Interview Questions & Answers

Samsung user image Gaurav Srikant Mokhasi

posted on 3 Dec 2015

Interview Preparation Tips

Round: PRE PLACEMENT OFFER
Experience: Interns (both CS and IT) were selected in my third year. Pre-placement offers were rolled out to 16 of us which was roughly a conversion ratio of 1:3. A couple of ECE hires were added when SRI-B visited campus later.

General Tips: If you're in CS or IT, this is the only format your resume should be in: -----
Take your internship seriously. Have fun and all but also get your project done. It's not the end of the world if you don't get a PPO. Campus placements are tension-filled, no doubt, but a lot of people get equally good if not better jobs after missing out on PPOs.
Make sure you talk to your manager about the PPO process. She will be the one giving you your final review. So ensure that she knows you want the job. Prepare a fancy presentation for the HR. By fancy, I mean slick and professional. Think Apple, not flashy Microsofty graphics and stupid word art.
Skill Tips: Google GSAT (Global Samsung Aptitude Test) a week before the test and make sure you practice some similar CAT type questions. Questions are of medium difficulty and time management is a real issue (most of us were unable to finish properly). - I didn't have to use these but I've heard good things about codechef/topCoder and books such as Cracking the Coding Interview by Gayle Laakmann McDowell.
Skills:
College Name: NIT Surathkal

Interview Questionnaire 

2 Questions

  • Q1. Multiple
  • Q2. Multiple.

Interview Preparation Tips

Round: Test
Experience: Graph problem.
First step was to formulate the question into graph problem.

Then solve using standard graph algo (Dijkstra, bellmen ford, e.tc).
Tips: Practice writing whole code without using standard library.
Duration: 3 hours
Total Questions: 1

Round: Technical Interview
Experience: Question related to dfs.
Asked about networking, OS and integers.

One puzzle.(available on geeksforgeeks)
Tips: Prepare for puzzle. Generally they go for standard puzzle.

Round: Technical Interview
Experience: It was mostly related to technical project and internship.

General discussion on machine learning.
Tips: Prepare for the projects mentioned on the resume

Round: HR Interview
Experience: He was testing me regarding how I will explain a technical project to a non-technical guy.. And also general HR questions like why u want to join Samsung and other similar questions.
Tips: Nothing new.

Skills: Basic programming stuff. , Algorithm, Graph Theory, Machine Learning, Problem Solving Skills
College Name: IIT Kharagpur

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: exam was easy.
Tips: Be good in C programming
Duration: 75 minutes
Total Questions: 3

General Tips: Should be good in atleast c or c++
Skills: Algorithms And Data Structures
Duration: 2
College Name: IIT Madras
Motivation: The accomodation and facilities
Funny Moments: Interviews are not funny.

I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Circular queues, binary trees, recursion
  • Q2. Asked about project

Interview Preparation Tips

Round: Test
Experience: 3 very simple questions on hackerrank.
Duration: 1 hour 30 minutes
Total Questions: 3

Round: Group Discussion
Duration: 1 hour

Round: Technical Interview
Experience: Asked me to code up a simple question

College Name: IIT Madras

Interview Questionnaire 

14 Questions

  • Q1. Merge two sorted linked list and write testcases
  • Ans. 

    Merging two sorted linked lists and writing test cases.

    • Create a new linked list to store the merged list

    • Compare the first nodes of both lists and add the smaller one to the new list

    • Repeat until one of the lists is empty, then add the remaining nodes to the new list

    • Write test cases to cover all possible scenarios, including empty lists and lists of different lengths

  • Answered by AI
  • Q2. WAP to check if the binary tree is height-balanced and write testcases
  • Ans. 

    WAP to check if binary tree is height-balanced and write testcases

    • A binary tree is height-balanced if the difference between the heights of its left and right subtrees is not more than 1

    • Use recursion to check if each subtree is height-balanced

    • Write testcases to cover all possible scenarios, including empty tree, single node tree, and unbalanced trees

  • Answered by AI
  • Q3. Then he asked me about my internship and to explain my projects
  • Q4. Find the intersection point of two linked list
  • Ans. 

    Find the intersection point of two linked lists.

    • Traverse both lists and find their lengths.

    • Move the head of the longer list to make both lists equal in length.

    • Traverse both lists in parallel until the intersection point is found.

  • Answered by AI
  • Q5. You are given file pointer and integer n, write c code for printing last “n” lines in that file
  • Ans. 

    C code to print last n lines of a file given file pointer and integer n.

    • Use fseek() to move the file pointer to the end of the file

    • Count the number of newline characters encountered from the end of the file until n lines are found

    • Use fgets() to read and print the last n lines

  • Answered by AI
  • Q6. What is deadlock?Conditions for that?What are the methods to prevent it?Write code to prevent the deadlock for OS, considering that there are two processes P0 and P1 in OS and they are requesting resource...
  • Ans. 

    Deadlock is a situation where two or more processes are unable to proceed due to a circular dependency on resources.

    • Deadlock occurs when two or more processes are waiting for resources held by each other.

    • Conditions for deadlock are mutual exclusion, hold and wait, no preemption, and circular wait.

    • Methods to prevent deadlock include resource allocation graph, banker's algorithm, and deadlock avoidance.

    • To prevent deadloc...

  • Answered by AI
  • Q7. How will you avoid race condition on shared memory?
  • Ans. 

    Use synchronization techniques like locks, semaphores, or mutexes to prevent multiple processes from accessing shared memory simultaneously.

    • Implementing a locking mechanism to ensure only one process can access the shared memory at a time.

    • Using semaphores to control access to the shared memory.

    • Using mutexes to ensure mutual exclusion and prevent race conditions.

    • Using atomic operations to ensure that memory operations a...

  • Answered by AI
  • Q8. Suppose there are two processes P0 and P1 and they want write to shared memory and while writing they should have exclusive lock on memory and P0 should be first to write the memory.Write C code using sema...
  • Q9. What is IPC? What are its types? compare them
  • Ans. 

    IPC stands for Inter-Process Communication. It is a mechanism that allows processes to communicate with each other.

    • Types of IPC include shared memory, message passing, and pipes.

    • Shared memory allows processes to share a portion of memory.

    • Message passing involves sending messages between processes.

    • Pipes are a unidirectional form of communication.

    • Shared memory is faster than message passing, but message passing is more r...

  • Answered by AI
  • Q10. If you have design offline browser and what will be challenges that you will face
  • Ans. 

    Designing an offline browser poses challenges such as data storage, synchronization, and user experience.

    • Ensuring efficient data storage and retrieval

    • Implementing synchronization with online content

    • Providing a seamless user experience with limited connectivity

    • Handling updates and changes to online content

    • Managing cache and memory usage

    • Dealing with security concerns

    • Handling different file types and formats

  • Answered by AI
  • Q11. Give the data structure to represent N-ary tree and write to code for its BFS
  • Ans. 

    Data structure and code for BFS of N-ary tree

    • N-ary tree can be represented using a node class with a list of child nodes

    • BFS can be implemented using a queue data structure

    • Iterate through the queue and add child nodes to the queue

    • Pop the node from the queue and process it

    • Repeat until the queue is empty

  • Answered by AI
  • Q12. You are given binary tree. Weight of node in binary tree=data present in it*level of that node(root’s level was given to be 1).Find the node in tree with maximum weight
  • Ans. 

    Find node with maximum weight in a binary tree based on data and level of node

    • Calculate weight of each node based on data and level

    • Traverse the binary tree and keep track of node with maximum weight

    • Return the node with maximum weight

  • Answered by AI
  • Q13. You are given infinite sequence of continuos natural numbers-1,2,3,4,5,6.......... Initially you delete every 2nd element so sequence will be 1,3,,5,7,9,11,13..... now in the resultant sequence you dele...
  • Ans. 

    Program to check if a given number is a lucky number or not.

    • Create a function that takes an integer n as input

    • Initialize a variable count to 2

    • Loop through the sequence and delete every count-th element

    • Repeat the above step until the end of the sequence

    • If n is present in the final sequence, return true, else return false

  • Answered by AI
  • Q14. Write the code to find inorder successor of given node in binary tree
  • Ans. 

    Code to find inorder successor of given node in binary tree

    • Check if the given node has a right subtree, if yes then find the leftmost node in the right subtree

    • If the given node does not have a right subtree, then traverse up the tree until we reach a node which is the left child of its parent

    • If we reach the root and the given node is the rightmost node, then there is no inorder successor

  • Answered by AI

Interview Preparation Tips

College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Given an integer array, find all (a,b,c) such that a^2 + b^2 = c^2 Solution is O(n^2) Write code and testcases
  • Ans. 

    Given an integer array, find all (a,b,c) such that a^2 + b^2 = c^2. Solution is O(n^2). Write code and testcases.

    • Use nested loops to iterate through all possible pairs of integers in the array

    • Check if the sum of squares of the two integers is a perfect square

    • If yes, add the triplet to the result list

    • Return the result list

  • Answered by AI
  • Q2. Find the height og a binary tree without recursion. Write code and testcases
  • Ans. 

    Find height of binary tree without recursion

    • Use a stack to keep track of nodes

    • Iteratively traverse the tree and update height

    • Testcases: empty tree, single node tree, balanced tree, unbalanced tree

  • Answered by AI
  • Q3. Given a bit pattern (in an integer INPUT), and another pattern (in an integer PATTERN, with a number n signifying the number of trailing bits to be considered as pattern - remaining bits are zero. Example:...
  • Ans. 

    Count the number of occurrences of a given bit pattern in an integer.

    • Extract the n trailing bits from the pattern and create a mask with all other bits set to zero.

    • Use a sliding window approach to compare the extracted pattern with all possible n-bit sequences in the input integer.

    • Increment a counter every time the extracted pattern matches with a sequence in the input integer.

  • Answered by AI
  • Q4. Given a pointer to the root of a binary tree, find whether the left and right subtrees are mirror images of each other
  • Ans. 

    Given a binary tree, check if left and right subtrees are mirror images of each other.

    • Traverse the tree and compare left and right subtrees recursively.

    • Use a stack or queue to traverse the tree iteratively.

    • Check if the left subtree is a mirror image of the right subtree by comparing their values and structures.

    • Consider an empty tree as a mirror image of itself.

  • Answered by AI
  • Q5. Given a string INPUT, find the longest repeating substring
  • Ans. 

    Find the longest repeating substring in a given string.

    • Create an array of all possible substrings of the given string.

    • Sort the array in lexicographic order.

    • Find the longest common prefix between adjacent strings.

    • Return the longest common prefix found.

    • If no repeating substring is found, return an empty string.

  • Answered by AI
  • Q6. 2 magnesium strips and a matchbox are given. Each burns in 60 minutes, with no relation between length burnt and time. Calculate 45 min
  • Q7. You have 3 baskets- one containing apples, one oranges and the last containing both. All baskets are incorrectly labelled.You can pick *one* fruit from *any one* basket and are supposed to correctly label ...
  • Ans. 

    Pick a fruit from the basket containing both fruits and label the baskets accordingly.

    • Pick a fruit from the basket labelled 'apples and oranges'

    • If you pick an apple, label the basket containing only apples

    • If you pick an orange, label the basket containing only oranges

    • Label the remaining basket as containing both fruits

  • Answered by AI
  • Q8. You're in the center of a circular pond, with an *intelligent* lion at the circumference - intelligent implies you can't trivially fool it. Given that, your swimming speed = x, lion's running speed on l...
  • Ans. 

    Escape from an intelligent lion at the circumference of a circular pond with given speeds.

    • Swim towards the circumference of the pond to make the lion run a longer distance.

    • Once the lion is at a considerable distance, get out of the pond and run in the opposite direction.

    • Use obstacles like trees or rocks to slow down the lion.

    • Try to confuse the lion by changing directions frequently.

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Given a string INPUT, find the longest repeating substring.

Example: if INPUT = ababcbacabc, answer would be abc.

Write testcases.

The most important thing here is that you're supposed to ask questions to resolve ambiguities - the substrings cannot be overlappping.

Example: If INPUT = seattle, the expected answer is t, not e.

Example: If INPUT = ababa, answer = ab, not aba.

All such corner-cases must be considered.
Screening interview:

I had a single screening interview for conversion from Microsoft IDC to Redmond. It was more like a chat - in the initial 10-15 minutes atleast.

The first 10-15 minutes was about:

what i learnt at Microsoft
What was my project about
What did I learn from my project (my answer to this included both, learning in technical sense and personal development.
“Why test?” (IDC had selected me as an SDET, and that’s the profile they’d forwarded)

After that he asked what I liked to do (problem solving etc.) On saying “solving new and challenging problems”, he gave me the question:

Given 3 consecutinve numbers, and that the first and third are prime, is it always true that the middle number is divisible by 3 ? Prove your answer.
This question was majorly to check if I can think and zero in on the solution and the process.

Then, my second (and easy) question was to

Write a code for tokenizing a character stream. The stream starts and ends with a delimiter.
Example: Input: “
Here, the start of the string is denoted by ‘<’, and end by ‘>’.
The expected output is to return(or print) list of individual words. ie: “abc, def, msft, pr-st” (four words)

This is a ridiculously easy thing to code - but they weren’t interested in code. What he wanted to see was:
1. Approach
2. If the logic is sturdy enough and considers all test cases
2. Design choices and decision making (the whole Q revolved around this) - I made a list of test cases that the code should consider. In each case, there is a decision to be made - he wanted to see why I decided what I decided.
Example:
Input: “ a<efg>”
This obviously is something where a normal program would fail. My logic to this was: Discard everything before the first start delimiter, after the first end delimiter.
So my output: “abc, cd”

That was all.

Tips: Mine was a PrePlacement interview process - doesnt differ much from the normal campus, but competition is awesome.

College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Skills evaluated in this interview

HARMAN Interview FAQs

How many rounds are there in HARMAN React Js Frontend Developer interview?
HARMAN interview process usually has 1 rounds. The most common rounds in the HARMAN interview process are Coding Test and Technical.

Tell us how to improve this page.

HARMAN React Js Frontend Developer Interview Process

based on 2 interviews

Interview experience

2.5
  
Poor
View more

Interview Questions from Similar Companies

Google Interview Questions
4.4
 • 873 Interviews
Samsung Interview Questions
3.9
 • 561 Interviews
Dell Interview Questions
4.0
 • 393 Interviews
OPPO Interview Questions
4.0
 • 210 Interviews
LG Electronics Interview Questions
4.0
 • 194 Interviews
Vivo Interview Questions
4.1
 • 192 Interviews
Philips Interview Questions
3.9
 • 158 Interviews
Daikin Interview Questions
4.2
 • 144 Interviews
View all
HARMAN React Js Frontend Developer Salary
based on 5 salaries
₹13.5 L/yr - ₹17.2 L/yr
116% more than the average React Js Frontend Developer Salary in India
View more details
Senior Software Engineer
1.7k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Lead
1.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
1.3k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Engineer
931 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Product Engineer
904 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare HARMAN with

Bose

3.8
Compare

Jbl

3.8
Compare

Sennheiser

4.9
Compare

Sony

4.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview