S&P Global
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
The questions were related to finance questions and some are from exel related . So read the question carefully and attempt your best.
All about maths
What people are saying about S&P Global
I applied via Campus Placement and was interviewed in Jun 2021. There were 4 interview rounds.
2 dsa question one medium and hard
I applied via Naukri.com and was interviewed in Dec 2022. There were 3 interview rounds.
Basic math and C questions. Algebra, algorithms, data structures, syntax,
THE TEST DURATION IS ABOUT 30 MIN 30 QUESTIONS.QUESTIONS WERE FROM C++,PROBABILITY ETC,,
Primary key uniquely identifies a record in a table, while foreign key establishes a relationship between two tables.
Primary key is unique and cannot have null values
Foreign key references the primary key of another table
Primary key can be only one per table, while foreign key can be multiple
Example: Primary key in 'Students' table could be 'student_id', while foreign key in 'Courses' table could be 'student_id' refere
Find an odd occurring number among even occurring numbers.
Use XOR operation to cancel out even occurring numbers and get the odd occurring number.
Iterate through the array and XOR each element with the result variable.
The final result will be the odd occurring number.
Print the spiral order of a binary tree and matrix.
For binary tree, use level order traversal and alternate direction for each level.
For matrix, use four pointers to traverse in spiral order.
Example for binary tree: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9
Example for matrix: 1 2 3 4 -> 8 7 6 5 -> 9 10 11 12 -> 16 15 14 13
Finding pairs in an array with a given sum.
Iterate through the array and for each element, check if the difference between the given sum and the element exists in the array.
Use a hash table to store the elements of the array and their indices for faster lookup.
If there are multiple pairs with the same sum, return any one of them.
If no pair is found, return null or an empty array.
Find total number of k element with given avg in an array in minimum time complexity.
Use sliding window technique to traverse the array in O(n) time complexity.
Maintain a sum variable to keep track of the sum of elements in the window.
If the sum of elements in the window is equal to k times the given avg, increment the count.
Move the window by subtracting the first element and adding the next element in the array.
Printing non-boundary elements of a binary tree
Traverse the tree in any order (preorder, inorder, postorder)
Check if the current node is not a boundary node (not the first or last node in its level)
If it is not a boundary node, print its value
Recursively traverse its left and right subtrees
I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.
based on 3 interviews
Interview experience
based on 7 reviews
Rating in categories
Data Analyst
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Researcher
844
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
676
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
614
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Data Analyst
313
salaries
| ₹0 L/yr - ₹0 L/yr |
Moody's
Thomson Reuters
Bloomberg
FactSet