XYZ Distributors Software Developer Interview Questions and Answers

Q1. LRU Cache - how to tackle
Ans. 
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
• Implement using a doubly linked list and a hashmap for efficient operations

• When an item is accessed, move it to the front of the list

• When the cache is full, remove the least recently used item from the end of the list
Answered by AI
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

3 Medium level dsa questions

Q1. Lld of cab booking system
Ans. 
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
• Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.

• Define the interactions between these components and how data flows between them.

• Specify the data structures and algorithms used for efficient bookin...read more
Answered by AI
Add your answer
Q2. Discussion about online assesment
Add your answer

Q1. Functional interface
Add your answer
Q2. Find if array of numbers, which are prime, using streams
Ans. 
Use streams to find prime numbers in an array
• Use Java streams to filter out non-prime numbers from the array

• Check if a number is prime by dividing it by all numbers less than its square root

• Create a method to check if a number is prime
Answered by AI
Add your answer

DSA + JAVA + Spring boot

LLD (bookmyshow) + DSA

What is your name write it in binary format using Ensemble language and how to optimize super computer

Q1. Sort an array in O(nlogn)
Ans. 
Use merge sort algorithm to sort the array in O(nlogn) time complexity.
• Implement merge sort algorithm which divides the array into two halves, recursively sorts the halves, and then merges the sorted halves.

• Time complexity of merge sort is O(nlogn) where n is the number of elements in the array.

• Example: ['apple', 'banana', 'cherry', 'date'] can be sorted using merge sort in O(nlogn) time complexity.
Answered by AI
Add your answer
Q2. Find element in sorted Array
Ans. 
Use binary search to find element in sorted array efficiently.
• Start with middle element and compare with target

• If target is less, search left half, if greater search right half

• Repeat until element is found or search space is empty
Answered by AI
Add your answer

30 min .. time, speed, distance

Normal easy qus via leetcode