Enterslice Software Developer Interview Questions and Answers

Q1. What is DBMS structure
Add your answer
Q2. What is API and MQTT
Add your answer

Q1. Core java - collection framework
Add your answer

Q1. Advance java - spring boot
Add your answer

Q1. Data Structure and algorithm
Add your answer
Q2. System design question
Add your answer

Q1. How dis you tackle the one incident where you disagree with the team lead approach?
Add your answer
Q2. How do you make sure to deliver on time when there are uncertainty?
Ans. 
To deliver on time despite uncertainty, I prioritize tasks, communicate effectively, set realistic deadlines, and have contingency plans.
• Prioritize tasks based on importance and impact on project timeline

• Communicate effectively with team members and stakeholders to address any uncertainties or roadblocks

• Set realistic deadlines taking into account potential delays or uncertainties

• Have contingency plans in place to mitig...read more
Answered by AI
Add your answer

2 Questions - One Easy and One Medium

Q1. Some Basics of DBMS and one DSA related question
Add your answer

Time and work ,time and distance

Q1. There were 3 dsa questions which were of topic arrays and strings
Add your answer

Q1. It was more like a managerial round where they asked questions about resume projects and past experience
Add your answer

Basic quant questions and logical reasoning, c++ and java

Q1. Find the palindrome in the string?
Ans. 
To find palindromes in a string, compare characters from both ends towards the middle.
• Iterate through each string in the array

• Check if the string is equal to its reverse to determine if it's a palindrome

• Examples: 'level', 'radar', 'madam'
Answered by AI
Add your answer
Q2. Difference between linked list and array?
Ans. 
Arrays store elements in contiguous memory locations, while linked lists store elements in nodes with pointers to the next node.
• Arrays have fixed size, while linked lists can dynamically grow or shrink.

• Accessing elements in arrays is faster (O(1)), while in linked lists it is slower (O(n)).

• Inserting or deleting elements in arrays can be inefficient, while in linked lists it is efficient.

• Example: Array - [1, 2, 3, 4], L
Answered by AI
Add your answer

Q1. Are you comfortable with relocating?
Add your answer
Q2. Tell us about your family members?
Add your answer