Filter interviews by
Top trending discussions
First round was on Hacker Earth
I applied via Job Fair and was interviewed in Jan 2024. There were 3 interview rounds.
It was good to know the topics.
Might be good for my skills
I applied via LinkedIn and was interviewed in Jul 2024. There were 2 interview rounds.
Find the minimum element in a rotated sorted array.
Perform binary search to find the pivot point where the array is rotated.
Compare the element at pivot point to the first element to determine which half to search for the minimum.
Continue binary search in the appropriate half to find the minimum element.
API for Instagram application to interact with user data and DB schema to store user information and posts.
API endpoints for user authentication, posting photos, liking photos, following users, etc.
DB schema with tables for users, posts, comments, likes, followers, etc.
Example API endpoint: /users/{userId}/posts to retrieve all posts by a specific user.
Example DB schema: Users table with columns for username, email, pr
I applied via Approached by Company and was interviewed in Mar 2024. There were 2 interview rounds.
I appeared for an interview before Mar 2024, where I was asked the following questions.
A dirty read occurs when a transaction reads data that has been modified but not yet committed by another transaction.
Dirty reads can lead to inconsistencies, as the data may change before the first transaction is committed.
For example, if Transaction A updates a record but hasn't committed yet, and Transaction B reads that record, Transaction B sees uncommitted data.
If Transaction A rolls back, Transaction B will have...
Design patterns are reusable solutions to common software design problems, promoting best practices and improving code maintainability.
Creational patterns (e.g., Singleton, Factory Method) manage object creation.
Structural patterns (e.g., Adapter, Composite) deal with object composition.
Behavioral patterns (e.g., Observer, Strategy) focus on communication between objects.
Design patterns help in code reusability and sca
I applied via LinkedIn and was interviewed in Aug 2024. There were 2 interview rounds.
3 simple coding questions
Merge sort is a divide and conquer algorithm that recursively divides the input array into smaller subarrays, sorts them, and then merges them back together.
Divide the input list into two halves
Recursively apply merge sort to each half
Merge the sorted halves back together
To invoke an XML file using LibXML, use the xmlReadFile() function.
Include the libxml/parser.h header file.
Use the xmlReadFile() function to read the XML file and create a xmlDocPtr object.
Use the xmlDocGetRootElement() function to get the root element of the XML document.
Use the xmlNodeGetContent() function to get the content of a node.
Use the xmlFreeDoc() function to free the memory allocated for the xmlDocPtr object...
posted on 3 Nov 2022
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
There are 30 basic aptitude question in 30 minutes
3 coding question 2 were easy and 1 was of medium level
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Senior Associate
153
salaries
| ₹4.9 L/yr - ₹18 L/yr |
Associate
134
salaries
| ₹4 L/yr - ₹11.2 L/yr |
Delivery Lead
112
salaries
| ₹6.8 L/yr - ₹20.3 L/yr |
Assistant Director
71
salaries
| ₹18 L/yr - ₹46 L/yr |
Delivery Manager
53
salaries
| ₹11 L/yr - ₹28 L/yr |
EXL Service
Access Healthcare
AGS Health
Straive