AIMLAY Senior Executive Interview Questions and Answers

Q1. Tell about your self and your education background
Add your answer

Q1. Why you are fit about this job
Add your answer

Q1. Tell me about yourself.
Add your answer
Q2. What are your salary expectations
Ans. I want this job, I have a job of 20000 salary in this company, now whatever salary you want to give me, I will take it, which you like.
Answered Anonymously
Add your answer

The topic was smart work vs Hard work.

Q1. Self Introduction.
Add your answer
Q2. About company and other things from resume itself.
Add your answer

Q1. About sales how sales is done.
Add your answer
Q2. About edtech sector, about past experience.
Add your answer

It was very insightful, and your confidence is checked

Q1. Why do you want to be in sales
Ans. 
I am passionate about building relationships, meeting new people, and helping customers find solutions to their needs.
• Enjoy interacting with people and building relationships

• Thrilled by the challenge of meeting sales targets

• Excited to help customers find solutions to their problems
Answered by AI
Add your answer
Q2. What are your ambitions
Ans. 
To become a top-performing Sales Executive in the industry and eventually move into a leadership role.
• To consistently exceed sales targets and drive revenue growth

• To build strong relationships with clients and provide exceptional customer service

• To continuously improve my sales skills and stay updated on industry trends

• To eventually transition into a leadership role and mentor junior sales professionals
Answered by AI
Add your answer

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

Q1. Question doesn't matter
Add your answer
Q2. Question doesn't really care
Add your answer

3 questions in 3 hr, topics were Dp, Strings, Tree

1hr durations 40 questions, main topics were patterns, profit loss, work man , etc.

Q1. OOPS, JAVA, Mysql, general questsjons
Add your answer