The interview process for a software engineer at eBay takes 2-6 weeks on average.

1. Phone screen with recruiter
2. Technical phone interview

The phone interview comprises a few theoretical questions about past projects and one coding exercise.

1. Onsite interview

The onsite interview is a full-day affair. It consists of 4-5 45-minute back-to-back sessions, along with a lunch interview. It includes a whiteboard architecture exercise, a pair programming exercise, a presentation on a topic of the candidate's choice, followed by a technical interview.

Round 1: HackerEarth-based test [Time: 1h15m]

This round had 2 questions.

1. Given an array of size N and K queries, find the number of segments containing the index from queries, where the number at that index is the leftmost or rightmost element and is greater than or equal to every other element in that segment. Example: arr[] = [1, 2, 3], K = [3] -> Output: 3 ([3], [2, 3], [1, 2, 3]) This is a modification of the problem: https://leetcode.com/problems/find-k-closest-elements/.

Verdict: Cleared

Round 2: F2F [Time: 1h]

1. Given an array and a target sum k, find all pairs a[i] + a[j] = k. Follow up: handle cases with both duplicate and non-duplicate elements.
2. Find the first non-repeating character in a string (containing only lowercase letters). https://leetcode.com/problems/first-unique-character-in-a-string/ Follow up: i) String contains both lowercase & uppercase letters. ii) Case-insensitive & case-sensitive checks. iii) Achieve O(1) space complexity.

Verdict: Cleared

Round 3: F2F [Time: 1h]

1. Determine if a linked list is a palindrome [expected time & space complexity: O(n) & O(1)]. https://leetcode.com/problems/palindrome-linked-list/
2. Find the diameter of a binary tree. https://leetcode.com/problems/diameter-of-binary-tree/
3. Validate if a tree is a BST. https://leetcode.com/problems/validate-binary-search-tree/