i
Baxter International
Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2023. There were 2 interview rounds.
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
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...
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
Top trending discussions
posted on 19 Jul 2024
posted on 2 Feb 2024
I applied via campus placement at P E S College of Engineering, Mandya and was interviewed in Jan 2024. There were 3 interview rounds.
Computer fundamentals
I applied via unstop and was interviewed before Oct 2023. There were 3 interview rounds.
It was medium to difficult level test
I applied via campus placement at Anna University and was interviewed in Aug 2022. There were 3 interview rounds.
Two Easy questions to be solved
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...
I applied via Walk-in and was interviewed in May 2022. There were 2 interview rounds.
Convert Number to words
SOLID principles are a set of guidelines for writing maintainable and scalable code.
Single Responsibility Principle: A class should have only one reason to change.
Open/Closed Principle: A class should be open for extension but closed for modification.
Liskov Substitution Principle: Subtypes should be substitutable for their base types.
Interface Segregation Principle: Clients should not be forced to depend on interfaces ...
posted on 9 Dec 2024
I applied via Job Portal and was interviewed before Dec 2023. There were 2 interview rounds.
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...
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...
posted on 11 Sep 2024
I applied via Recruitment Consulltant and was interviewed before Sep 2023. There were 5 interview rounds.
IT was basic question from string and array
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.
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
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
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.
based on 1 interview
Interview experience
Associate
82
salaries
| ₹4 L/yr - ₹10.9 L/yr |
Senior Engineer
79
salaries
| ₹12 L/yr - ₹40 L/yr |
Senior Executive
75
salaries
| ₹3.4 L/yr - ₹10 L/yr |
Principal Engineer
57
salaries
| ₹18.2 L/yr - ₹42 L/yr |
Senior Associate
46
salaries
| ₹6 L/yr - ₹17.5 L/yr |
Johnson & Johnson
Medtronic
Abbott
Boston Scientific