SDE - Intern
Expedia Group
2 rounds | 3 Coding problems
70 views
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip

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.

Application process
Where: Referral
Eligibility: Above 7 CGPA
Resume tip

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

Interview rounds
01
Round
Easy
Video Call
Duration45 minutes
Interview date28 Aug 2021
Problems2
Number of ones in the smallest repunit

#### Given a positive integer ‘N’ whose unit digit is 3. Find the number of 1's in the smallest repunit, which is divisible by...

view more
Problem approach

Given a positive integer ‘N’ whose unit digit is 3. Find the number of 1's in the smallest repunit, which is divisible by the given number N. Every number whose unit digit is 3 has a repunit as its multiple. A repunit is a number that has only 1. It is of the form (10 * N – 1)/9.

Reverse String

#### You are given a string ‘S’. You are also given ‘M’ integers in an array ‘A’. You perform ‘M’ operations on this string. The operations are given in an array ‘A’ of size ‘M’.

view more
Problem approach

You are given a string ‘S’. You are also given ‘M’ integers in an array ‘A’. You perform ‘M’ operations on this string. The operations are given in an array ‘A’ of size ‘M’.
You perform the operations in the order they appear in the array ‘A’. In the ‘i’th operation, you reverse the substring of ‘S’ from the position ‘A[i]’ to ‘len(S)’ - ‘A[i]’ - 1 (0 based).

view more
02
Round
Easy
Video Call
Duration45 minutes
Interview date28 Aug 2021
Problems1
Zigzag Binary Tree Traversal

#### Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from ...

view more
Problem approach

Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from left to right, then right to left for the next level and then again left to right and so on in an alternate manner.

Start a Discussion
Similar interview experiences
Frontend Developer
4 rounds | 8 problems
Interviewed by Expedia Group
199 views
Software Developer
3 rounds | 4 problems
Interviewed by Expedia Group
122 views
SDE - 1
4 rounds | 6 problems
Interviewed by Expedia Group
887 views
SDE - Intern
3 rounds | 5 problems
Interviewed by Expedia Group
16 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16756 views