GlobalData Senior Software Engineer Interview Questions and Answers

Q1. Third party took the interview. Basics of programming and database were asked.
Add your answer

Q1. Asked to build a small game. LLD round.
Add your answer

3 simple coding questions

Q1. Merge sort with list
Ans. 
Merge sort is a divide and conquer algorithm that recursively divides the input array into smaller subarrays, sorts them, and then merges them back together.
• Divide the input list into two halves

• Recursively apply merge sort to each half

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. Similar to coin exchange DP
Add your answer
Q3. SQL query medium level
Add your answer

It was good to know the topics.

Might be good for my skills

Q1. Tell me about ur self?
Add your answer
Q2. Y u choose this cmpy?
Add your answer
Q3. I am not attending ur company interview then y I should share
Add your answer

First round was on Hacker Earth

Q1. Technical round was on Spring Data Jpa, Pagination, SOLID principles
Add your answer

Q1. Questions were mainly based on work experience and resume
Add your answer
Q2. AWS Question regarding S3, saprk memory
Add your answer

Q1. Minimum in Rotated Sorted array
Ans. 
Find the minimum element in a rotated sorted array.
• Perform binary search to find the pivot point where the array is rotated.

• Compare the element at pivot point to the first element to determine which half to search for the minimum.

• Continue binary search in the appropriate half to find the minimum element.
Answered by AI
Add your answer
Q2. API and DB Schema for Instagram based application.
Ans. 
API for Instagram application to interact with user data and DB schema to store user information and posts.
• API endpoints for user authentication, posting photos, liking photos, following users, etc.

• DB schema with tables for users, posts, comments, likes, followers, etc.

• Example API endpoint: /users/{userId}/posts to retrieve all posts by a specific user.

• Example DB schema: Users table with columns for username, email, pr
Answered by AI
Add your answer

Q1. Resume introspection, AWS, K8s
Add your answer

There are 30 basic aptitude question in 30 minutes

3 coding question 2 were easy and 1 was of medium level

Round duration - 60 minutes
Round difficulty - Easy

10 Aptitude questions with difficulty level hard were asked in this test.

Q1. What is the minimum number of planes required to go around the world?
Ans. 
The minimum number of planes required to go around the world is one.
• One plane can fly around the world without needing to stop.

• The plane can refuel mid-air or carry enough fuel for the entire journey.

• Examples: Non-stop flights like the Boeing 787 Dreamliner or Airbus A350 can circumnavigate the globe with one plane.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on data structures and algorithms. Questions about previous projects done and my roles on it and my leadership capabilities. Few technical questions from Threads and multi-processing.

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted N * N matrix, find the position of a target integer 'X'.
• Start from the top-right corner of the matrix and compare the target with the element at that position.

• Based on the comparison, move left or down in the matrix to narrow down the search.

• Repeat the process until the target is found or the search goes out of bounds.

• Return the position of the target if found, else return {-1, -1}.
Answered by AI
Add your answer
Q2. 
Rectangular Numbers Problem Statement
Ninja has a number 'N'. Your task is to generate a pattern where the outer rectangle is filled with the number 'N', and as you move inward, the numbers decrease conse...read more
Ans. 
Generate a pattern with outer rectangle filled with number 'N' and decreasing consecutively inward.
• Start by filling the outermost rectangle with the number 'N'.

• Decrease the numbers consecutively as you move inward towards the center.

• Continue this pattern until you reach the center of the rectangle.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

DSA based questions were asked in this round. Questions on implementation of Linux directory structure were also asked.

Q1. 
Binary Array Sorting Problem Statement
You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.
Input:
 The fir...read more
Ans. 
Yes, the binary array sorting problem can be solved in linear time and constant space using a single traversal.
• Use two pointers approach to swap 0s to the left and 1s to the right.

• Maintain two pointers, one for 0s and one for 1s, and swap elements accordingly.

• Example: Input: [1, 0, 1, 0, 1], Output: [0, 0, 1, 1, 1]
Answered by AI
Add your answer
Q2. 
Next Greater Element Problem Statement
You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...read more
Ans. 
The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.
• Iterate through the array from right to left and use a stack to keep track of elements.

• Pop elements from the stack until a greater element is found or the stack is empty.

• Store the next greater element for each element in the output array.
Answered by AI
Add your answer
Q3. What is the difference between Binary Search Trees (BST) and Tries?
Ans. 
BST is a binary tree structure where each node has at most two children, while Tries are tree structures used for storing strings.
• BST is used for searching, inserting, and deleting elements in a sorted manner.

• Tries are used for storing and searching strings efficiently.

• BST has a hierarchical structure with left and right child nodes.

• Tries have nodes representing characters, forming a tree-like structure for strings.

• Exa...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round. Questions about previous projects and current one were asked. I was also asked about aptitude problems from the first round and how I understood and approached towards solution?

Q1. 
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 without threatening each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

• Generate valid configurations recursively and backtrack when a solution is not possible.
Answered by AI
Add your answer
Q2. 
Form a Triangle Problem Statement
You are provided with an integer array/list ARR of length N. Your task is to determine if it is possible to construct at least one non-degenerate triangle using the value...read more
Ans. 
Check if it is possible to form a non-degenerate triangle using the sides provided in the array.
• Check if the sum of any two sides is greater than the third side for all combinations.

• If any such combination exists, return true; otherwise, return false.

• Handle multiple test cases as per the constraints provided.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Behavioral questions and team skills were discussed in this round.