iMocha Team Lead Interview Questions and Answers

Q1. Two Pointer Technique question to get the highest sum from two sorted list by jumping from one list to another list on common element.
Add your answer
Q2. Combine two sorted array such as first element would be the lowest element and second would be the largest element as so on.
Ans. 
Merge two sorted arrays with alternating lowest and highest elements.
• Create a new array to store the result

• Use two pointers to iterate through the two input arrays

• Alternate between adding the lowest and highest elements to the result array
Answered by AI
Add your answer

Q1. Design SplitWise
Ans. 
SplitWise is a platform for splitting expenses among friends or groups.
• Allow users to create groups and add expenses

• Calculate each user's share of the expenses

• Send notifications to users for pending payments

• Support multiple currencies for international groups
Answered by AI
Add your answer

Q1. Design API Rate Limiter
Ans. 
Design API Rate Limiter to control the number of requests a user can make within a specific time frame.
• Implement a token bucket algorithm to track and limit the number of requests per user.

• Use a sliding window to track the time frame for request limits.

• Consider using a distributed cache like Redis to store and manage request limits.

• Provide appropriate error responses when the rate limit is exceeded.

• Allow for customizat...read more
Answered by AI
Add your answer

Q1. Why do you want to join lido
Add your answer
Q2. Its an emerging company
Add your answer

Nice interview experience on the aptitude

Q1. Introduced ourselves
Add your answer
Q2. Explain about about projects
Ans. 
Projects are specific tasks or assignments undertaken to achieve a particular goal or outcome.
• Projects involve a defined scope, timeline, and budget.

• They require a team of individuals with specific skills and roles.

• Examples include developing a new software application, implementing a website redesign, or launching a marketing campaign.
Answered by AI
Add your answer

Q1. Create specific components
Ans. 
Creating specific components for software development
• Identify the requirements for the component

• Design the component architecture

• Implement the component using appropriate programming languages and tools

• Test the component for functionality and performance

• Integrate the component into the larger software system
Answered by AI
Add your answer

Q1. Project discussion
Add your answer
Q2. Technical Project discussion
Add your answer

Peak of element in Array

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Path Queries Problem Statement
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...read more
Ans. 
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
• Use Dijkstra's algorithm to find the shortest path between the given vertices.

• Create a graph data structure to represent the weighted, undirected graph.

• Handle cases where no path exists between the given vertices by returning -1.

• Optimize the algorithm to handle multiple queries efficiently.

• Consider edge cases such as...read more
Answered by AI
Add your answer
Q2. 
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively

• Sort the two halves separately

• Merge the sorted halves to produce a fully sorted array

• Time complexity of Merge Sort is O(n log n)

• Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
Answered by AI
Add your answer
Q3. 
Rat in a Maze: All Paths Problem
You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...read more
Ans. 
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
• Use backtracking to explore all possible paths from the starting cell to the destination cell.

• At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.

• Keep track of the path taken so far and mark the cells accordingly.

• Once the destination cell i...read more
Answered by AI
Add your answer