i
Grab Greco
Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 4 interview rounds.
Notification Observer Design Pattern is used to establish a one-to-many relationship between objects.
Create a subject class that maintains a list of observers and notifies them of any state changes.
Observers register themselves with the subject to receive notifications.
Use protocols and delegates in iOS to implement the observer pattern.
Example: NotificationCenter in iOS uses the observer pattern to broadcast notificat
I applied via Company Website and was interviewed before Jul 2022. There were 6 interview rounds.
This round contains live coding round on any online editor.
Top trending discussions
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
Print nodes of n-ary tree in arc wise manner from outside
Traverse the tree level by level from outside to inside
Use a queue to keep track of nodes at each level
Print the nodes at each level in a clockwise or anticlockwise manner
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
I have extensive experience with various design patterns such as Singleton, Factory, Observer, and MVC.
Implemented Singleton pattern to ensure only one instance of a class exists
Utilized Factory pattern to create objects without specifying the exact class
Implemented Observer pattern for event handling and notifications
Utilized MVC pattern for separating concerns in a software application
posted on 19 Dec 2023
I applied via LinkedIn and was interviewed in Nov 2023. There were 2 interview rounds.
Create subarrays with sum = 0 from given array of integers.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.
If yes, then the subarray between those two indices has a sum of 0.
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree in a level order manner and keep track of the first node at each level.
Use a queue to store nodes at each level and update the left view nodes accordingly.
Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
I was interviewed before Jul 2023.
45 min round. Similar to Leetcode medium level question.
45 min coding round, 2 question asked
Design a system for proximity service
Utilize geolocation data to track user locations
Implement algorithms to calculate proximity between users
Use real-time updates to notify users of nearby contacts
I applied via Company Website and was interviewed before May 2023. There were 2 interview rounds.
Some of the top questions asked at the Grab Greco Senior Software Engineer interview -
based on 2 interviews
Interview experience
Software Engineer
59
salaries
| ₹13.4 L/yr - ₹36 L/yr |
Senior Software Engineer
51
salaries
| ₹27 L/yr - ₹60.3 L/yr |
Team Lead
32
salaries
| ₹1.9 L/yr - ₹3 L/yr |
QA Engineer
16
salaries
| ₹15.9 L/yr - ₹36.3 L/yr |
Software Developer
12
salaries
| ₹12.7 L/yr - ₹37 L/yr |
Zomato
Swiggy
Ola Cabs
Uber