Filter interviews by
1 hr apptitude round online
2hr coding round 3 questions easy level
30-40 multiple questions on programming basics
One medium-level question
I applied via LinkedIn and was interviewed in Oct 2023. There were 4 interview rounds.
I applied via LinkedIn and was interviewed in Oct 2023. There were 4 interview rounds.
MediaKind interview questions for popular designations
I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.
Simple, logical, lengthy, need to read well
I applied via Campus Placement and was interviewed in Sep 2021. There were 3 interview rounds.
General aptitude question
2 coding were asked
Top trending discussions
I applied via Recruitment Consultant and was interviewed before Oct 2020. There was 1 interview round.
Abstraction is the process of hiding complex implementation details and exposing only the necessary information.
Abstraction helps in reducing complexity and increasing efficiency.
It allows us to focus on the essential features of an object or system.
Abstraction can be achieved through abstract classes, interfaces, and encapsulation.
For example, a car can be abstracted as a vehicle with certain properties and methods.
Ab...
Hiding implementation means keeping the internal details of a class or function hidden from the outside world.
It is a fundamental principle of object-oriented programming.
It helps in achieving encapsulation and abstraction.
It prevents the user from accessing the internal workings of a class or function.
Examples include private variables and methods in a class.
It allows for easier maintenance and modification of code.
It...
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 6 interviews
Interview experience
based on 37 reviews
Rating in categories
Senior Technical Lead
27
salaries
| ₹18.8 L/yr - ₹32.4 L/yr |
Software Engineer
20
salaries
| ₹10 L/yr - ₹14 L/yr |
Solution Architect
19
salaries
| ₹15 L/yr - ₹32 L/yr |
Senior Software Engineer
15
salaries
| ₹10 L/yr - ₹19.1 L/yr |
Technical Lead
12
salaries
| ₹12.5 L/yr - ₹34.6 L/yr |
TCS
Accenture
Wipro
Cognizant