Mavenberg Innovations interview experience Real time questions & tips from candidates to crack your interview
Graduate Engineer Trainee
Mavenberg Innovations
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Journey
I started solving DSA coding questions on various coding platforms in my 3rd year of graduation. To clear the aptitude round (i.e., the first round of every company, both on-campus and off-campus), I watched the videos on YouTube to learn tricks and shortcuts and practised solving questions on the IndiaBix website.
Application story
I filled out the application form (which looks like a Google Form) that was circulated by our college's Training and Placement Officer.
Why selected/rejected for the role?
I think the main reasons behind the rejection for this role are poor English communication and a lack of advanced technical skills like AI, ML, Deep Learning, etc.
Preparation
Duration: 5 months
Topics: Data Structures, OOPS, DBMS, System Design, Algorithms, Dynamic Programming, Computer network
Tip 1: Try to build projects using new emerging technologies like AI/ML, Neural Networks & Deep Learning, Cloud Computing, etc.
Tip 2: Try to solve problems involving all types of data structures.
Application process
Where: Campus
Eligibility: Above 7 CGPA, (Salary Package: 4.5 LPA)
Tip 1: Try to build a one-page resume and include only your practical work.
Tip 2: Have some projects listed on your resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date28 Sep 2023
Coding problem1
50 aptitude questions on various topics for 60 minutes, and 1 medium-level DSA-based coding question for 30 minutes.
1. Maximum Of All Subarrays Of Size k.
Moderate
20m average time
80% success
0/80
Asked in companies
You are given an array consisting of N non-negative integers, and an integer K denoting the length of a subarray, your task is to determine the maximum elements for each subarray of size K.
Note:
A subarray is a contiguous subset of an array.
The array may contain duplicate elements.
The given array follows 0-based indexing.
It is guaranteed that there exists at least one subarray of size K.
Problem approach
I used the Sliding Window + Deque approach.
Here, the deque is used to store the indices of array elements.
Now, iterate through the array:
-Remove indices that are out of the current window.
-Remove smaller elements from the back of the deque.
-Add the current index to the deque.
-Add the maximum element of the current window to the result.
02
Round
Medium
Video Call
Duration45 minutes
Interview date30 Sep 2023
Coding problem2
This is an online interview conducted on Microsoft Teams Meetings. In this interview, a panel of three members is present to ask technical questions (based on DSA, OOPs, DBMS, Software Engineering), HR and MR questions, and discuss projects.
1. SQL Questions
Problem approach
Tip 1: Take a small pause and give your answer politely.
Tip 2: If you don’t know the answer, simply say, "Sorry, sir, I don’t know the answer," and move to the next question.
Tip 3: Practice SQL queries regularly.
2. Permutations of a String
Moderate
15m average time
85% success
0/80
Asked in companies
You are given a string 'STR' consisting of lowercase English letters. Your task is to return all permutations of the given string in lexicographically increasing order.
String A is lexicographically less than string B, if either A is a prefix of B (and A ≠ B), or there exists such i (1 <= i <= min(|A|, |B|)), that A[i] < B[i], and for any j (1 <= j < i) A[i] = B[i]. Here |A| denotes the length of the string A.
For example :
If the string is “bca”, then its permutations in lexicographically increasing order are { “abc”, “acb”, “bac”, “bca”, “cab”, “cba” }.
Note:
Given string contains unique characters.
Problem approach
I created a recursive function: void permutation(int left, int right, string &s, vector<string> &ans). It swaps characters to generate permutations recursively. Once left equals right, it pushes the current permutation into the result vector.
After exploring one permutation, the swap(s[left], s[j]) call ensures that the string is restored to its previous state for other possibilities.
Sorting:
Sorting the input string before starting helps generate permutations in lexicographical order.
The driver function AllPerm(string &s) initializes the result vector and calls the recursive function.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
960 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
Graduate Engineer Trainee
2 rounds | 5 problems
Interviewed by HCL Technologies
Selected 13565 views
3 comments
0 upvotes
Graduate Engineer Trainee
3 rounds | 4 problems
Interviewed by HCL Technologies
Selected 2811 views
0 comments
0 upvotes
Graduate Engineer Trainee
2 rounds | 2 problems
Interviewed by HCL Technologies
Selected 3452 views
0 comments
0 upvotes