Filter interviews by
I applied via Referral and was interviewed before May 2022. There were 3 interview rounds.
Top trending discussions
posted on 19 Jul 2024
They asked easy to medium DSA . It includes arrays, strings, recursion.
posted on 23 Nov 2024
posted on 9 Sep 2023
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
I applied via Company Website and was interviewed in Oct 2022. There were 3 interview rounds.
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 Fb and was interviewed in May 2022. There were 3 interview rounds.
Easy question
An array in Java is a collection of similar type of elements stored in contiguous memory locations.
Arrays can be of primitive data types like int, float, etc. or reference types like String, Object, etc.
Arrays have a fixed size and can be accessed using an index starting from 0.
Arrays can be initialized during declaration or later using the new keyword.
Example: String[] names = {"John", "Mary", "Bob"};
Example: int[] nu...
posted on 9 Dec 2024
I applied via Job Portal and was interviewed before Dec 2023. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Software Technologist 1
294
salaries
| ₹10.1 L/yr - ₹30 L/yr |
Software Engineer
205
salaries
| ₹5 L/yr - ₹20 L/yr |
Software Technologist 2
177
salaries
| ₹14.9 L/yr - ₹34.7 L/yr |
Software Engineer2
162
salaries
| ₹8.5 L/yr - ₹19.2 L/yr |
Senior Software Engineer
130
salaries
| ₹7.5 L/yr - ₹23.6 L/yr |
GE Healthcare
Siemens Healthineers
Honeywell Technology Solutions
Bosch