i
ShareChat
Filter interviews by
I applied via Referral and was interviewed in Mar 2024. There were 2 interview rounds.
It was a leetcode medium, related BFS,
ViewModel is necessary in Android development to save and manage UI-related data during configuration changes.
ViewModel helps in retaining data during configuration changes like screen rotations
It separates UI-related data from UI controller (Activity/Fragment)
ViewModel survives configuration changes and can be shared between fragments
It helps in maintaining data consistency and prevents memory leaks
ViewModel is lifecy...
I appeared for an interview before Apr 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Tip : Do variants of Binary Search.
Given an integer 'A', the objective is to find the largest non-negative integer whose square is less than or equal to 'A'.
The square of a number is defined as the pro...
Find the largest non-negative integer whose square is less than or equal to a given integer.
Use binary search to efficiently find the square root of the given integer.
Start with a range from 0 to the given integer and iteratively narrow down the range based on the square of the middle value.
Return the largest integer whose square is less than or equal to the given integer.
You are presented with a sorted array that has been rotated an unknown number of times. The nature of this rotation is such that each element shifts to the right with ...
Find the smallest element in a rotated sorted array.
Use binary search to find the pivot point where rotation occurs.
Compare the element at the pivot point to determine the smallest element.
Handle cases where the array is not rotated or has only one element.
Time complexity should be O(log(N)) and space complexity O(1).
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Referral and was interviewed in Feb 2021. There was 1 interview round.
Use binary search to find the square root of an integer.
Start with low=0 and high=x.
While low<=high, calculate mid=(low+high)/2.
If mid*mid==x, return mid.
If mid*mid
If mid*mid>x, set high=mid-1.
Return high as the floor of the square root.
Find a given number in a sorted rotated array.
Use binary search to find the pivot point where the array is rotated.
Determine which half of the array the target number may be in.
Perform binary search on the appropriate half of the array to find the target number.
Top trending discussions
I applied via Job Portal and was interviewed in Jun 2024. There were 3 interview rounds.
I don't remember the ques
Design a scalable notification system for sending real-time alerts to users.
Use a distributed system to handle high volume of notifications.
Implement message queues for asynchronous processing.
Utilize push notifications for mobile devices.
Include a user preference system for customizing notification settings.
Consider implementing a notification history feature for users to view past alerts.
Google Pay is a digital wallet platform and online payment system developed by Google.
Google Pay uses secure tokenization to protect user's payment information.
It integrates with various payment methods like credit/debit cards, UPI, and NFC.
The system handles transactions, user authentication, and merchant integrations.
Google Pay leverages Google's infrastructure for scalability and reliability.
It provides features lik...
I appeared for an interview in Jun 2021.
Round duration - 60 minutes
Round difficulty - Medium
- It was a face to face (virtually) round.
- Two questions one after one and you are expected to pass all the test cases.
- Question was Easy and Medium Easy. (tags: stack, array, bfs, dfs, array)
- Timing: Afternoon
- Interviewer: he was nice, as I was able to solve both question, he was very happy, and given me the feedback.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters and return the newly formed string.
The task is to remove consecutive duplicate characters from a given string and return the new string.
Iterate through the characters of the string
Compare each character with the next character
If they are the same, skip the next character
If they are different, append the current character to the new string
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
The task is to find the number of islands present in a 2-dimensional array filled with ones and zeroes.
Iterate through each cell in the array
If the cell is land (1) and not visited, perform a depth-first search to find all connected land cells
Increment the count of islands for each connected component found
Round duration - 135 minutes
Round difficulty - Medium
Machine Coding.
Timing: Afternoon
The interviewer was answering my questions nicely.
Round duration - 60 minutes
Round difficulty - Medium
Hiring Manager.
Interviewer: Sr Engineering Manager.
Timing: evening.
The environment was cool.
Tip 1 : Stick to one coding platform either do it from geeks for geeks, coding ninja or leetcode. Never jump from one platform to other. Focus on Building the concept rather than solving it.
Tip 2 : Follow the Grooking the Object-Oriented Programming, and try to follow SOLID principle as much as you can. If possible take some MOCK interviews.
Tip 3 : Build your concept on Relational databases, you should be able to design the table structures and relationships.
Tip4: You should aware of your project and your contribution to it. Project Objective should be clear. You should know the tech stack used in project, and reason for choosing it.
Tip 1 : Don't write too many paragraphs in the project description, It should be pointwise.
Tip 2 : Don't highlight too many skills, like HTML CSS kind of things.
Tip 3 : One page.
Tip 4 : If you are not a fresher, no need to mention school achievements.
I appeared for an interview in May 2022.
I applied via LinkedIn and was interviewed in Jun 2024. There was 1 interview round.
The minimum cost to connect the ropes is calculated by repeatedly connecting the two smallest ropes until all ropes are connected.
Sort the ropes in ascending order.
Repeatedly connect the two smallest ropes.
Add the cost of connecting the two ropes to the total cost.
Continue this process until all ropes are connected.
The question asks for the maximum value of arr[i]+arr[j]+i-j for given array arr.
Iterate through all possible pairs of i and j in the array
Calculate the value of arr[i]+arr[j]+i-j for each pair
Keep track of the maximum value found
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
based on 1 interview experience
Difficulty level
Duration
based on 7 reviews
Rating in categories
Senior Associate Operations
154
salaries
| ₹4 L/yr - ₹9 L/yr |
Operations Associate
128
salaries
| ₹3.5 L/yr - ₹6.1 L/yr |
Lead Operator
72
salaries
| ₹6 L/yr - ₹12.7 L/yr |
Territory Sales Manager
66
salaries
| ₹4 L/yr - ₹9.1 L/yr |
Associate Product Manager
62
salaries
| ₹15 L/yr - ₹41 L/yr |
Udaan
Swiggy
CARS24
BlackBuck