Narayana Health Software Developer Interview Questions and Answers

Q1. Oops related insharitance encapsulation
Add your answer

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

Q1. Difference b/w full and partial selectors
Ans. 
Full selectors select all descendants of a specified element, while partial selectors select only direct children.
• Full selectors use a space between the parent and child elements, while partial selectors use the > symbol.

• Full selectors are more general and can target multiple levels of descendants, while partial selectors are more specific and target only direct children.

• Example of full selector: div p selects all

  ele...read more
Answered by AI
Add your answer
Q2. What is Screen scraping and data scraping
Ans. 
Screen scraping is extracting data from a website's HTML code, while data scraping is extracting data from various sources.
• Screen scraping involves extracting data from the visual representation of a website, usually using automation tools like web scrapers.

• Data scraping involves extracting data from various sources such as databases, APIs, and documents.

• Both screen scraping and data scraping are used to collect and an...read more
Answered by AI
Add your answer

IT was basic question from string and array

Q1. Data structure question find all leaf node from tree.
Ans. 
Use depth-first search to traverse the tree and identify leaf nodes.
• Implement depth-first search algorithm to traverse the tree.

• Identify nodes with no children as leaf nodes.

• Store leaf nodes in an array for retrieval.
Answered by AI
Add your answer
Q2. Print sentence word in reverse order without using default function. eg: input:-> I live in New York. output:-> I evil ni weN kroY.
Ans. 
Reverse each word in a sentence without using default function.
• Split the sentence into words

• Iterate through each word and reverse it

• Join the reversed words back into a sentence
Answered by AI
Add your answer

Q1. Programming question :Fibonacci series using recursion.
Ans. 
Fibonacci series using recursion is a classic programming problem where each number is the sum of the two preceding ones.
• Define a recursive function that takes an integer n as input

• Base case: if n is 0 or 1, return n

• Recursive case: return the sum of the previous two Fibonacci numbers

• Call the function recursively with n-1 and n-2 until base case is reached
Answered by AI
Add your answer
Q2. Programming question: Find 1st 2nd and 3rd highest from array of integer.
Ans. 
Find 1st, 2nd, and 3rd highest integers from an array.
• Sort the array in descending order.

• Retrieve the first three elements from the sorted array.

• Handle cases where array length is less than 3.
Answered by AI
Add your answer

Q1. They asked Puzzle
Add your answer

Q1. Salary Discussion
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

30 Aptitude problems and two coding questions

Q1. 
Count Inversions Problem Statement
Given an integer array ARR of size N, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...read more
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Data structure and algorithms plus object oriented problems

Q1. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Add your answer
Q2. 
Problem Statement: Delete Node In A Linked List
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...read more
Add your answer

Round duration - 60 miinutes
Round difficulty - Easy

Database questions and discussion about projects

Q1. What is a normal form in database management systems, and can you explain Boyce-Codd Normal Form (BCNF)?
Add your answer
Q2. What is the difference between the 'WHILE' keyword and the 'HAVING' keyword in SQL?
Add your answer

Q1. Question on Template concept in c++
Add your answer
Q2. Questions related to string
Add your answer