S&P Global
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
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.
posted on 8 Apr 2022
I applied via Naukri.com and was interviewed before Apr 2021. There were 3 interview rounds.
Aptitude test will a hackerrank test where it might have technical MCQ and/or coding test.
I applied via Company Website and was interviewed in Feb 2021. There were 3 interview rounds.
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...
I applied via Approached by Company and was interviewed in Jan 2024. There was 1 interview round.
It was a very simple coding test and the interviewer was focused on understanding the tradeoffs and time complexity analysis rather than the solution itself. And also asked a lot of questions of the hashmap internals, ArrayList implementation which was off track to what the interview was for.
I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.
based on 1 interview
Interview experience
based on 1 review
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
611
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Data Analyst
315
salaries
| ₹0 L/yr - ₹0 L/yr |
Moody's
Thomson Reuters
Bloomberg
Dun & Bradstreet