Jupiter Hospital Software Developer Interview Questions and Answers

Q1. React hooks, Explain using code
Ans. 
React hooks are functions that let you use state and other React features without writing a class.
• Hooks are functions that let you use state and other React features in functional components

• useState() is a hook that allows you to add state to functional components

• useEffect() is a hook that allows you to perform side effects in functional components

• useContext() is a hook that allows you to use the context API in functio
Answered by AI
Add your answer
Q2. Factory Patterns?
Add your answer
Q3. Liskov Substitution Principle
Ans. 
Liskov Substitution Principle states that objects of a superclass should be replaceable with objects of its subclasses without affecting the program's correctness.
• Subtypes must be substitutable for their base types.

• Derived classes must be able to replace their base classes without affecting the program's behavior.

• Violating this principle can lead to unexpected behavior and errors in the code.

• Example: If a program expec...read more
Answered by AI
Add your answer
Q4. Oops Concept and give examples
Ans. 
Oops concept is a programming paradigm that focuses on objects and classes.
• Oops stands for Object-Oriented Programming

• Key concepts include inheritance, encapsulation, polymorphism, and abstraction

• Examples: Class Car with properties like make, model, and methods like start(), stop()

• Example: Inheritance - Class SUV extends Car and adds property numSeats
Answered by AI
Add your answer
Q5. JQuery - Ajax mechanisms
Add your answer
Q6. Docker and Kubernetes - Azure concepts
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

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

Q1. React hooks, Explain using code
Ans. 
React hooks are functions that let you use state and other React features without writing a class.
• Hooks are functions that let you use state and other React features in functional components

• useState() is a hook that allows you to add state to functional components

• useEffect() is a hook that allows you to perform side effects in functional components

• useContext() is a hook that allows you to use the context API in functio
Answered by AI
Add your answer
Q2. Factory Patterns?
Add your answer
Q3. Liskov Substitution Principle
Ans. 
Liskov Substitution Principle states that objects of a superclass should be replaceable with objects of its subclasses without affecting the program's correctness.
• Subtypes must be substitutable for their base types.

• Derived classes must be able to replace their base classes without affecting the program's behavior.

• Violating this principle can lead to unexpected behavior and errors in the code.

• Example: If a program expec...read more
Answered by AI
Add your answer
Q4. Oops Concept and give examples
Ans. 
Oops concept is a programming paradigm that focuses on objects and classes.
• Oops stands for Object-Oriented Programming

• Key concepts include inheritance, encapsulation, polymorphism, and abstraction

• Examples: Class Car with properties like make, model, and methods like start(), stop()

• Example: Inheritance - Class SUV extends Car and adds property numSeats
Answered by AI
Add your answer
Q5. JQuery - Ajax mechanisms
Add your answer
Q6. Docker and Kubernetes - Azure concepts
Add your answer

Q1. Technical questions based on my resume, coding, project architect, etc.
Add your answer

Q1. System design round. LLD and HLD.
Add your answer

Q1. Managerial with a little bit of technical. Work ethics, vision and ctc expectations.
Add your answer

Q1. Compensation discussion.
Add your answer

Q1. Binary search Merg sorting algorithm Minimum n maximum number in an array list Core java question Oops tricky code snippets Architecture questions about restful and Microservices
Add your answer
Q2. Deep copy and shallow copy Interviewer test your problem solving attitude and response not the perfect output
Add your answer
Q3. Array in descending order code
Ans. 
Sort an array of strings in descending order
• Use the sort() method with a custom compare function to sort the array in descending order

• Example: ['apple', 'banana', 'cherry'].sort((a, b) => b.localeCompare(a)) will result in ['cherry', 'banana', 'apple']
Answered by AI
Add your answer
Q4. Comparator and comparable interface
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. You are perfect fit and you are hires
Add your answer