Eye Care Leaders Software Developer Interview Questions and Answers

Q1. Prepare well on arrays, lists and its operations
Add your answer
Q2. Get to know well about your current project
Add your answer

Q1. Oops related insharitance encapsulation
Add your answer

They asked easy to medium DSA . It includes arrays, strings, recursion.

Q1. Basic introduction and soo on.
Add your answer

Question related to profile.

Aptitude test questions

Q1. Self introduction
Add your answer

It was medium to difficult level test

Q1. Questions about core subjects like oops pillars
Add your answer
Q2. Questions about projects, technologies used
Add your answer

Q1. Why do you want to join this
Add your answer
Q2. Your previous experience and questions about your background
Add your answer

Two Easy questions to be solved

Q1. Some Technical based questions
Add your answer
Q2. It was amazing . Interviewer asked me to code for heap sort and asked me to explain.
Add your answer
Q3. Write a code for heap sort algorithm and explain it?
Ans. 
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• Heap sort works by building a binary heap from the array and then repeatedly extracting the maximum element and placing it at the end of the array.

• The heap is maintained as a complete binary tree, where each parent node is greater than or equal to its children.

• The time complexity of heap sort is O(n log n) and it is an in-place sor...read more
Answered by AI
Add your answer