Moveinsync Technology Solutions Senior Associate Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.

Q1. 
Kth Largest Element Problem Statement
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Example:
Input:
Array: [2,1,5,6,3,8], K ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order

• Return the Kth element from the sorted array

• Handle multiple test cases
Answered by AI
Add your answer
Q2. 
Orange Rotting Problem Statement
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
• Value 0: Represents an empty cell.
• Value 1: Represents a fresh orang...read more
Ans. 
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
• Create a queue to store the rotten oranges and their time of rotting.

• Iterate through the grid to find the initial rotten oranges and add them to the queue.

• Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.

• Continue until the queue is empty, ke...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

This was a design round.

Round duration - 120 minutes
Round difficulty - Easy

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium levels. Time was enough and no sectional time was present. 1-2 MCQs on SQL was also present.

Q1. 
Boolean Matrix Transformation Challenge
Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...read more
Ans. 
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
• Iterate through the matrix to find elements with value 1

• Store the row and column indices of these elements

• Update the entire row and column for each element found to be 1
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was an online video interview round on HackerEarth with a simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class that required inheritance was asked by the interviewer to write. I was helped by the interviewer if I got stuck somewhere, Some questions on the implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Find the k-th Node from the End of a Linked List
Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...read more
Ans. 
To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.
• Iterate through the linked list to determine its size.

• Calculate the position of the k-th node from the end based on the size of the list.

• Traverse the list again to reach the k-th node from the end.

• Return a pointer to the k-th node from the end.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

High level System Design

Q1. Can you design a system like Uber, explaining the various components and architecture involved?
Ans. 
Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.
• User app for booking rides and tracking

• Driver app for accepting rides and navigation

• Server for handling requests and communication between apps

• Database for storing user, driver, and ride information

• Algorithms for matching riders with drivers and routing
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Basic HR questions

Q1. Traverse singly linked list in forward as well as in backward directions
Ans. 
To traverse a singly linked list in both forward and backward directions, we can use a doubly linked list.
• Create a doubly linked list with next and previous pointers

• Start traversing from the head node to the tail node using the next pointers

• To traverse in the backward direction, start from the tail node and use the previous pointers

• Continue traversing until reaching the end of the list
Answered by AI
View 1 more answer
Q2. Why you want to join ola?
Add your answer
Q3. Research about company and answer smartly
Add your answer

3 q python easy to medium

Q1. Tell me about your self
Ans. 
I am a passionate software engineer with experience in developing web applications and a strong background in computer science.
• Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React

• Strong background in computer science with knowledge of data structures and algorithms

• Proficient in programming languages such as Java, Python, and C++

• Excellent problem-solving skills and abili
Answered by AI
Add your answer
Q2. Why we hire you
Ans. 
I have a strong technical background, problem-solving skills, and a passion for software development.
• Extensive experience in programming languages such as Java, Python, and C++

• Proven track record of successfully delivering high-quality software projects on time

• Strong analytical and problem-solving skills, with the ability to quickly learn and adapt to new technologies

• Excellent communication and teamwork skills, essenti
Answered by AI
Add your answer

Q1. Binary Search + Sliding Window
Add your answer

Q1. Strengths and Weaknesses, etc.,
Add your answer

Q1. Based on linked list
Add your answer

Q1. Based in tree Data Structure
Add your answer

Q1. Based on the graph and one from aptitude
Add your answer