10+ Interview Questions and Answers

Finding duplicates between two sorted arrays

• Use two pointers to traverse both arrays simultaneously

• If the elements at the pointers are equal, add to duplicates list and increment both pointers

• If not, increment the pointer with the smaller element

• Repeat until one of the arrays is fully traversed

I have 5 years of experience working with Java in various projects.

• Developed web applications using Java EE framework

• Utilized Spring framework for dependency injection and MVC architecture

• Worked with Hibernate for ORM mapping

• Implemented multithreading and concurrency in Java applications

• Used Java for backend development in enterprise systems

Print only prime numbers.

• Iterate through numbers and check if they are divisible by any number less than itself

• If not divisible, print the number as prime

• Exclude 0, 1 and negative numbers as they are not prime

Check if a string is a substring of another string

• Use the indexOf() method to check if the substring exists in the main string

• If indexOf() returns -1, the substring is not present

• If indexOf() returns a value greater than -1, the substring is present

Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.

• Normalization involves breaking down data into smaller, more manageable parts.

• It helps in reducing data redundancy by storing data in a structured way.

• Normalization ensures data integrity by avoiding anomalies like insertion, update, and deletion anomalies.

• There are different normal forms like 1NF, 2NF, 3NF, BCNF, etc., each with specific rules to follow.

• For example, ...read more

Find the nearest word in a matrix of strings

• Create a matrix of strings

• Calculate the distance between the input word and each word in the matrix

• Return the word in the matrix with the smallest distance to the input word

Find the smallest subset of strings in an array

• Iterate through the array and compare the length of each string to find the smallest subset

• Use a variable to keep track of the smallest subset found so far

• Return the smallest subset at the end

Java fundamentals include object-oriented programming, platform independence, and strong typing.

• Object-oriented programming: Java supports classes, objects, inheritance, and polymorphism.

• Platform independence: Java code can run on any platform with the help of JVM.

• Strong typing: Java enforces strict data type checking to prevent errors.

Scheduling algorithm is a method used to determine the order of tasks to be executed on a computer system.

• Scheduling algorithms help in optimizing resource utilization and improving system performance.

• Examples of scheduling algorithms include First Come First Serve, Shortest Job Next, Round Robin, etc.