eBay Bangalore — Cloud SRE Interview Experience (All Rounds)
Summary
Interview experience for eBay Cloud SRE position consisting of multiple technical rounds and a bar raiser round. Not selected after the final round.
Full Experience
Sharing questions asked across all rounds for anyone preparing for eBay SRE.
Round 0 — Online Assessment (CodeSignal)
4 coding questions. Standard DSA difficulty.
Round 1 — Technical
• Longest substring without repeating characters
• Word Break II
Round 2 — Technical
• Longest increasing subarray
• Stack implementation using Linked List
• Queue implementation using Stack
• Time and space complexity analysis throughout
Round 3 — Technical
• Longest palindromic substring
• N-Queens II (count distinct solutions — backtracking)
• Valid Parentheses
Round 4 — Hiring Manager
Behavioural and experience based. No coding.
Bar Raiser Round
• String merge with custom character ordering based on frequency — Two pointer approach — O(n+m) — Passed all test cases
• System Design — What happens when you type google.com
• TCP vs UDP vs QUIC
• HTTP status codes and SRE alerting
• Kubernetes concepts deep dive
• Toil reduction example
• Behavioural questions
Final Result — Not selected after Bar Raiser.
Interview Questions (14)
Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters.
Word Break II
Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order.
Longest Increasing Subarray
Find the length of the longest contiguous subarray in which the elements are strictly increasing.
Stack Implementation Using Linked List
Implement a stack data structure using a linked list, supporting standard operations like push, pop, peek/top, and isEmpty.
Queue Implementation Using Stack
Implement a queue data structure using two stacks, supporting standard operations like enqueue, dequeue, front, and isEmpty.
Longest Palindromic Substring
Given a string s, return the longest palindromic substring in s.
N-Queens II
The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return the number of distinct solutions to the n-queens puzzle.
Valid Parentheses
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
String Merge with Custom Character Ordering Based on Frequency
Merge two strings such that the resulting string follows a custom ordering based on the frequency of characters from both strings. Use a two-pointer approach with time complexity O(n + m).
System Design - What Happens When You Type google.com
Explain what happens behind the scenes when you type 'google.com' into your browser and press enter.
TCP vs UDP vs QUIC
Compare and contrast TCP, UDP, and QUIC protocols including their use cases and characteristics.
HTTP Status Codes and SRE Alerting
Discuss various HTTP status codes and how they relate to SRE practices such as alerting mechanisms.
Kubernetes Concepts Deep Dive
Deep dive into Kubernetes concepts relevant to running scalable services reliably.
Toil Reduction Example
Provide an example of reducing operational toil through automation or process improvement.