Upload Button Icon Add office photos

HARMAN

Compare button icon Compare button icon Compare

Filter interviews by

HARMAN Software Developer Intern Interview Questions and Answers

Updated 5 Feb 2024

HARMAN Software Developer Intern Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(3 Questions)

  • Q1. 1. Check all the permutations of palindrome in an array
  • Ans. 

    Find all permutations of palindromes in an array of strings.

    • Iterate through each string in the array.

    • For each string, generate all possible permutations.

    • Check if each permutation is a palindrome.

    • Return the list of palindromic permutations.

  • Answered by AI
  • Q2. 2. Toggle a bit
  • Ans. 

    Toggle a bit in a binary number

    • Convert the number to binary representation

    • Identify the bit position to toggle

    • Toggle the bit using bitwise XOR operator

    • Convert the modified binary number back to decimal

  • Answered by AI
  • Q3. 3. Swap numbers using bit operators
  • Ans. 

    Swapping numbers using bit operators.

    • Use XOR operator to swap two numbers without using a temporary variable

    • XORing a number with itself results in 0

    • Example: a = 5, b = 7. a ^= b; b ^= a; a ^= b; // a = 7, b = 5

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 180 Minutes
Round difficulty - Medium

Round was held in the morning at 10 am.

  • Q1. 

    M - Coloring Problem Statement

    Given an undirected graph with 'N' nodes in the form of an adjacency matrix and an integer 'M', determine if it is possible to color the vertices of the graph using at most ...

  • Ans. 

    The problem involves determining if a given graph can be colored with at most 'M' colors without adjacent vertices sharing the same color.

    • Create a function that takes the adjacency matrix, number of nodes 'N', and maximum number of colors 'M' as input.

    • Implement a graph coloring algorithm such as backtracking or greedy coloring to check if the graph can be colored with at most 'M' colors.

    • Check if adjacent vertices have ...

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 40 Minutes
Round difficulty - Medium

The round was held in the evening

  • Q1. 

    Trie Data Structure Implementation

    Design and implement a Trie (prefix tree) to perform the following operations:

    • insert(word): Add a string "word" to the Trie.
    • search(word): Verify if the string "w...
  • Ans. 

    Implement a Trie data structure to insert, search, and check for prefixes in strings.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert, search, and startsWith methods in the Trie class.

    • Use a Trie to efficiently store and search for strings based on prefixes.

    • Example: insert 'apple', search 'apple' returns true, startsWith 'app' returns true, search 'app' returns false.

  • Answered by AI
Round 3 - HR 

Round duration - 10 Minutes
Round difficulty - Easy

Was held in the morning around 9 am

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in NoidaEligibility criteriaAbove 7 CGPASamsung interview preparation:Topics to prepare for the interview - OOPS, Algorithms, Operating System, DBMS, Data StructuresTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Focus on graphs, most questions are from this topic
Tip 2 : Prepare well about the projects you mention in your resume
Tip 3 : Do not fill the resume with too many things. Keep it simple

Application resume tips for other job seekers

Tip 1 : Have 2-3 projects on resume. But also be prepared to answer questions related to the projects.
Tip 2 : Do not mention too many things. Keep it short and simple

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

This was coding round and was conducted on Cocubes platform. It is not IDE but kind of white board coding platform. C/C++, Java and Python were only allowed languages.

Round 2 - Coding Test 

Round duration - 30 minutes
Round difficulty - Easy

This was pen and paper round. Total 40 shortlisted candidates were grouped into 8 groups (each of 5). Each group was given a coding question which they have to solve on paper and explain it to the recruiter. 2 to 3 from each group were selected for the next round.

Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was general face to face Data Structures and Algorithms based round.

  • Q1. How do you perform a spiral order traversal of a binary tree? Please provide an explanation or code to print the binary tree in spiral order.
  • Ans. 

    Spiral order traversal of a binary tree involves printing nodes level by level alternating between left to right and right to left.

    • Start by pushing the root node into a queue.

    • While the queue is not empty, pop a node, print its value, and push its children into the queue.

    • For each level, alternate between printing nodes from left to right and right to left.

    • Repeat until all nodes are printed in spiral order.

  • Answered by AI
Round 4 - HR 

Round duration - 45 minutes
Round difficulty - Easy

It was the last round.

Interview Preparation Tips

Professional and academic backgroundI completed Electronics & Communication Engineering from Veermata Jijabai Technological Institute. I applied for the job as SDE - 1 in UlhasnagarEligibility criteriaCGPA above 7.5 Samsung interview preparation:Topics to prepare for the interview - Only Data Structures and Algorithms.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Be real during the interview and don’t show off. Also, practice Data Structures and Algorithms based problems as only through practice you will be able to solve questions quickly during the interview. Also prepare for theory subjects like Object-Oriented Programming System, Database Management System, Computer networks, etc.

Application resume tips for other job seekers

Keep your resume simple. Prefer LaTeX. Don't use colourful templates. They are too common and very unprofessional. Keep it black and white and keep your content richer. Keep it of 1 page and 2 pages only if you have achieved a lot. Don’t use fillers. Any unwanted information on the resume leaves a bad impact on the interviewer.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

This was an online coding round where we had 3 questions to solve under 120 minutes. The questions were of medium to hard difficulty level.

  • Q1. 

    Minimum Time in Wormhole Network

    Determine the minimum time required to travel from a starting point to a destination point in a two-dimensional coordinate system, considering both direct movement and the...

  • Ans. 

    Find the minimum time to travel from a starting point to a destination point using direct movement and wormholes.

    • Calculate the time taken for direct movement from source to destination.

    • Consider using each wormhole to see if it reduces the total travel time.

    • Choose the path with the minimum total time to reach the destination.

  • Answered by AI
  • Q2. 

    Substrings Differ by One Problem Statement

    Ninja needs help in a battle against the string man. Given two strings, 'S' and 'T', the task is to find the number of substrings in 'S' that differ from some su...

  • Ans. 

    The task is to find the number of substrings in 'S' that differ from some substrings of 'T' by exactly one character.

    • Iterate through all substrings of 'S' and 'T' and compare them character by character to find the ones that differ by exactly one character.

    • Use nested loops to generate all possible substrings of 'S' and 'T'.

    • Count the number of substrings that differ by exactly one character and return the total count.

  • Answered by AI
  • Q3. 

    Power of Two Problem Statement

    Determine whether a given integer N is a power of two. Return true if it is, otherwise return false.

    Explanation

    An integer 'N' is considered a power of two if it can be e...

  • Ans. 

    Check if a given integer is a power of two or not.

    • Check if the given integer is greater than 0.

    • Check if the given integer has only one bit set in its binary representation.

    • Return true if the above conditions are met, else return false.

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions related to DSA where I was first expected to explain my approaches and then discuss the time and space complexities of my solution. After that , I was asked some core concepts related to OS.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers - prev, current, and next to reverse the linked list in O(N) time and O(1) space complexity.

    • Update the head of the reversed linked list as the last node encountered during reversal.

  • Answered by AI
  • Q2. 

    Cycle Detection in Undirected Graph Problem Statement

    You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...

  • Ans. 

    Detect cycles in an undirected graph.

    • Use Depth First Search (DFS) to detect cycles in the graph.

    • Maintain a visited array to keep track of visited vertices.

    • If a visited vertex is encountered again during DFS, a cycle exists.

    • Check for cycles in each connected component of the graph.

    • Example: For input N=3, Edges=[[1, 2], [2, 3], [1, 3]], output is Yes.

  • Answered by AI
  • Q3. What are the differences between a mutex and a semaphore?
  • Ans. 

    Mutex is used for exclusive access to a resource by only one thread at a time, while semaphore can allow multiple threads to access a resource simultaneously.

    • Mutex is binary semaphore with ownership, used for mutual exclusion.

    • Mutex is typically used to protect critical sections of code.

    • Semaphore is a signaling mechanism, used for synchronization between multiple threads.

    • Semaphore can have a count greater than 1, allowi...

  • Answered by AI
  • Q4. What is meant by multitasking and multithreading in operating systems?
  • Ans. 

    Multitasking refers to the ability of an operating system to run multiple tasks concurrently, while multithreading involves executing multiple threads within a single process.

    • Multitasking allows multiple processes to run simultaneously on a single processor, switching between them quickly to give the illusion of parallel execution.

    • Multithreading involves breaking a process into multiple threads that can be executed ind...

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their
approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

  • Q1. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
  • Q2. 

    Find The Repeating And Missing Number Problem Statement

    You are provided with an array nums which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...

  • Ans. 

    Given an array of first N positive integers with one number repeating and one missing, find the repeating and missing numbers.

    • Iterate through the array and keep track of the sum of elements and sum of squares to find the missing and repeating numbers.

    • Use a set to identify the repeating number and calculate the missing number based on the sum of elements.

    • Example: For nums = [1, 2, 3, 4, 4, 5], the repeating number is 4

  • Answered by AI
  • Q3. What is the Diamond Problem in C++ and how can it be resolved?
  • Ans. 

    Diamond Problem in C++ is a common issue in multiple inheritance where a class inherits from two classes that have a common base class.

    • Diamond Problem occurs when a class inherits from two classes that have a common base class, leading to ambiguity in accessing members.

    • It can be resolved in C++ using virtual inheritance, where the common base class is inherited virtually to avoid duplicate copies of base class members.

    • ...

  • Answered by AI
  • Q4. What are friend functions in C++?
  • Ans. 

    Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.

    • Friend functions are declared inside a class with the 'friend' keyword.

    • They can access private and protected members of the class.

    • They are not member functions of the class, but have the same access rights as member functions.

    • Friend functions are useful for implementing operators that are not membe...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASamsung interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 180 minutes
Round difficulty - Easy

This was Online Coding round on Samsung Software. There were 50 test cases and all test cases should be passed to get selected.

Round 2 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

This was also Face to Face coding Interview totally based on Data Structures and Algorithms.

  • Q1. The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.
  • Ans. 

    The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence with increasing order.

    • Use dynamic programming to solve the LIS problem efficiently.

    • Maintain an array to store the length of the LIS ending at each element.

    • Iterate through the array and update the LIS length based on previous elements.

    • Example: For input [10, 22, 9, 33, 21, 50, 41, 60, 80], the LIS is [10

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

This Face to Face Interview was Based on coding and projects.

  • Q1. Implement the Depth First Search (DFS) algorithm for a graph.
  • Ans. 

    DFS is a graph traversal algorithm that explores as far as possible along each branch before backtracking.

    • Start at a node and explore as far as possible along each branch before backtracking

    • Use a stack to keep track of nodes to visit

    • Mark visited nodes to avoid revisiting them

    • Recursive implementation is common

  • Answered by AI
Round 4 - HR 

Round duration - 15 minutes
Round difficulty - Easy

HR round was mainly based on questions about myself and my knowledge about the company.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from SRM Institute of Science & Technology. I applied for the job as SDE - 1 in NoidaEligibility criteria Above 70 %Samsung interview preparation:Topics to prepare for the interview - Data Structures , Algorithms, C++ ,JAVATime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Always remember question-solving is not everything in the interview, its a part of interview. Communicating well with the interviewer is most important thing during the interview. Also practice lot of Data Structures and Algorithms based questions that I have practiced from Coding Ninjas and on other coding portals. 

Application resume tips for other job seekers

Mention good projects and only those skills in which you are confident.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Nov 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

It was in the morning at our institute. There were technical and aptitude problems.

  • Q1. 

    Star Pattern Generation

    Develop a function to print star patterns based on the given number of rows 'N'. Each row in the pattern should follow the format demonstrated in the example.

    The picture illustra...

  • Ans. 

    Function to print star patterns based on the given number of rows 'N'.

    • Iterate through each row from 1 to N

    • For each row, print spaces (N-row) followed by stars (2*row-1)

    • Repeat until all rows are printed

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Medium

It was actually a Techno HR round. I was asked some technical questions about OS, OOPS, COMPUTER NETWORKING, WEB DEVELOPMENT. He went through my whole resume, asked about all the projects and past working experiences. The interviewer was really good, we talked about so many other topics, from Women empowerment to Water Crises. I felt really confident while speaking because he made me so comfortable.

  • Q1. 

    Selection Sort Algorithm

    Selection sort is a sorting technique that works by repeatedly finding the minimum element (considering ascending order) from the unsorted part and placing it at the beginning of ...

  • Ans. 

    Selection Sort Algorithm sorts an array by repeatedly finding the minimum element and placing it at the beginning of the unsorted part.

    • Iterate through the array to find the minimum element and swap it with the first unsorted element.

    • Repeat this process for each element in the array until it is fully sorted.

    • Time complexity of Selection Sort is O(n^2) making it inefficient for large arrays.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from MKSSS's Cummins College of Engineering For Women, Pune. I applied for the job as SDE - 1 in BangaloreEligibility criteriaAbove 7 CGPADell India interview preparation:Topics to prepare for the interview - Data structures and Algorithms, DBMS, OOPS, OS, NETWORKING, WEB DEVELOPMENTTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Study data structures thoroughly and practice coding regularly. Do practice it on Leetcode as it has a lot of test cases, I personally find it really helpful. 
Tip 2 : Learn new skills and make projects with them to get the most out of them. 
Tip 3 : Do study other basic and very important subjects like Oops, DBMS, OS.

Application resume tips for other job seekers

Tip 1 : Do mention your achievements and other co curricular activities. 
Tip 2 : Your projects are a big highlight, keep them crisp and be prepared to explain them thoroughly.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Jun 2021. There were 4 interview rounds.

Round 1 - Coding Test 

2 coding questions (1 DP + 1 Graph)

Round 2 - One-on-one 

(1 Question)

  • Q1. Leetcode easy, medium questions on tree, dp
Round 3 - One-on-one 

(2 Questions)

  • Q1. 1 coding question on string (hard).
  • Q2. OS, DBMS, OOPs questions
Round 4 - HR 

(1 Question)

  • Q1. Usual HR questions + 2 puzzles question

Interview Preparation Tips

Interview preparation tips for other job seekers - Make sure to have clear understanding of Computer Science subjects OS, DBMS, OOPs

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

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

HARMAN Interview FAQs

How many rounds are there in HARMAN Software Developer Intern interview?
HARMAN interview process usually has 1 rounds. The most common rounds in the HARMAN interview process are One-on-one Round.
What are the top questions asked in HARMAN Software Developer Intern interview?

Some of the top questions asked at the HARMAN Software Developer Intern interview -

  1. 1. Check all the permutations of palindrome in an ar...read more
  2. 3. Swap numbers using bit operat...read more
  3. 2. Toggle a ...read more

Tell us how to improve this page.

HARMAN Software Developer Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

HARMAN Software Developer Intern Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

4.0

Skill development

5.0

Work-life balance

4.0

Salary

4.0

Job security

5.0

Company culture

4.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Senior Software Engineer
1.7k salaries
unlock blur

₹8.1 L/yr - ₹26 L/yr

Technical Lead
1.5k salaries
unlock blur

₹10.5 L/yr - ₹37 L/yr

Software Engineer
1.3k salaries
unlock blur

₹3.8 L/yr - ₹14.1 L/yr

Senior Engineer
962 salaries
unlock blur

₹7.5 L/yr - ₹29.9 L/yr

Senior Product Engineer
898 salaries
unlock blur

₹6 L/yr - ₹25.2 L/yr

Explore more salaries
Compare HARMAN with

Samsung

3.9
Compare

Vivo

4.1
Compare

OPPO

4.0
Compare

Dell

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