eBay - T24 - Interview Experience

ebay logo
ebay
T243 years
July 19, 202513 reads

Summary

I interviewed for a T24 role at eBay, which included an Online Assessment and three face-to-face rounds focusing on Data Structures & Algorithms, project discussions, and scenario-based questions. I successfully cleared the interview and received an offer.

Full Experience

YOE: 3 years, Currently working at a PBC
Recruiter reached out to me based on my profile

Round 1 : OA (90 min)
This was conducted on CodeSignal and involved developing a banking application with four progressive levels. Each level required passing a set of test cases to advance to the next. The first level focused on implementing account creation, deposit, and credit functionalities. The second level involved handling transactions between accounts. The third level required managing transaction failures and implementing rollbacks. I was able to complete up to the third level.

Rounds 2, 3, and 4 were conducted face-to-face, all on the same day. Each round was an elimination round.

Round 2 :
https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/description/
And follow ups for this

Round 3 :
I was asked about the projects I’ve worked on at my current company. Based on that, he gave me a few scenario-based questions and asked how I would approach or implement them. Toward the end, I was given a DSA question that I was only able to solve partially. I found it to be quite hard one. Couldn’t find a similar one on LeetCode.

Round 4 :
Again discussed about my projects and resume, followed by 2 DSA questions
https://leetcode.com/problems/move-zeroes/description/
https://leetcode.com/problems/3sum/description/

Four days later, the HR informed me that they had decided to move forward with me.

Interview Questions (5)

Q1
Banking Application Development (Online Assessment)
Data Structures & Algorithms

Develop a banking application on CodeSignal with four progressive levels. Level 1: implement account creation, deposit, and credit functionalities. Level 2: handle transactions between accounts. Level 3: manage transaction failures and implement rollbacks. I completed up to the third level.

Q2
All Nodes Distance K in Binary Tree
Data Structures & AlgorithmsMedium

Given the root of a binary tree, a target node, and an integer k, return an array of the values of all nodes that have a distance k from the target node. Follow-up questions were also asked.

Q3
Project-based Scenario Questions
System Design

I was asked about the projects I’ve worked on at my current company. Based on that, the interviewer gave me a few scenario-based questions and asked how I would approach or implement them.

Q4
Move Zeroes
Data Structures & AlgorithmsEasy

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array.

Q5
3Sum
Data Structures & AlgorithmsMedium

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!