Ebix Software India Technical Lead Interview Questions and Answers

Q1. Questions were mostly around system design, you will be given a case like a stock system and specific use case is asked to design end to end from UI to backend.
Add your answer
Q2. Some of the system debugging/performance improvement questions are asked from both UI and backend.
Add your answer

Q1. What is hoisting in Javascript
Ans. 
Hoisting is a behavior in JavaScript where variable and function declarations are moved to the top of their containing scope during compilation.
• Variable declarations are hoisted to the top of their scope, but not their assignments.

• Function declarations are fully hoisted, meaning they can be called before they are declared.

• Hoisting can lead to unexpected behavior if not understood properly.
Answered by AI
Add your answer
Q2. What is function currying
Ans. 
Function currying is a technique in functional programming where a function with multiple arguments is transformed into a sequence of nested functions, each taking a single argument.
• Currying allows partial application of a function, where some of the arguments are fixed and the rest are left to be supplied later.

• It helps in creating reusable functions and improving code readability.

• Example: const add = (a) => (b) => a ...read more
Answered by AI
Add your answer

Q1. Implement minstack
Add your answer
Q2. How load balancers work
Ans. 
Load balancers distribute incoming network traffic across multiple servers to ensure no single server is overwhelmed.
• Load balancers monitor the health of servers and distribute traffic based on predefined algorithms.

• They can be hardware-based or software-based.

• Common algorithms used by load balancers include round-robin, least connections, and IP hash.

• Load balancers can improve reliability and scalability of a website ...read more
Answered by AI
Add your answer

Q1. 2 sum problem to implement in O(n)
Ans. 
The Two Sum problem involves finding two numbers in an array that add up to a target value.
• Iterate through the array and store the difference between the target and current element in a hashmap.

• Check if the current element exists in the hashmap, if yes, return the indices of the current element and the stored difference.

• Time complexity of O(n) can be achieved by using a hashmap to store elements and their indices.
Answered by AI
Add your answer
Q2. About the projects i have done
Add your answer

Q1. Correct mislabelled jars problem.
Ans. 
Correct mislabelled jars by relabelling them with correct labels.
• Identify the mislabelled jars

• Check the correct labels for each jar

• Remove the mislabelled label

• Apply the correct label to the jar

• Ensure all jars are correctly labelled
Answered by AI
Add your answer
Q2. Reverse a number using recursion.
Ans. 
Reverse a number using recursion.
• Define a recursive function that takes the number as input

• Base case: if the number is less than 10, return the number

• Recursive case: return the last digit of the number concatenated with the result of calling the function with the number divided by 10

• Call the function with the input number
Answered by AI
Add your answer
Q3. Questions on CTC and downplaying your experience and cheap bargain.
Add your answer

Duration: 45 minutes
Topics: MCQ on C and C++, Quantitative Aptitude question from S. Chand and R.S. Agarwal

Question-related to current work.
Questions on data structure, and topics include link list and trees.
C++: Inheritance, Vtable, and templates.