Globe Capital Market Software Developer Interview Questions and Answers for Experienced

Q1. Java questions , stream api
Add your answer
Q2. Whatever you have mention in resume
Add your answer

Aptitude, maths, cs fundamentals, dbms

Q1. Leetcode easy-medium
Add your answer

Q1. General questions
Add your answer

Round duration - 100 Minutes
Round difficulty - Hard

There were 2 interviewers. It started with an introduction from me and one of the interviewers directly started with a DSA questions. Two problems were asked and I had to code them on a compiler of my choice by sharing my screen. Level of DSA question was medium but I was severely grilled on oops. I had to create different abstract classes, interface and explain entire oops with examples.

This was followed by a set of core JAVA questions :

Difference between == and .equals() ?
Mention some methods of the object class?
Difference between TreeSet and SortedSet?
How is a String saved in JAVA?
difference between string pool and heap memory?

Q1. 
Shortest Distance in a Binary Search Tree
Your task is to determine the shortest distance between two nodes with given keys in a Binary Search Tree (BST).
It is assured that both keys exist within the BS...read more
Ans. 
Find the shortest distance between two nodes in a Binary Search Tree.
• Traverse the BST to find the paths from the root to both nodes.

• Compare the paths to find the common ancestor node.

• Calculate the distance by adding the lengths of the paths from the common ancestor to both nodes.

• Return the shortest distance as the result.
Answered by AI
Add your answer
Q2. 
Greatest Common Divisor Problem Statement
You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...read more
Ans. 
Find the greatest common divisor (GCD) of two given numbers 'X' and 'Y'.
• Iterate from 1 to the minimum of X and Y, check if both X and Y are divisible by the current number, update GCD if true

• Use Euclidean algorithm to find GCD: GCD(X, Y) = GCD(Y, X % Y)

• If one of the numbers is 0, the other number is the GCD

• Handle edge cases like when one of the numbers is 0 or negative
Answered by AI
View 1 more answer
Q3. 
Bridge in Graph Problem Statement
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...read more
Ans. 
Find all the bridges in an undirected graph.
• Use Tarjan's algorithm to find bridges in the graph.

• A bridge is an edge whose removal increases the number of connected components.

• Check for bridges by removing each edge and running a DFS to see if the graph is still connected.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Validate Binary Search Tree Problem Statement
Your task is to determine if a given binary tree with 'N' nodes is a valid Binary Search Tree (BST). A BST is defined by the following properties:
• The lef...read more
Ans. 
Validate if a given binary tree is a valid Binary Search Tree (BST) based on its properties.
• Check if the left subtree of a node has only nodes with data less than the node's data.

• Verify if the right subtree of a node has only nodes with data greater than the node's data.

• Ensure that both the left and right subtrees are also binary search trees.

• Implement a validation function for a BST.

• Output 'true' if the binary tree is
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Round duration - 87 minutes
Round difficulty - Medium

Timing : It was conducted in evening at 3 PM
The pacreception environment was very user friendly .
The platform was audio and video proctored.

Q1. 
Binary to Decimal Conversion
Convert a given binary number, represented as a string 'S' of size 'N', into its decimal equivalent integer and output it.
Input:
The first line contains an integer 'T', den...read more
Ans. 
Convert a binary string to its decimal equivalent integer.
• Iterate through the binary string from right to left, multiplying each digit by 2 raised to the power of its position.

• Add the results of the multiplication to get the decimal equivalent.

• Ensure the binary string consists only of '0' and '1' characters.

• Handle multiple test cases by repeating the conversion process for each case.
Answered by AI
Add your answer

Round duration - 80 minutes
Round difficulty - Medium

So This was a very interactive round . There were two interviewers , one male and one female . The male interviewer was quite experienced where as female interviewer was relatively new . The Interview started by a small introduction followed by some OOPS related questions where I was tested on how i perceive the concept of OOPS in real life . Then this conversation was followed by some core concepts of JAVA like abstract classes and interfaces . Then I was asked about my projects that i mentioned in my resume , then after some healthy discussion on those projects , the interviewer started to question about DBMS , I was asked some basic queries followed by some advanced queries and then followed by a discussion on SQL vs NoSQL . Then Interviewers asked me about my tech stack and the source of my technical knowledge. Then at last I was asked that why Blackrock and this concluded my Interview.

Q1. 
Ninja And The Triangle Problem Statement
Ninja is provided with 'N' stars and the task is to construct a triangle such that the 'i'th level of the triangle uses 'i' number of stars. The goal is to make th...read more
Ans. 
Given 'N' stars, construct a triangle with maximum height using 'i' stars in 'i'th level.
• Calculate the maximum height of the triangle using the formula: height = floor((-1 + sqrt(1 + 8 * N)) / 2)

• Iterate through each test case and calculate the maximum height for each 'N'.

• Output the maximum height for each test case.
Answered by AI
Add your answer

70 minutes test, and 4 questions

Q1. Behavioural Queston
Add your answer

Tell me about a time where you resolve a conflict

Reverse a string, identify anagram

Round duration - 60 minutes
Round difficulty - Easy

This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.

Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
Ans. 
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
• Understand the problem statement and expected output.

• Review the code for syntax errors, logical errors, and potential bugs.

• Use debugging tools like breakpoints, print statements, and IDE debuggers.

• Test the code with different inputs to identify the bug.

• Make necessary corrections based on the iden...read more
Answered by AI
Add your answer
Q2. 
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...read more
Ans. 
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
• Traverse the binary tree to find the target node.

• Use BFS to traverse the tree from the target node to nodes at distance K.

• Keep track of the distance while traversing the tree.

• Return the values of nodes at distance K in any order.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

Q1. 
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...read more
Ans. 
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
• Iterate through the array and maintain a count of 0s and 1s encountered so far.

• Store the count difference in a hashmap with the index as the key.

• If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

• Return the length of the longest subarray found.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.