S&P Global
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.
To get the 3rd last node of a linked list, we can use two pointers approach.
Start two pointers at the head of the linked list
Move the first pointer to the 3rd node from the beginning
Then move both pointers one node at a time until the first pointer reaches the end
I applied via Naukri.com and was interviewed before May 2020. There were 4 interview rounds.
Swapping two numbers without using a third variable
Use arithmetic operations to swap the values
Add the two numbers and store the result in the first variable
Subtract the second number from the result and store it in the second variable
Subtract the second variable from the first variable to get the original value of the second variable
First round was online coding round, second was coding in interview infornt of panel, third was DSA+basic Database questions
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 Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
Basic ds algo round with questions asked around arrays strings
I applied via Approached by Company and was interviewed in Mar 2024. There were 2 interview rounds.
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
I applied via Naukri.com and was interviewed in Jul 2024. There were 2 interview rounds.
It was good. contains lot of theoretical questions.
1 hr. asked basic concepts.
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
based on 1 interview
Interview experience
based on 16 reviews
Rating in categories
Data Analyst
1.5k
salaries
| ₹2 L/yr - ₹10.8 L/yr |
Data Researcher
845
salaries
| ₹2.5 L/yr - ₹7.6 L/yr |
Senior Software Engineer
701
salaries
| ₹11.5 L/yr - ₹40 L/yr |
Software Engineer
618
salaries
| ₹10 L/yr - ₹36.5 L/yr |
Lead Data Analyst
317
salaries
| ₹4.5 L/yr - ₹13.2 L/yr |
EXL Service
Access Healthcare
AGS Health
Straive