# Groupon Interview Questions : set 3

By | May 2, 2014

I recently attended Groupon Interview offcampus for SDE-1 position. This drive wa for freshers.

Round 1 (Skype Interview)
A coding Problem.You have a robot in a grid, it can move in forward direction and can change its facing towards north, south, east n west and you are given a command sequence. So what will be the final position of the robot

Example
Grid(100*500)
Robot Position – (5,3)
Sequence — {N,S,M,M,E,W,E,S,M,S,M} North, East, West, South, Move forward

They shared an editor with me.They asked me for the perfect code for all boundary cases. I did it well.

Round 2(Again Skype Interview)
Level order traversal.Again they shared an editor with me.
I quickly told them my approach, they said ok. Now they make changes in the question. You will have to print it level by level with line break. So I gave them one another method which works in O(n) but they told me to make changes to the first approach. I made changes to the solution, they were satisfied with it, then told me to code it. Again they asked me questions in the code. At last they were very satisfied with the code, I was able to make quick changes according to them or if I have missed something.

All the below rounds happened the same day.

Round 3(Onsite Technical Interview)
He started with general discussion then HR, Then he gave me a problem.

• You have a binary tree on client machine, how will u send this info to server and how will you again maintain the tree over the server. I thought few mins, tell him my approach, he was asking for easier way. Then finally I told him my approach. He was satisfied and told me to write the code how and what info will u send and how will u again maintain it on the server, I write both the codes and He was very satisfied with my code.
• Round 4(Onsite Technical Interview)

• Find the min and max in an array in minimum no of operations with complexity. I told him approach, he told me to code it and he was satisfied with it
• You are given a graph and an algorithm that can find the shortest path b/w any two nodes
Now you have to find the second shortest path between same two nodes. I thought few mins and tell him my approach, he was satisfied and told me to code it.
• Round 5(Onsite Technical Interview)
She asked me lots of question from OS, DS, OOPS

• Project description and what was my role
• Threading, semaphore, Process, Locking Unlocking
• OOPs basic questions- Polymorphism(runtime, compile time) virtual, vtable, some more questions.
• DS questions

• Connect nodes at same level, then code for that, then test cases
• Some questions based on complexity and which will be the better
• Which sort will u prefer for linked list and why?
• In a grid, you are given a position, and every location has some value. find the shortest length so that you can touch to any boundary of the grid. I code it then she asked me to optimize it, I did that also.
• Some other questions but I don’t remember now.
• Finally I was selected for Groupon 🙂

Have got some interview questions submit it here.So that we can help other candidates like you to land their dream job