International Financial Services Software Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

The interviewer called my via phone and simultaneously provided me a link where I had to write the code for a given problem. It was scheduled at 12:30 pm, so timing was not an issue. It was a standard DP question involving a 2D matrix. The question was easy and I was able to code it within given time.

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me two coding questions in this round.

Q1. Write an efficient program to find the sum of the contiguous subarray within a one-dimensional array of numbers that has the largest sum.
Ans. 
Efficient program to find sum of largest contiguous subarray within a one-dimensional array.
• Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.

• Initialize max_sum and current_sum to 0, iterate through array updating current_sum and max_sum.

• Return max_sum as the result.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was on-site round at their Bangalore office. The interviewer was friendly and helpful. The interview held inside a conference room.

Q1. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal problem to find connected components in an undirected and disconnected graph.
• Use Depth First Search (DFS) algorithm to traverse the graph and find connected components

• Maintain a visited array to keep track of visited vertices

• Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was the next round of the onsite interviews. Took place in the same conference room as that of the previous round.

Round duration - 60 minutes
Round difficulty - Easy

This was the third round of the onsite interview. 
 

Round duration - 90 minutes
Round difficulty - Medium

The test was scheduled around 5 evening and it had 3 coding questions. First question was on Dynamic Programming and other was medium question and was easy and the third was based on graph. And there were 20 mcq questions on Data structures, DBMS and OS

Q1. 
Matrix Word Search Problem
Explanation: You are given an 'M' x 'N' matrix of characters named CHARACTER_MATRIX and a string WORD. Your task is to identify and list all the occurrences of the string within...read more
Ans. 
Matrix Word Search Problem - Find occurrences of a given word in all eight possible directions within a matrix.
• Iterate through each cell in the matrix and check for the starting character of the word.

• For each occurrence of the starting character, check all eight directions for the complete word.

• Keep track of the coordinates of each character in the word for each occurrence found.

• Ensure boundaries are not crossed while ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Normal Coding question on Graphs and some basics from DBMS

Q1. 
Transitive Closure of Directed Graph Problem Statement
Given a directed graph with 'V' vertices and 'E' edges, determine if a vertex i is reachable from vertex j for all pairs of vertices (i, j). A vertex...read more
Ans. 
Determine reachability between all pairs of vertices in a directed graph.
• Use Floyd Warshall algorithm to find transitive closure of the graph.

• Initialize a V x V matrix with 1s on the diagonal and 0s elsewhere.

• Update matrix by checking if there is a path from i to j through k.

• Repeat the process for all vertices to get the transitive closure matrix.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

He asked me to read about Morse language in wikepedia and asked me to write a code on it i. e. If the input Morse code and in output we should get it in English

Q1. 
Morse Code to English Problem Statement
You are provided with a string of morse code(s) of length N. Your task is to convert this morse code into the corresponding alphanumeric code consisting of lowercas...read more
Ans. 
Convert Morse code to alphanumeric code using a predefined table.
• Iterate through the morse code string and convert each morse code to its corresponding alphanumeric character using the given table.

• Join the converted characters to form the final alphanumeric string.

• Handle spaces between morse code characters by adding a space in the final alphanumeric string.
Answered by AI
Add your answer

1 dp
2 dynamic graph

Q1. Data structure and algorithms
Add your answer
Q2. Data structure and algorithm
Add your answer

Prepare well for machine coding rounds.

The DSA round happens with pseudo code

Q1. Question asked from my resume
Add your answer
Q2. How I implemented everything
Add your answer

Q1. Why you want to join
Add your answer
Q2. Where do you see yourself in five years
Add your answer

OA was about dp and graph

Was about dp graphs and sliding window

It was a coding test with 3 medium-hard questions

Q1. Coding interview
Add your answer
Q2. Some question of graph
Add your answer
Q3. Some question of string
Add your answer
Q4. Some graph qquestion
Add your answer
Q5. Somerandom question
Add your answer

It consisted of 3 medium-hard dsa questions

Q1. Graph bfs question
Add your answer
Q2. Linked list question
Add your answer