Moglix Interview Questions, Process, and Tips

Q1. What is a probe?
Add your answer
Q2. Do you know about moglix?
Add your answer

Q1. Tell.me about yourself
Add your answer
Q2. What has been your approach to grow business in your pervious job roles
Add your answer

Q1. Reason for looking out
Add your answer
Q2. New market development approach
Ans. 
New market development approach involves identifying untapped markets, conducting market research, creating a strategic plan, and implementing targeted marketing strategies.
• Conduct thorough market research to identify potential new markets

• Analyze competition and consumer behavior in the new market

• Develop a strategic plan outlining goals, objectives, and tactics for market entry

• Implement targeted marketing strategies to...read more
Answered by AI
Add your answer

SQL questions (30 mins)
SqL engines, Inno db
some basic sql queries
optimization technique

DSA and Java Concepts(30 mins)
2 pointer and sliding window questions.
Basic questions over spring boot

Managerial round(1 hr)
Previous work experience
writing some basic APIs
Questions on Map
DSA question, sort an array in O(n) consisting of 0s and 1s.

So after Resume shortlisting you have Round 1 as Programming Test (60%) & Aptitude Test (40%) in which you will be asked 15 aptitude questions and 2 DSA problems. You will get 1 hour to write the test.
DSA problems:
1. Merge 2 sorted arrays
2. find the target sum in given array and return their indexes

Q1. If you clear Round 1 then you will go forward to Round 2 which is one-to-one technical round. In this round you will be asked leetcode problems and some conceptual questions. I was asked to Find the Max su...read more
Add your answer
Q2. Length of Longest Substring with distinct character
Ans. 
Find the length of the longest substring with distinct characters in a given string.
• Use a sliding window approach to keep track of the current substring.

• Maintain a set to store the distinct characters in the current substring.

• Update the maximum length of the substring whenever a longer substring is found.
Answered by AI
Add your answer
Q3. Find Max sum of subarray.
Ans. 
The maximum sum of a subarray is to be found.
• Use Kadane's algorithm to find the maximum sum of a subarray.

• Initialize two variables: maxSum and currentSum.

• Iterate through the array and update currentSum by adding the current element.

• If currentSum becomes negative, reset it to 0.

• If currentSum is greater than maxSum, update maxSum.

• Return maxSum as the maximum sum of a subarray.
Answered by AI
Add your answer

Q1. Last round was Head of engineering round in this you will be asked some technical questions like: Apply Merge sort on a Linked List
Add your answer
Q2. 25 Horses: Google interview problem
Add your answer