Filter interviews by
I applied via unstop and was interviewed before Oct 2023. There were 3 interview rounds.
It was medium to difficult level test
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
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 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.
based on 1 interview
Interview experience
District Manager
120
salaries
| ₹5.9 L/yr - ₹13 L/yr |
Associate District Manager
108
salaries
| ₹4 L/yr - ₹11 L/yr |
Medical Representative
107
salaries
| ₹1.8 L/yr - ₹6 L/yr |
Field Manager
102
salaries
| ₹10 L/yr - ₹22.3 L/yr |
Area Sales Manager
85
salaries
| ₹6.2 L/yr - ₹22 L/yr |
Procter & Gamble
GlaxoSmithKline Pharmaceuticals
Novartis
Pfizer