Ebixcash World Money Senior Programmer Analyst Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

This was an online test for 90 minutes. 2 programming questions and MCQs related to CS fundamentals were asked.

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

• If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.

• If one of the pointers reaches the end of the list (null), it means there is no cycle.
Answered by AI
Add your answer
Q2. 
Palindrome Partitioning II Problem Statement
Given a string ‘str’, find the minimum number of partitions needed such that every segment of the string is a palindrome.
The task is to make cuts in the stri...read more
Ans. 
Find the minimum number of partitions needed in a string such that every segment is a palindrome.
• Iterate through the string and check for palindromes at each possible partition point.

• Use dynamic programming to keep track of the minimum cuts needed.

• Consider edge cases where the string is already a palindrome or consists of different characters only.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical round that lasted for around 60 minutes. The interviewer asked questions related to data structures and algorithms.

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 on an undirected and disconnected graph to find connected components.
• Perform Depth First Search (DFS) on each vertex to find connected components

• Use a visited array to keep track of visited vertices

• Print the number of connected components and list vertices in ascending order for each component
Answered by AI
Add your answer
Q2. 
Cycle Detection in Undirected Graph Problem Statement
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...read more
Ans. 
Detect cycles in an undirected graph with given vertices and edges.
• Use Depth First Search (DFS) to traverse the graph and detect cycles.

• Maintain a visited array to keep track of visited vertices and a parent array to keep track of the parent of each vertex.

• If while traversing, you encounter a visited vertex that is not the parent of the current vertex, then a cycle exists.

• Consider edge cases like disconnected graphs an
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Technical round that lasted for around 60 minutes. The interviewer asked questions related to data structures and algorithms.

Q1. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Implement the Merge Sort algorithm using a Divide and Conquer approach

• Recursively divide the input array into two halves until the size of each array is 1

• Merge the sorted halves to produce a completely sorted array

• Ensure the output is in non-descending order
Answered by AI
Add your answer
Q2. 
Maximum Difference Problem Statement
Given an array ARR of N elements, your task is to find the maximum difference between any two elements in ARR.
If the maximum difference is even, print EVEN; if it is...read more
Ans. 
Find the maximum difference between any two elements in an array and determine if it is even or odd.
• Iterate through the array to find the maximum and minimum elements

• Calculate the difference between the maximum and minimum elements

• Check if the difference is even or odd and return the result
Answered by AI
Add your answer
Q3. What is hashing and how can it be implemented?
Ans. 
Hashing is a process of converting input data into a fixed-size string of bytes using a hash function.
• Hashing is used to securely store passwords by converting them into a hash value before storing in a database.

• Hashing is used in data structures like hash tables to quickly retrieve data based on a key.

• Common hash functions include MD5, SHA-1, and SHA-256.

• Hashing can be implemented in programming languages like Python
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round where the interviewer asked questions based on Data structures and algorithms.

Q1. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes.

• Use three pointers to keep track of the current, previous, and next nodes.

• Update the links between nodes to reverse the list.

• Return the head of the reversed linked list.
Answered by AI
Add your answer
Q2. 
Dijkstra's Shortest Path Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...read more
Ans. 
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
• Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes.

• Use a priority queue to efficiently select the next node with the shortest distance.

• Update the distances of neighboring nodes based on the current node's distance and edge weights.

• Handle disc...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round where the interviewer asked questions based on Data structures and algorithms.

Q1. 
Sort Linked List Based on Actual Values
Given a Singly Linked List of integers that are sorted based on their absolute values, the task is to sort the linked list based on the actual values.
The absolute...read more
Ans. 
Sort a Singly Linked List based on actual values instead of absolute values.
• Traverse the linked list and store the values in an array.

• Sort the array based on actual values.

• Update the linked list with the sorted values.
Answered by AI
Add your answer
Q2. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order to easily find the Kth largest element.

• Ensure all elements in the array are distinct for accurate results.

• Handle multiple test cases efficiently by iterating through each case.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR Round that lasted for around 30 minutes. The interviewer asked questions to know more about me.

Round duration - 60 Minutes
Round difficulty - Easy

The interview was held in the evening on a weekday, Interview was nice and quite experienced, he asked me about my previous experience in the area and they told me about the team and work for which they were hiring, we did some discussion on that. Meanwhile, I was also asked a few questions on Database and SQL.

Q1. 
Find Magic Index in Sorted Array
Given a sorted array A consisting of N integers, your task is to find the magic index in the given array, where the magic index is defined as an index i such that A[i] = i...read more
Ans. 
Find the magic index in a sorted array where A[i] = i.
• Iterate through the array and check if A[i] = i for each index i

• Utilize binary search for a more efficient solution

• Handle cases where there are multiple magic indices or none at all
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interview was in the afternoon. There were some glitches with the teams meeting but it got sorted out in a few minutes. This round was purely coding based. He started with questions on arrays, linked lists, and string manipulation with an increasing level of hardness. The tricky part was that the online editor I was given for writing the code was not an IDE but a simple text editor, so I wasn't getting any help in terms of code completion or syntax errors or syntax highlighting.

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Ans. 
The task is to find all pairs of elements in an array that add up to a given target.
• Iterate through the array and for each element, check if the difference between the target and the element exists in a hash set.

• If it exists, add the pair to the result. If not, add the element to the hash set.

• Handle cases where the same element is used twice in a pair.

• Return (-1, -1) if no pair is found.
Answered by AI
Add your answer

Easy to medium level question with some mcqs

Then we had a training for one month and we created a project based on that project we were given internships