Open in App
Not now

# Grofers Interview Experience

• Difficulty Level : Hard
• Last Updated : 12 Sep, 2018

Round 0: Coding Assignment

A document was shared containing 2 questions:

1. You would have used the feature of Google maps in which you put in location A and location B and Maps comes up with 2-3 routes and suggests the most optimal one. How would you implement it. Assume you are given the road network of the whole world and there is no traffic. Assume that every 10mx10m location is tagged whether road exists there or not and location A and B are a particular 10mx10m location. Also, assume that the effort to move between adjacent 10×10 squares is a constant 1. And, in the output you just need to tell the minimum distance that exists between location A & B.Input:

(i) the world map with data of whether a road exists at a particular 10x10m location,

(ii) locations A & B

Output:

Integer that represents minimum distance between A & B.

2. For this years Oscar Awards, invitations have been extended to ‘n’ guests. Now, these guests can choose to either come with an existing invited guest or come solo. Based on how the guests are coming, we need to prepare the greeting cards that would be kept at the tables. Now, Yash, who has been tasked to prepare the greeting cards, starts wondering in how many different ways can he expect his guests to arrive. Can you help him figure it out?Input:

n – the number of invited guests

0<n<20

Output:

No of ways guests can arrive.

Round 1:Â

• TCP vs UDP
• HTTP vs HTTPS
• 127.0.0.1 vs 0.0.0.0
• discussion of composite index
• Tomcat spawns thread for each request or process, thread vs process.
• Swap memory
• Design A chat group

Round 2:

• Design an API for expression evaluator.

Round 3:

• Find time complexity for:
• T(n) = T(n-1) + (n-2)T(n-2)
• Print Possible Decodings of a given Digit Sequence, Java Solution – https://ideone.com/q0i64b
• Count ways to reach the nth stair using step 1, 2 or 3
My Personal Notes arrow_drop_up
Related Articles