Filter interviews by
I applied via Recruitment Consulltant and was interviewed before May 2021. There were 2 interview rounds.
Top trending discussions
They asked easy to medium DSA . It includes arrays, strings, recursion.
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 Naukri.com and was interviewed in Feb 2024. There was 1 interview round.
OOPs stands for Object-Oriented Programming. Abstraction is the concept of hiding complex implementation details and showing only necessary features of an object.
OOPs is a programming paradigm that uses objects and classes to design and develop applications.
Abstraction is the process of hiding the implementation details and showing only the necessary features of an object.
For example, a car can be represented as an obj...
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...
posted on 12 Apr 2022
I applied via LinkedIn and was interviewed before Apr 2021. There were 4 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...
I applied via Campus Placement and was interviewed before Nov 2023. There were 4 interview rounds.
Aptitude related questions asked in form of mcq.
Coding questions are given
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
30 Aptitude problems and two coding questions
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...
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
Round duration - 90 minutes
Round difficulty - Medium
Data structure and algorithms plus object oriented problems
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.
The Merge Sort...
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...
Round duration - 60 miinutes
Round difficulty - Easy
Database questions and discussion about projects
Tip 1 : Competitive Programming
Tip 2 : Do atleast 2 projects
Tip 1 : To be precise, mention your technical skills, achievements, dont write anything unnecessary plus write your professional summary good mention your project details in not more than 2 lines and make sure those sentences make sense to reader.
Tip 2 : Resume should be not more than one page. Write everything within one page
based on 4 reviews
Rating in categories
Software Developer
24
salaries
| ₹2.8 L/yr - ₹5.4 L/yr |
Project Coordinator
14
salaries
| ₹1.8 L/yr - ₹3 L/yr |
HR Executive
8
salaries
| ₹2 L/yr - ₹4.4 L/yr |
Business Development Manager
8
salaries
| ₹2.8 L/yr - ₹5.2 L/yr |
Business Development Executive
6
salaries
| ₹1.8 L/yr - ₹2.4 L/yr |
Adani Group
Tata Group
Reliance Industries
Mahindra & Mahindra