GlobalLogic Software Engineer Trainee Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Medium

3 coding question. 2 medium, 1 hard

Q1. 
Left Rotations of an Array
Given an array of size N and Q queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.
Input:
...read more
Ans. 
Rotate an array left by a specified number of elements for each query.
• Parse input: read number of test cases, array size, queries, and array elements

• For each query, left rotate the array by the specified number of elements

• Return the modified array for each query
Answered by AI
Add your answer
Q2. 
Slot Game Problem Statement
You are given a slot machine with four slots, each containing one of the colors Red (R), Yellow (Y), Green (G), or Blue (B). You must guess the colors without prior knowledge. ...read more
Ans. 
Calculate total score based on guessing colors in a slot machine.
• Iterate through each slot in the original and guess strings to compare colors.

• Count perfect hits when color matches in correct slot, and pseudo-hits when color matches in different slot.

• Calculate total score by adding perfect hits and pseudo-hits.

• Handle edge cases like invalid input strings or exceeding constraints.
Answered by AI
Add your answer
Q3. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
• Understand the constraints of the problem: N represents the size of the chessboard and the number of queens, and queens can attack each other if they are in the same row, column, or diagonal.

• Implement a backtracking algorithm to explore all possible configurations of queen placements ...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

The interviewer was supportive and he asked me various questions. He asked me a question similar to N Sum. Asked me to optimise it as much as possible. Had discussion over topics such related to oops, Java, Java script, data structures, DBMS, Trees, graphs, some named algorithm, merge sort etc

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Given an array and a target sum, find pairs of elements that add up to the target sum.
• Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

• If the complement exists, add the pair to the result list.

• Sort the result list based on the first element of each pair, and then the second element if the first elements are equal.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

It was a managerial round to test candidates presence of mind. Puzzles and mathematical problems were asked. Some situation based questions were also asked in this round.

Round duration - 20 Minutes
Round difficulty - Easy

Interviewer asked me about SDLC, agile etc and situation based questions to know how would I respond in various situations.