Upload Button Icon Add office photos

HARMAN

Compare button icon Compare button icon Compare

Filter interviews by

HARMAN Associate Software Developer Interview Questions and Answers

Updated 14 Sep 2024

HARMAN Associate Software Developer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Reasoning , bloos relation

Round 2 - Coding Test 

.net, angular,c++, web development

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Off-campus interviews in Bangalore

Interview Preparation Tips

Round: Test
Experience: Only a few students will get shortlisted who do all the questions correctly.

Round: Other Interview
Experience: First 4 rounds on day 1 and this are just to shortlist for more rounds on some other day.
Tips: They will focus on almost all the concepts of computer science.You need to practice a lot and start it right now. Should be easy if you have prepared well enough. Use your holidays to start preparing for placements.

General Tips: Sooner you start, better your placement will be as lack of practice & last day study works only for exams but never for interviews. You'll get enough time to prepare for interviews once you get shortlisted. Focus on it even if you are placed already.
Skill Tips: They will focus on almost all the concepts of computer science.
Skills: C , Aptitude
College Name: NIT SURATHKAL

I was interviewed in Dec 2016.

Interview Preparation Tips

Round: Technical Interview
Experience: On-site interview (5 hours).

4 back-to-back 45-minute coding interviews, followed by a design interview, with a lunch break with a Googler in the middle.

The first coding interview was a set of (surprisingly) trivial (no algorithms needed) incremental coding questions.

The two next coding interviews were problems straight from the "Cracking the coding interview" book. Even though I divulged that I'd solved pretty much exactly the same problem before, they didn't give me an alternative problem and I quickly coded up a general and optimal solution for the problems. Follow-up in-depth questions were minimal and not hard.

The last coding question was a pure algorithm question related to search trees/tries. No coding required, spent the whole time reasoning about the most effective algorithm. This was a bit of a brain twister.

The design question was related to high-level system design (not OO design) for storage and search in geographic data. Focus was effective search as well as scalability both in traffic and data volumes.

Tips: Read "Cracking the coding interview" or other similar literature. Solve all the problems and you should be good to go. If you solve a bunch of problems at HackerRank (or similar) as well, you'll have the added bonus of training on how to generalize the algorithms.

Interview Preparation Tips

Round: Test
Experience: The first consisted of an online test which had an aptitude section which was pretty simply and then a programming section consisting of three different programs. The programs were logical required basic knowledge of array, sorting and a little bit of data structures.

Round: Technical Interview
Experience: Around 13 of us were shortlisted for the interview round, B.Tech and M.Tech included. The interview round was mostly interactive, where we had to mention about the various interns that we went through. A few programming questions were asked based on topics which we were comfortable with.
Tips: Just get used to coding, data structures and basic aptitude. GRE preparation as such helped me.

Round: HR Interview
Experience: Finally there was a HR round in which I was asked as to why I would like to work in Samsung R&D and general things about interests and future plans. On the whole Samsung took 3 B.Tech students and 2 M.Tech students when they came for placements apart from PPOs.

General Tips: Personally I feel that one should apply in only those companies in which they are sure of having job satisfaction. So don't apply to companies which you are not interested in just for the sake of having a backup because once you are placed you do not have a second chance.
Do not get dejected if you do not get through in the first few tries. Keep your hopes up and be confident when ever you get to interview rounds. Try to be assertive when giving answers. It is some times exhausting to go through placements but the moment you get placed you will have the best feeling ever.
Skill Tips: Just chill and take the test. Once you clear the online test, irrespective of your pointer if you have a good profile you can convince the interviewers.
Skills:
College Name: NIT Surathkal

I applied via Referral

Interview Questionnaire 

3 Questions

  • Q1. Given two sorted arrays, say A and B, find A ­ B. Here, A ­ B means all those elements present in A but not in B. The expected time complexity was O(m + n), if A is of size m and B is of size n
  • Ans. 

    Find A-B of two sorted arrays A and B in O(m+n) time complexity.

    • Create two pointers, one for each array, and compare the elements at those pointers.

    • If the element in A is smaller, add it to the result array and move the A pointer forward.

    • If the element in B is smaller, move the B pointer forward.

    • Repeat until one of the pointers reaches the end of its array.

    • Add any remaining elements in A to the result array.

    • Time comple...

  • Answered by AI
  • Q2. 1. Write a routine to output the elements of the inorder traversal of a binary tree one by one in its each call. eg: Assuming the inorder traversal is 1, 2, 3, 4, 5, the routine should return 1 in its fi...
  • Ans. 

    The routine should output the elements of the inorder traversal of a binary tree one by one in each call.

    • Implement an inorder traversal algorithm recursively

    • Use a global variable or pass a reference to keep track of the current element

    • Call the routine repeatedly to get the next element in each call

  • Answered by AI
  • Q3. Given a set of courses along with the prerequisite courses for these courses, write a program to find the minimum number of semesters required to wrap up all the courses
  • Ans. 

    Program to find minimum semesters required to complete courses with prerequisites

    • Create a graph with courses as nodes and prerequisites as edges

    • Use topological sorting to find the order of courses to be taken

    • Calculate the minimum number of semesters based on the order obtained

    • Handle cases where there are cycles in the graph

  • Answered by AI

Interview Preparation Tips

Skills:
College Name: NA

Skills evaluated in this interview

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

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.

HARMAN Interview FAQs

How many rounds are there in HARMAN Associate Software Developer interview?
HARMAN interview process usually has 2 rounds. The most common rounds in the HARMAN interview process are Aptitude Test and Coding Test.

Tell us how to improve this page.

HARMAN Associate Software Developer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Google Interview Questions
4.4
 • 822 Interviews
Samsung Interview Questions
3.9
 • 545 Interviews
Dell Interview Questions
4.0
 • 385 Interviews
OPPO Interview Questions
4.0
 • 209 Interviews
LG Electronics Interview Questions
4.0
 • 194 Interviews
Vivo Interview Questions
4.1
 • 193 Interviews
Philips Interview Questions
3.9
 • 157 Interviews
Daikin Interview Questions
4.2
 • 144 Interviews
View all
HARMAN Associate Software Developer Salary
based on 18 salaries
₹4 L/yr - ₹7.2 L/yr
9% less than the average Associate Software Developer Salary in India
View more details

HARMAN Associate Software Developer Reviews and Ratings

based on 2 reviews

1.8/5

Rating in categories

1.8

Skill development

1.8

Work-life balance

1.8

Salary

1.3

Job security

1.3

Company culture

1.3

Promotions

1.3

Work satisfaction

Explore 2 Reviews and Ratings
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