i
Filter interviews by
I appeared for an interview before Apr 2024, where I was asked the following questions.
Inheritance in OOP allows a class to inherit properties and methods from another class, promoting code reuse and organization.
Inheritance enables a new class (child) to inherit attributes and methods from an existing class (parent).
Example: A class 'Animal' can be a parent class, and 'Dog' can inherit from 'Animal'.
It supports the concept of 'is-a' relationship; a Dog 'is an' Animal.
Inheritance can be single (one paren...
Encapsulation is an object-oriented programming principle that restricts direct access to an object's data and methods.
Encapsulation helps in bundling the data (attributes) and methods (functions) that operate on the data into a single unit, or class.
It restricts access to certain components, which is a means of preventing unintended interference and misuse of the methods and data.
For example, in a class 'Car', the spe...
Top trending discussions
posted on 21 Nov 2020
I applied via Approached by Company and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2020.
Remove duplicate entries from array of strings using JavaScript
Use Set to remove duplicates
Convert Set back to array
Use spread operator to convert Set to array
Determines if words in given array are anagram or not using JS
Create a function that takes an array of strings as input
Loop through the array and sort each string alphabetically
Compare the sorted strings to check if they are equal
Return true if all strings are anagrams, else false
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
I applied via LinkedIn and was interviewed before Jun 2021. There were 5 interview rounds.
Its a simple hackathon MCQ questions based on your skills.
based on 4 interviews
Interview experience
based on 36 reviews
Rating in categories
Senior Software Engineer
271
salaries
| ₹5.5 L/yr - ₹23.2 L/yr |
Software Engineer
231
salaries
| ₹3.5 L/yr - ₹14 L/yr |
Lead Engineer
117
salaries
| ₹8 L/yr - ₹26.7 L/yr |
Software Developer
54
salaries
| ₹2.4 L/yr - ₹12.9 L/yr |
Senior UI Designer
38
salaries
| ₹14.1 L/yr - ₹17 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant