S&P Global Software Developer Interview Questions and Answers for Freshers

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. 
Design a seating arrangement for a high-security meeting with specific table assignments for security personnel and guests.
• Create a loop to iterate through each row from 1 to N.

• Assign tables on either end of each row to security personnel.

• For rows with only one table, assign it to security personnel.

• Display the seating arrangement with the number of people at each table.

• Example: For 4 rows, the output pattern is 1, 11,
Answered by AI
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. 
The task is to insert a given interval into a list of non-overlapping intervals while maintaining sorted order.
• Iterate through the list of intervals to find the correct position to insert the given interval.

• Merge any overlapping intervals with the given interval.

• Update the list of intervals accordingly.

• Handle edge cases such as when the given interval completely overlaps with existing intervals.
Answered by AI
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. 
Quick sort is a divide-and-conquer algorithm that sorts an array by choosing a pivot point and partitioning the array into two parts recursively.
• Choose a pivot element (e.g., rightmost element) to partition the array into two subarrays.

• Recursively apply quick sort to the subarrays until the entire array is sorted.

• Time complexity can be optimized to NlogN in the worst case by selecting the pivot strategically.

• Ensure the...read more
Answered by AI
Add your answer