HARMAN Senior Java Developer Interview Questions and Answers

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...read more

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.

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

The project is a web-based application for managing inventory and sales of a retail store.

• Developed using Java and Spring framework

• Includes features such as product management, order management, and customer management

• Utilizes MySQL database for data storage

• Implemented security measures such as authentication and authorization

• Designed with a responsive user interface for optimal user experience

I am a software developer with a passion for coding and problem-solving. My hobbies include reading and playing video games.

• Proficient in programming languages such as Java and Python

• Strong problem-solving skills

• Good communication and teamwork abilities

• Weakness: Sometimes I tend to overthink and spend too much time on a problem

• Hobbies: Reading books on technology and playing video games

I cannot make a commitment to staying at Samsung at this time.

• I am open to exploring other opportunities

• My decision will depend on various factors such as growth opportunities, work culture, and compensation

• I value my time at Samsung and appreciate the experience gained

DFS and BFS are two popular graph traversal algorithms used in computer science.

• DFS stands for Depth First Search and explores as far as possible along each branch before backtracking.

• BFS stands for Breadth First Search and explores all the vertices at the present depth before moving on to the next level.

• DFS uses a stack data structure to keep track of visited nodes while BFS uses a queue.

• DFS is useful for finding path...read more

Double pointers are used to store the address of a pointer variable.

• Double pointers are useful in dynamic memory allocation.

• They are used to modify the value of a pointer passed to a function.

• They can be used to create linked lists and trees.

• Example: int **ptr; //declares a double pointer to an integer

Permutations of an array

• Permutations are all possible arrangements of elements in an array

• Number of permutations for an array of length n is n!

• Use recursion to generate all permutations

• Swap elements to generate different permutations

My first biggest failure was not being able to clear an important exam in high school.

• Failed to manage time effectively

• Did not seek help from teachers or peers

• Did not practice enough

• Learned the importance of preparation and seeking help

• Improved study habits and time management skills