i
Moglix
Filter interviews by
I appeared for an interview in Jul 2024.
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.
I appeared for an interview before Apr 2021.
Round duration - 45 Minutes
Round difficulty - Medium
It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Merge two sorted linked lists into a single sorted linked list without using additional space.
Create a dummy node to start the merged list
Compare the values of the two linked lists and add the smaller value to the merged list
Move the pointer of the merged list and the pointer of the smaller value list
Continue this process until one of the lists is fully traversed
Append the remaining elements of the other list to the me
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Round duration - 60 Minutes
Round difficulty - Medium
It was more of a in depth round on the framework I'm working on and problem solving.
The event loop is a mechanism in programming that allows for asynchronous execution of code.
The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.
It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.
The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...
Output-based questions in JavaScript using browser APIs
Example 1: Write a script that uses the Geolocation API to display the user's current location on a map
Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked
Example 3: Develop a web page that uses the Canvas API to draw a simple animation
Designing a system to support localization in a mobile app
Use resource files to store localized strings for different languages
Implement a language selection feature for users to choose their preferred language
Utilize localization libraries or frameworks to streamline the process
Consider cultural differences when localizing content, such as date formats and currency symbols
Round duration - 75 Minutes
Round difficulty - Hard
It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.
To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.
Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.
Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.
Keep track of the results and compare the timings to d
To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.
Analyze code to identify any inefficient algorithms or operations causing lag.
Check for memory leaks that could be impacting performance.
Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.
Use profiling tools like Xcode Instruments or Android Profiler to identify p
The app I recently worked on is a social media platform for sharing photos and connecting with friends.
The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.
The client side is built using React Native for cross-platform compatibility.
The server side is implemented using Node.js with a MongoDB database for storing user data and photos.
The a...
Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)
Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.
Duration 1Hr
2 coding questions
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
Basic coding only not to worry much
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Excellent team player with good communication skills
I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.
Developed a web-based inventory management system using React and Node.js
Created a mobile app for tracking fitness goals using Flutter
Implemented RESTful APIs for communication between frontend and backend systems
Sorting of an array and aptitude
I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.
Easy level to Medium level
2 Easy questions of DSA
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
I appeared for an interview in Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.
You are provided with two strings A
and B
. Your task is to find the index of the first occurrence of A
within B
. If A
is not found in B
, return -1.
A = "bc", ...
Implement a function to find the index of the first occurrence of one string within another string.
Iterate through the second string and check if a substring of the same length as the first string matches the first string.
Return the index of the first occurrence of the first string within the second string, or -1 if not found.
Handle edge cases like empty strings or when the first string is longer than the second string
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q
queries. Each query is represented by an integer Q[i]
, and you must ...
Search for integers in a rotated sorted array efficiently.
Implement binary search to find the target integer in the rotated array.
Handle the rotation by checking which side of the array is sorted before performing binary search.
Return the index of the target integer if found, else return -1.
Time complexity of O(logN) is required for each query.
Round duration - 60 minutes
Round difficulty - Medium
The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Calculate the number of distinct subsequences in a string with possible duplicates.
Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.
Consider the cases where the current character is included or excluded in the subsequence.
Handle duplicates by considering the previous occurrence of the character.
Return the count of distinct subsequences modulo 10^9 + 7.
Round duration - 60 minutes
Round difficulty - Easy
This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM
Tip 1 : I prepared all topics from my Coding Ninjas Course - Competitive Programming
Tip 2 : I practiced 300+ questions on CodeZen ( Coding Ninjas Platform), LeetCode, InterviewBit
Tip 3 : I took part in contests on CodeForces.
Tip 4 : Apart from Data Structures and Algorithms , I also studied DBMS, OOPs and other course subjects
Tip 1 : Keep Resume up to date for the role you are applying.
Tip 2 : Mention atleast 1 project or past work experience.
Tip 3 : Try to keep a 1 pager resume.
based on 1 interview
Interview experience
Assistant Manager
350
salaries
| ₹3.8 L/yr - ₹8 L/yr |
Deputy Manager
295
salaries
| ₹5.1 L/yr - ₹11 L/yr |
Senior Executive
183
salaries
| ₹2.5 L/yr - ₹5.4 L/yr |
Senior Manager
132
salaries
| ₹13.5 L/yr - ₹30 L/yr |
Manager
131
salaries
| ₹5.5 L/yr - ₹20 L/yr |
Udaan
Swiggy
CARS24
BlackBuck