Ebixcash World Money Dy GM Interview Questions and Answers

Q1. Technical Interview with one of team members
Add your answer
Q2. .net technology, sql server
Add your answer

Q1. Techno Managerial Round with Manager
Add your answer

Quant focussed Case Study (be prepared for calculations)

Q1. Why are you looking for a change?
Add your answer

Market entry case of an airline cobrand card

Estimate the size of tea market in india

Q1. Pl sql Unix api configuration
Add your answer
Q2. Routing how to use proxy
Ans. 
Routing through a proxy involves configuring the proxy server to forward requests to the destination server.
• Configure the proxy server to listen for incoming requests

• Configure the proxy server to forward requests to the destination server

• Configure the client to use the proxy server for outgoing requests

• Use a proxy server to bypass network restrictions or improve performance

• Examples: Nginx, Apache, Squid
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

Q1. 
Subset Sum Equal To K Problem Statement
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true if such a subset exists, otherwise r...read more
Ans. 
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
• Use dynamic programming to solve this problem efficiently

• Create a 2D array to store if a subset with a particular sum exists

• Iterate through the array and update the 2D array accordingly

• Check if the value at the end of the iteration is true for the given K
Answered by AI
Add your answer
Q2. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal in a disconnected graph starting from vertex 0.
• Implement BFS algorithm to traverse the graph starting from vertex 0.

• Use a queue to keep track of visited nodes and their neighbors.

• Ensure to print the traversal sequence in the correct order.

• Handle disconnected components by checking for unvisited nodes.

• Follow the BFS approach of exploring neighbors before moving to the next level.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

Q1. 
Replace Spaces in a String
Given a string STR consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
Input:
The first line contains an integ...read more
Ans. 
Replace spaces in a string with '@40'.
• Iterate through each character in the string

• Replace spaces with '@40'

• Return the modified string
Answered by AI
Add your answer