Seligent Consulting Java Full Stack Developer Interview Questions and Answers

Factorial can be calculated using a loop by multiplying numbers from 1 to n.

• Initialize a variable to 1

• Use a loop to multiply the variable with numbers from 1 to n

• Return the variable

Object-oriented programming (OOP) is a programming paradigm that uses objects to represent and manipulate data.

• Encourages modular and reusable code

• Provides a clear structure and organization to the code

• Allows for easier maintenance and updates

• Supports code reusability through inheritance and polymorphism

• Enables encapsulation, hiding the internal details of an object

• Promotes code extensibility and scalability

• Facilitates...read more

I want to join ATOS because of their reputation for innovation and their commitment to employee growth and development.

• ATOS is known for its innovative solutions in the software development industry.

• I am impressed by ATOS's focus on employee growth and development through training programs and career advancement opportunities.

• ATOS has a strong reputation for delivering high-quality software solutions to its clients.

• I b...read more

Code for rand7 using rand5 function

• Use rand5 twice to generate a number in [1,25] with equal probability

• If the number is greater than 21, discard and try again

• Otherwise, return (number mod 7) + 1

LRU cache is implemented using a doubly linked list and a hash map.

• Create a doubly linked list to keep track of the order of elements in the cache.

• Create a hash map to store the key-value pairs of the cache.

• When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.

• When an element is accessed, move it to the front of the linked list to...read more

Function to randomly select pivot element in Quick Sort

• Generate a random index within the range of the array

• Return the element at the randomly generated index as the pivot

Count the number of pairs in an array whose sum is equal to a given number k.

• Iterate through the array and for each element, check if k minus the element exists in the array.

• Use a hash table to store the frequency of each element in the array.

• If the array contains duplicates, handle them separately to avoid overcounting.

• Time complexity can be improved to O(n) using a two-pointer approach.