Interview Experience | Off Campus - Oct 2021

New update is available. Click here to update.

SDE - 1

Expedia Group

3 rounds | 5 Coding problems

Anonymous

Fresher | Oct 2021

Selected

0 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 6 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, java

Tip

Tip 1 - Practice Atleast 250 Questions from geeks from geeks and coding ninjas
Tip 2 - Ex- Do atleast 2 good projects

Application process

Where: Hackerrank

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume and be confident.

Interview rounds

Round

Easy

Online Coding Interview

Duration60 minutes

Interview date8 Oct 2021

Problems1

Encode and Decode

Tiny URL is an online URL shortening service, where you get a short version of a given URL as a substitute.

Your task is to design encode th...

Try solving now

Round

Medium

Video Call

Duration90 minutes

Interview date10 Oct 2021

Problems3

Height of Binary Tree

You are given an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. You need to find out the height of the tree.

Try solving now

Binary Tree Zigzag Traversal

You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to print the zigzag traversal of the given tree.

Note:

Problem approach

This problem can be solved using two stacks. Assume the two stacks are current: currentlevel and nextlevel. We would also need a variable to keep track of the current level order(whether it is left to right or right to left). We pop from the currentlevel stack and print the nodes value. Whenever the current level order is from left to right, push the nodes left child, then its right child to th...

Try solving now

Diagonal Traversal of a Binary Tree

You have been given a binary tree of integers. You are supposed to find the diagonal traversal(refer to Example) of the given binary tree.

Example:

Problem approach

The plan is to make use of a map. Different slope distances are used in the map as a key. The map’s value is a node vector (or dynamic array). To save values in the map, we traverse the tree. We print the contents of the map after it has been constructed.

Try solving now

Round

Easy

HR Round

Duration30 minutes

Interview date12 Oct 2021

Problems1

Basic HR Questions

She asked some questions related to my projects, challenges I faced and how did I overcome those?
Tech stack I used and difference between MongoDb and Mysql, which is better?
Difference between csv and json and why both exist?
Where do you see yourself in next couple of years?
Why expedia? What change you can bring to company? Are you willing to relocate?

Problem approach

Tip 1 : Be confident
Tip 2 : Have background about the company