S&P Global Software Developer Interview Questions, Process, and Tips

Aptitude Test + Technical Questions + One Coding Question

Q1. Detect the loop in a Singly linked list
Ans. 
Detect loop in a singly linked list
• Use two pointers, one moving one step at a time and the other moving two steps at a time

• If there is a loop, the two pointers will eventually meet

• If any of the pointers reach the end of the list, there is no loop
Answered by AI
Add your answer
Q2. 2 Sum (find a pair of numbers that sums up to a target)
Ans. 
The 2 Sum problem involves finding a pair of numbers in an array that adds up to a given target.
• Use a hash table to store the complement of each number as you iterate through the array.

• Check if the current number's complement exists in the hash table.

• If found, return the indices of the two numbers.

• If no pair is found, return an empty array.
Answered by AI
Add your answer

Qunatative, Reasoning, Blood Relation

Q1. CS fundamentals, DSA
Add your answer

Q1. Behavioural Questions only
Add your answer

Mid level programming and mcq questions

Q1. Architecture round and coding Peer programming C# questions React questions Recurssive programming String manipulation
Add your answer
Q2. String manuplation Array questions
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

Timing: Window for 2 days
Environment: Online
Time: 50 Min. for 50 MCQ and 20 min for 2 Coding Questions

Q1. 
Number Pattern Problem Statement
Design a seating arrangement for a high-security meeting. There are 'N' rows of tables set up where the first row contains one table, the second row contains two tables, a...read more
Ans. 
Step 1 : For rows of rectangle ran the outer loop from 1 to rows.
Step 2 : For column of rectangle run the inner loop from 1 to columns.
Step 3 : Print star for first or last row or for first or last column, otherwise print blank space.
Step 4 : After printing all columns of a row, print new line after inner loop.
There was no restriction of language on this question
Answered Anonymously
Add your answer
Q2. 
Insert Interval Problem Statement
You are provided with a list of 'N' non-overlapping intervals, each defined by two integers, 'start' and 'end', sorted in ascending order by 'start' values. Your task is ...read more
Ans. 
I didn't have any experience with Python, so I didn't know how to write the syntax.
Step 1: One can do this by using the slice indexing in the list
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing: Morning
Environment: On MS-Teams

Q1. 
Quick Sort Problem Statement
Sort the given array of integers in ascending order using the quick sort algorithm. Quick sort is a divide-and-conquer algorithm where a pivot point is chosen to partition the...read more
Ans. 
Step 1 : I explained Quick Sort and each step by also giving dry run.
Answered Anonymously
Add your answer