Data Group Compounding Engineer Interview Questions and Answers

Q1. Oops concepts, lots of java
Add your answer
Q2. In depth about Microservices
Add your answer
Q3. About why I want to join
Add your answer

Q1. Asked about Java,spring MVC,code snippets asked foroutput
Add your answer

Q1. About rest template angular spring boot
Add your answer

Q1. This round is withmanager about technical
Add your answer

Q1. Salary discussion with hr policies
Add your answer

Q1. No round was happened
Add your answer

Q1. Previous projects, Basic React Questions and Node js questions.
Add your answer

Fetching data from api, DSA question (Queue implementation)

Q1. Salary and package discussion
Add your answer

Q1. Managerial round - just project explanation
Add your answer

Q1. 1.polyfill map, currying vs closure, reduce method, explain this?, 2.what is lazyload and suspense, single thread vs multi thread, Event loop(task queue & microtask queue)?
Add your answer
Q2. Explain redux? Redux vs context api? ES6 features? Rest vs Spread? null vs undefined?
Ans. 
Redux is a predictable state container for JavaScript apps.
• Redux is a state management library for JavaScript applications.

• It helps in managing the state of an application in a predictable way.

• Redux follows a unidirectional data flow pattern.

• Context API is a built-in feature of React that can be used for state management, but it is not as powerful as Redux.

• ES6 features include arrow functions, template literals, destru...read more
Answered by AI
Add your answer

Output based question regarding shallow and deepcopy related to object.
write a program for i/p: "This is the JS guide, developer!" o/p: "sihT si eht SJ ,ediug !repoleved"
react timer based output start, stop and reset.

Q1. Java hash map and how it works
Ans. 
Java hash map is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values based on keys.
• HashMap in Java implements the Map interface and allows null keys and values.

• It uses hashing to store and retrieve key-value pairs, providing O(1) time complexity for get() and put() operations.

• Example: HashMap<String, Integer> map = new HashMap<>(); map.put("key", 1); int value = map.
Answered by AI
Add your answer

Q1. 1.SOLID Principles: Define in detail the solid principles, interviewer will be more focused on the practical examples of the principles.
Ans. S stands for single responsibility, O stands for Open for extension and closed for modification, L stands for Liskov Substitution principle, I stands for Inversion of control and D stands for Dependency inversion
Answered by Sweta Lavania
Add your answer

Q1. Coding questions like implement linked list
Add your answer
Q2. Find the second largest element from the array.
Ans. 
Find the second largest element from the array.
• Sort the array in descending order and return the second element.

• Iterate through the array and keep track of the two largest elements.

• Use a priority queue to find the second largest element.
Answered by AI
Add your answer
Q3. Sort the array and return second last element
Ans. 
Sort array and return second last element
• Use built-in sort function

• Access second last element using array index -2
Answered by AI
Add your answer