PDI Software Software Engineer III Interview Questions and Answers

Q1. What is the internal working of a hashmap?
Add your answer
Q2. Design a Least Recently Used (LRU) cache.
Add your answer

Q1. What are the SOLID principles in software engineering?
Add your answer
Q2. What design patterns have you worked with?
Add your answer

Q1. SQL Array Oop
Add your answer
Q2. Array defintiion and uses
Ans. 
An array is a data structure that stores a collection of elements of the same data type.
• Arrays are used to store multiple values in a single variable.

• Elements in an array are accessed by their index, starting from 0.

• Example: String[] names = {"Alice", "Bob", "Charlie"};
Answered by AI
Add your answer
Q3. Data structures and its uses
Ans. 
Data structures are used to organize and store data efficiently in computer memory.
• Data structures help in efficient data retrieval, insertion, and deletion operations.

• Examples include arrays, linked lists, stacks, queues, trees, and graphs.

• Each data structure has its own advantages and use cases based on the requirements of the application.

• For example, arrays are used for random access to elements, while linked lists
Answered by AI
Add your answer

3 coding questions, medium

Q1. Related to string and prefix sum
Add your answer
Q2. How priority queue works and its implementation using min heap
Ans. 
Priority queue is a data structure that stores elements based on their priority, allowing for efficient retrieval of the highest priority element.
• Priority queue can be implemented using a min heap, where the root node always contains the minimum element.

• Insertion: Add the new element to the end of the heap and then heapify up to maintain the min heap property.

• Deletion: Remove the root node (minimum element), move the l...read more
Answered by AI
Add your answer

Q1. List, tuple Decorators
Add your answer
Q2. What is the process for removing duplicates from a list?
Add your answer

Q1. What is the difference between normal and arrow functions
Ans. 
Arrow functions are more concise and have a lexical 'this' binding compared to normal functions.
• Arrow functions do not have their own 'this' keyword, they inherit it from the parent scope.

• Arrow functions do not have their own 'arguments' object.

• Arrow functions cannot be used as constructors with 'new'.

• Arrow functions are more concise and have implicit return when no curly braces are used.
Answered by AI
Add your answer
Q2. All basic JS Questions to cover Hoisting closure
Add your answer
Q3. They asked to show me an example using the API call
Add your answer
Q4. Difference between forEach and Map
Ans. 
forEach is used to iterate over an array and perform a function on each element, while map creates a new array by applying a function to each element.
• forEach does not return a new array, while map does

• forEach does not modify the original array, while map creates a new array

• forEach is used for side effects, while map is used for transformation

• Example: forEach - array.forEach(item => console.log(item)), map - const newAr
Answered by AI
Add your answer

Q1. What is Observables, Services, Promises, Closure ?
Add your answer

Permutations and combinations

Q1. Oops concepts , reverse string
Add your answer

3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round

Q1. Implement an app similar to splitwise
Add your answer