Subtlelabs Software Solutions Interview Questions and Answers

There were questions related to apitude, some basic oops, ds and os questions, 1 coding question. All were pen paper in one go.

Q1. Introduce yourself
Add your answer
Q2. Questions on database
Add your answer
Q3. One programing question
Add your answer

Q1. Introduce yourself
Ans. 
I am a software engineer with 5 years of experience in developing web applications using Java, Spring Boot, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring Boot, and Angular

• Strong problem-solving skills

• Experience working in Agile development environment
Answered by AI
Add your answer
Q2. Some questions on oops concepts
Add your answer

Q1. React live coding
Add your answer
Q2. What is the explanation of closures and promises in JavaScript?
Ans. 
Closures are functions with access to their outer scope, while promises handle asynchronous operations in JavaScript.
• A closure is created when a function retains access to its lexical scope even when the function is executed outside that scope.

• Example of a closure: function outer() { let count = 0; return function inner() { count++; return count; }; }

• Promises represent the eventual completion (or failure) of an asynchr...read more
Answered by AI
Add your answer

Oops, aptitude, coding

Q1. Quick sort algorithm
Ans. 
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into smaller subarrays.
• Divide the array into two subarrays based on a pivot element

• Recursively sort the subarrays

• Combine the sorted subarrays to get the final sorted array

• Time complexity is O(n log n) on average, but can degrade to O(n^2) in worst case
Answered by AI
Add your answer
Q2. Explain working of quick sort
Ans. 
Quick sort is a divide-and-conquer algorithm that recursively divides an array into smaller subarrays based on a pivot element.
• Choose a pivot element from the array

• Partition the array into two subarrays - elements less than pivot and elements greater than pivot

• Recursively apply quick sort to the subarrays

• Combine the sorted subarrays to get the final sorted array
Answered by AI
Add your answer