Upload Button Icon Add office photos

eBay

Compare button icon Compare button icon Compare

Filter interviews by

eBay Software Developer Interview Questions, Process, and Tips

Updated 1 Aug 2024

Top eBay Software Developer Interview Questions and Answers

  • Q1. Let’s say you have 100,000 records and you want to delete 95,000 at a time and keep only 5 thousand. But in local memory you don’t have enough space for 95,000 records. W ...read more
  • Q2. There are three threads have been assigned different work. Say, T1 takes 10 sec T2 takes 20sec t3 takes 15sec Now you have to make sure that all threads merge into one an ...read more
  • Q3. Let us assume there are 3 baskets with different number of balls say p,q and r. Every ball has a number written on it. Now, you have to take all those balls and put them ...read more
View all 12 questions

eBay Software Developer Interview Experiences

2 interviews found

Software Developer Interview Questions & Answers

user image Yevgeni Kabisher

posted on 1 Aug 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. Just a go thru life and career
  • Q2. What are 3 weaknesses
  • Ans. 

    Three weaknesses include lack of experience in a specific technology, difficulty with time management, and tendency to overthink solutions.

    • Lack of experience in a specific technology (e.g. not familiar with a certain programming language or framework)

    • Difficulty with time management (e.g. struggling to prioritize tasks effectively)

    • Tendency to overthink solutions (e.g. spending too much time analyzing a problem before ta

  • Answered by AI

Interview Questionnaire 

16 Questions

  • Q1. Let us assume there are 3 baskets with different number of balls say p,q and r. Every ball has a number written on it. Now, you have to take all those balls and put them back in baskets in sorted way.?(Mer...
  • Ans. 

    Merge sort algorithm can be used to sort the balls in each basket and then merge the sorted baskets.

    • Apply merge sort algorithm to sort the balls in each basket

    • Merge the sorted baskets to get the final sorted order

    • Use recursion to implement merge sort

    • Time complexity of merge sort is O(nlogn)

  • Answered by AI
  • Q2. What is Mutual Exclusion?
  • Ans. 

    Mutual Exclusion is a technique to ensure that only one process at a time can access a shared resource.

    • It prevents race conditions and ensures data consistency.

    • It can be implemented using locks, semaphores, or monitors.

    • Examples include critical sections in multi-threaded programs and database transactions.

    • It can lead to performance issues if not implemented efficiently.

  • Answered by AI
  • Q3. What is multithreading and Difference between process and thread?
  • Ans. 

    Multithreading is the ability of a CPU to execute multiple threads concurrently. A process is an instance of a program in execution.

    • Multithreading allows multiple threads to run concurrently within a single process.

    • Threads share the same memory space and resources of the process they belong to.

    • Processes are independent of each other and have their own memory space and resources.

    • Threads are lightweight compared to proce...

  • Answered by AI
  • Q4. What is Semaphore?
  • Ans. 

    Semaphore is a synchronization object used to control access to a shared resource.

    • Semaphore is used to limit the number of threads accessing a shared resource.

    • It can be used to implement critical sections and avoid race conditions.

    • Semaphore can be binary or counting, depending on the number of resources available.

    • Examples of semaphore in programming languages include Java's Semaphore class and Python's threading.Semaph

  • Answered by AI
  • Q5. There are three threads have been assigned different work. Say, T1 takes 10 sec T2 takes 20sec t3 takes 15sec Now you have to make sure that all threads merge into one and continue as a single thread. How ...
  • Ans. 

    Wait for completion of all threads and join them into a single thread.

    • Use join() method to wait for completion of each thread.

    • Create a new thread and call start() method to start the execution of all threads.

    • Use sleep() method to pause the execution of the current thread until all threads complete their execution.

  • Answered by AI
  • Q6. Let’s say you have 100,000 records and you want to delete 95,000 at a time and keep only 5 thousand. But in local memory you don’t have enough space for 95,000 records. What do you do in this case? How do ...
  • Ans. 

    To delete 95,000 records with limited local memory, use batch processing and delete in chunks.

    • Use batch processing to delete records in chunks

    • Delete records in descending order of their IDs to avoid index fragmentation

    • Commit the transaction after deleting each batch to avoid long-running transactions

    • Consider archiving the deleted records instead of permanently deleting them

  • Answered by AI
  • Q7. Function ‘sum’ which takes arguments, such that if both args are: int : does integer addition float : does float addition string : concatenates them Write a program in ‘C’ that does the same?
  • Ans. 

    Program in C to implement a function 'sum' that performs integer addition, float addition, and string concatenation based on the input arguments.

    • Define the function 'sum' with two arguments of type 'void *'.

    • Use 'if-else' statements to check the data type of the arguments.

    • Perform integer addition if both arguments are of type 'int'.

    • Perform float addition if both arguments are of type 'float'.

    • Concatenate the strings if b...

  • Answered by AI
  • Q8. Write SQL Query for creating tables?
  • Ans. 

    SQL query for creating tables

    • Use CREATE TABLE statement

    • Specify table name and column names with data types

    • Add constraints like primary key, foreign key, etc.

    • Example: CREATE TABLE customers (id INT PRIMARY KEY, name VARCHAR(50), email VARCHAR(50))

  • Answered by AI
  • Q9. What about NESTED TABLES?
  • Ans. 

    Nested tables are tables within tables, used to organize and store complex data structures.

    • Nested tables are commonly used in databases to store arrays of data within a single row of a table.

    • They can also be used in programming languages to create multidimensional arrays.

    • Accessing data within a nested table requires using multiple levels of indexing.

    • Nested tables can improve data organization and simplify complex data

  • Answered by AI
  • Q10. What are views?
  • Ans. 

    Views are virtual tables that display data from one or more tables in a database.

    • Views are created using SELECT statements.

    • They can be used to simplify complex queries.

    • They can also be used to restrict access to sensitive data.

    • Views do not store data themselves, but rather display data from underlying tables.

    • Changes made to the underlying tables are reflected in the view.

  • Answered by AI
  • Q11. About my projects?
  • Q12. Tell me about yourself
  • Ans. 

    I am a software developer with experience in multiple programming languages and a passion for problem-solving.

    • Proficient in Java, Python, and C++

    • Experience with web development using HTML, CSS, and JavaScript

    • Familiarity with Agile development methodologies

    • Strong problem-solving and analytical skills

    • Excellent communication and teamwork abilities

  • Answered by AI
  • Q13. You have an embedded system device. Okay? So you are given some numbers from 1-100 and unique. Now, sort these numbers?
  • Q14. Evaluate Postfix expression?
  • Ans. 

    Postfix expression can be evaluated using a stack data structure.

    • Create an empty stack

    • Scan the expression from left to right

    • If the scanned character is an operand, push it onto the stack

    • If the scanned character is an operator, pop two operands from the stack, perform the operation and push the result back

    • Repeat until the end of the expression

    • The final result is the top of the stack

  • Answered by AI
  • Q15. Where do you see yoyurself in 5 years? et
  • Ans. 

    In 5 years, I see myself as a senior software developer leading a team of developers to create innovative solutions.

    • Leading a team of developers to create innovative solutions

    • Continuing to learn and stay up-to-date with new technologies

    • Contributing to the growth and success of the company

    • Mentoring and coaching junior developers

    • Taking on more responsibilities and challenges

  • Answered by AI
  • Q16. Why Ebay?
  • Ans. 

    Ebay is a leading e-commerce platform with a global reach and a diverse range of products.

    • Ebay has a large and diverse customer base, providing opportunities to work on a variety of projects.

    • The company has a strong focus on innovation and technology, which aligns with my interests and skills.

    • Ebay offers a dynamic and fast-paced work environment, which I find exciting and challenging.

    • The company has a strong reputation...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 30 questions out of which 50% was based on java and c++, the rest from verbal and quantitative stuff.The key areas to focus on are:
· OOPS-all concepts, contructors etc
· Database-sql queries and normal basics stuff about schemas etc
· Networks- subnetting, various routing protocols, about mac address
· Probability ans Statistics
Duration: 30 minutes

Skills: Algorithm, OS, Data structure
College Name: Na

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Interview questions from similar companies

Interview Questionnaire 

10 Questions

  • Q1. What do you do when your schedule is interrupted? How you handle it?
  • Q2. PreOrder traversal without recursion?
  • Ans. 

    PreOrder traversal without recursion is done using a stack to simulate the function call stack.

    • Create an empty stack and push the root node onto it.

    • While the stack is not empty, pop a node from the stack and process it.

    • Push the right child of the popped node onto the stack if it exists.

    • Push the left child of the popped node onto the stack if it exists.

  • Answered by AI
  • Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
  • Ans. 

    Yes

    • Create an empty binary search tree (BST)

    • Loop over the unsorted array

    • For each element, insert it into the BST using the appropriate insertion logic

    • Repeat until all elements are inserted

    • The resulting BST will be built from the unsorted array

  • Answered by AI
  • Q4. Find 2 elements in array whose sum is equal to given number?
  • Ans. 

    The question asks to find two elements in an array whose sum is equal to a given number.

    • Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.

    • Use a hash set to store the elements as you iterate through the array for efficient lookup.

    • Return the pair of elements if found, otherwise return a message indicating no such pair exists.

  • Answered by AI
  • Q5. How many types of trigger?
  • Ans. 

    There are two types of triggers: DML triggers and DDL triggers.

    • DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.

    • DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.

    • Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt

  • Answered by AI
  • Q6. Can trigger be used with select statement?
  • Ans. 

    Yes, triggers can be used with select statements in SQL.

    • Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.

    • While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.

    • Using triggers with select statements allows you to perform additional actions or validations before or af...

  • Answered by AI
  • Q7. Indexing in mysql? How many types of indexing in mysql?
  • Ans. 

    Indexing in MySQL improves query performance. There are several types of indexing in MySQL.

    • Indexes are used to quickly locate data without scanning the entire table.

    • Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.

    • B-tree indexes are the most common and suitable for most use cases.

    • Hash indexes are used for exact match lookups.

    • Full-text indexes are used for searching text-based data efficie...

  • Answered by AI
  • Q8. Engines in mysql?
  • Ans. 

    Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.

    • MySQL supports multiple storage engines, each with its own strengths and features.

    • Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.

    • InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.

    • MyISAM is known for its simplicity and speed but lacks transaction suppo...

  • Answered by AI
  • Q9. Singlton pattern?
  • Q10. Can a constructor be private?
  • Ans. 

    Yes, a constructor can be private.

    • A private constructor can only be accessed within the class itself.

    • It is often used in singleton design pattern to restrict object creation.

    • Private constructors are also useful for utility classes that only contain static methods.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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 resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The task is to find the length of the longest common subsequence between two given strings.

    • Implement a function to find the longest common subsequence between two strings.

    • Use dynamic programming to solve this problem efficiently.

    • Iterate through the strings and build a matrix to store the lengths of common subsequences.

    • Return the length of the longest common subsequence found.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper. 
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

  • Q1. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

  • Ans. 

    Add two numbers represented as linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Create a new linked list to store the sum, updating the value and carry as needed

    • Handle cases where one linked list is longer than the other by adding remaining digits with carry

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Use a queue to keep track of nodes to visit next in BFS traversal

    • Start traversal from vertex 0 and explore its neighbors first

    • Continue exploring neighbors level by level until all nodes are visited

    • Ensure to print connected nodes in numerical sort order

  • Answered by AI
  • Q2. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Ans. 

    DFS traversal to find connected components in an undirected and disconnected graph.

    • Perform DFS traversal on each vertex to find connected components

    • Maintain a visited array to keep track of visited vertices

    • Print the vertices of each connected component in ascending order

  • Answered by AI
  • Q3. 

    Dijkstra's Shortest Path Problem

    Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.

    • Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Update the distances of neighboring nodes based on the current node's distance and edge weight...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA, Eligible branches : Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering.Myntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Myntra user image Thommandru Vishnu

posted on 10 Mar 2015

Interview Questionnaire 

9 Questions

  • Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
  • Ans. 

    Print only the leaf nodes of a doubly linked tree.

    • Traverse the tree and check if a node has no children and both left and right pointers are null.

    • If yes, then it is a leaf node and print it.

    • If no, then continue traversing the tree.

    • Use recursion to traverse the tree in a depth-first manner.

  • Answered by AI
  • Q2. LRU page Replacement Algorithm for large data
  • Ans. 

    LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.

    • LRU stands for Least Recently Used

    • It is a cache eviction algorithm

    • It is used to manage memory in operating systems

    • It works by keeping track of the pages that are used recently and the ones that are not

    • When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time

  • Answered by AI
  • Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
  • Ans. 

    Reverse m nodes and leave n nodes in a linked list till the end.

    • Traverse the linked list till m nodes and reverse them

    • Traverse n nodes and continue reversing m nodes

    • Repeat the above step till the end of the linked list

    • Handle edge cases like m or n being greater than the length of the linked list

  • Answered by AI
  • Q4. Inorder Traversal of a tree
  • Ans. 

    Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.

    • Start at the root node

    • Traverse the left subtree recursively

    • Visit the root node

    • Traverse the right subtree recursively

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q5. Inorder Travesal of a tree without recursion(write the code)
  • Ans. 

    Inorder traversal of a tree without recursion

    • Create an empty stack and initialize current node as root

    • Push the current node to stack and set current = current.left until current is NULL

    • If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right

    • Repeat step 2 and 3 until stack is empty

  • Answered by AI
  • Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
  • Ans. 

    Find the triplicate number in an array of duplicates.

    • Iterate through the array and keep track of the frequency of each number.

    • Return the number that appears three times.

    • If no number appears three times, return null.

  • Answered by AI
  • Q7. Explain all the serach algorithm you know with space and Time complexities
  • Ans. 

    Explanation of search algorithms with their space and time complexities.

    • Linear Search - O(n) time complexity, O(1) space complexity

    • Binary Search - O(log n) time complexity, O(1) space complexity

    • Jump Search - O(√n) time complexity, O(1) space complexity

    • Interpolation Search - O(log log n) time complexity, O(1) space complexity

    • Exponential Search - O(log n) time complexity, O(1) space complexity

    • Fibonacci Search - O(log n)

  • Answered by AI
  • Q8. Given a situation and asks you which search algorithm suits the best in that situation
  • Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
  • Ans. 

    Find the most repeated number in an array of length n with numbers 1-n.

    • Create a dictionary to store the count of each number in the array

    • Iterate through the array and update the count in the dictionary

    • Find the key with the highest count in the dictionary

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist

Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7

Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules

Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)

General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE

Skills evaluated in this interview

Interview Questionnaire 

10 Questions

  • Q1. Change Binary tree so that parent node is the sum of root nodes
  • Ans. 

    Change binary tree to make parent node the sum of root nodes

    • Traverse the tree in post-order

    • For each node, update its value to the sum of its children

    • Return the updated root node

  • Answered by AI
  • Q2. Reverse a linkedlist ?
  • Ans. 

    Reverse a linkedlist by changing the direction of pointers.

    • Iterate through the linkedlist and change the direction of pointers.

    • Keep track of previous, current and next nodes.

    • Set the next pointer of current node to previous node.

    • Move to next node and repeat until end of list is reached.

  • Answered by AI
  • Q3. Given an array of +ve and -ve numbers , have to rearrange them ( like +ve numbers to left and -ve numbers to right of the array)
  • Ans. 

    Rearrange an array of positive and negative numbers with positive numbers on the left and negative numbers on the right.

    • Create two empty arrays, one for positive numbers and one for negative numbers

    • Loop through the original array and add positive numbers to the positive array and negative numbers to the negative array

    • Concatenate the positive and negative arrays to create the rearranged array

  • Answered by AI
  • Q4. Singleton pattern, observer pattern?
  • Q5. String pool and how garbage collection functionality works?
  • Ans. 

    String pool is a cache of string literals in memory. Garbage collection frees up memory by removing unused objects.

    • String pool is a cache of string literals in memory

    • Strings are immutable and can be shared among multiple objects

    • Garbage collection removes unused objects to free up memory

    • String objects that are no longer referenced are eligible for garbage collection

  • Answered by AI
  • Q6. HashMap , how can you synchronize ?
  • Q7. Process vs Thread differences and synchronization,deadlock examples?
  • Ans. 

    Process vs Thread differences and synchronization, deadlock examples

    • Process is an instance of a program while thread is a subset of a process

    • Processes are independent while threads share the same memory space

    • Synchronization is used to coordinate access to shared resources

    • Deadlock occurs when two or more threads are blocked waiting for each other to release resources

    • Examples of synchronization include mutex, semaphore, ...

  • Answered by AI
  • Q8. Database: Design with one-one mapping, one-many mapping…some basic questions, I don’t remember all
  • Q9. Design a website where after user request. A bunch of processes need to be executed and then a mail is sent to user with the result. Take care of scalability etc?
  • Q10. CTO round

Interview Preparation Tips

Round: HR Interview
Experience: This was CTO round, if you make this round…you are doing pretty good. 
He asked a lot on what I worked on and asked questions relevant to that. Process thread, stacks heaps. A minor system design on component in their system. How they are shared between and trade-off. We discussed about scalability and challenge.

General Tips: Process:5 technical ( 3 rounds+ SVP round + CTO round ) + 1 HR
I got almost the same package that I am currently getting (Myntra gave stock options, which I don’t have in my current company) but I am looking for a change so accepted the offer.
Skills: Algorithm, data structure, database
College Name: na

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

The Entire Test is held in HackerRank Platform. It has: 
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts

  • Q1. 

    Binary Tree to Doubly Linked List

    Transform a given Binary Tree into a Doubly Linked List.

    Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.

    Input:

    The fi...
  • Ans. 

    Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.

    • Perform Inorder Traversal of the Binary Tree to get the nodes in order.

    • Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.

    • Return the head of the Doubly Linked List as the output.

  • Answered by AI
  • Q2. 

    Unique Element in Array

    Given an arbitrary array arr consisting of N non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...

  • Ans. 

    Find the unique element in an array where every other element appears thrice.

    • Use XOR operation to find the unique element.

    • Iterate through the array and XOR each element to find the unique one.

    • Return the unique element as the answer.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it. 
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Parse the input level-order tree elements to construct the binary tree.

    • Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.

    • Return the traversals as lists of lists for each test case.

  • Answered by AI
  • Q2. 

    Delete N Nodes After M Nodes in a Linked List

    Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...

  • Ans. 

    Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.

    • Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.

    • Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.

    • Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.

    • Repeat this process until the end of the lin...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked to put everything on the blackboard and write down the code of each and everything.

Question : Explain all the search algorithm you know with space and Time complexities. 
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1). 
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half. 
Steps : 
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half. 
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.

  • Q1. 

    Maximum Frequency Number Problem Statement

    Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

    If multip...

  • Ans. 

    Program to find the number with maximum frequency in an array of integers.

    • Create a dictionary to store the frequency of each number in the array.

    • Iterate through the array and update the frequency count in the dictionary.

    • Find the number with the maximum frequency in the dictionary and return it.

    • If multiple elements have the same maximum frequency, return the one with the lowest index.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMyntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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 resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C.

  • Q1. 

    Rabbit Jumping Problem

    Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...

  • Ans. 

    Calculate uneaten carrots by rabbits with specific jumping factors.

    • Iterate through each carrot and check if any rabbit jumps on it.

    • Use the jumping factors to determine which carrots are eaten.

    • Subtract the eaten carrots from the total to get the uneaten count.

  • Answered by AI
  • Q2. 

    Flip Bits Problem Explanation

    Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...

  • Ans. 

    Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.

    • Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

    • Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.

    • Update the maximum count of 1s if the current count after flipping is greater.

    • Return the maximum count of 1s obtained by flipping a sub-array

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Started with a brief discussion on my projects and internships. A thorough discussion on whichever languages, frameworks I had used in my projects. Followed by discussion on coding questions. Apart from the codes there were some questions on OS, process stack, heap memory in Java, Garbage collection, OOP principles and comparison based sorting

  • Q1. 

    Sum of Maximum and Minimum Elements Problem Statement

    Given an array ARR of size N, your objective is to determine the sum of the largest and smallest elements within the array.

    Follow Up:

    Can you achie...

  • Ans. 

    Find sum of maximum and minimum elements in an array with least number of comparisons.

    • Iterate through the array and compare each element with current maximum and minimum to update them.

    • Initialize max as smallest possible value and min as largest possible value.

    • Return the sum of max and min after iterating through the array.

  • Answered by AI
  • Q2. 

    Invert a Binary Tree Problem Statement

    Given a Binary Tree and one of its leaf nodes, invert the binary tree by following these guidelines:

    • The given leaf node becomes the root after the inversion. • F...
  • Ans. 

    Invert a binary tree based on a given leaf node as the root.

    • Start by finding the leaf node in the binary tree.

    • Move the left child of the leaf node to the right side of the leaf node.

    • Make the parent of the leaf node the left child of the leaf node.

    • Repeat the process for each test case.

    • Return the inverted binary tree in level order format.

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Questions based on programming, DBMS and puzzles were asked in this round.

  • Q1. 

    Rearrange Array to Form Largest Number

    Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.

    ...

  • Ans. 

    Rearrange the array elements to form the largest possible number by concatenating them.

    • Sort the array elements in a custom way where the concatenation of two numbers results in a larger number.

    • Use a custom comparator function while sorting the array elements.

    • Convert the sorted array elements to a single string to get the largest possible number.

  • Answered by AI
  • Q2. What is indexing in the context of databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

    • They work similar to the index in a book, allowing the database to quickly find the relevant data without having to scan the entire table.

    • Examples of indexes include ...

  • Answered by AI
  • Q3. What are the advantages of B+ Trees in database management systems?
  • Ans. 

    B+ Trees are advantageous in database management systems due to their ability to efficiently store and retrieve data.

    • B+ Trees have a high fanout, allowing for more keys to be stored in each node, reducing the height of the tree and improving search performance.

    • B+ Trees are balanced trees, ensuring that operations like search, insertion, and deletion have a predictable time complexity of O(log n).

    • B+ Trees are optimized ...

  • Answered by AI
Round 4 - Video Call 

Round duration - 45 minutes
Round difficulty - Medium

Puzzles and HR based questions were asked in this round.
He asked questions like : what are my career goals, what do you look forward to in a boss , how do you see yourself in 5 years ,etc etc .

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMyntra interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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 resume tips for other job seekers

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

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Jan 2016.

Interview Preparation Tips

College Name: Thapar University, Patiala

eBay Interview FAQs

How many rounds are there in eBay Software Developer interview?
eBay interview process usually has 1 rounds. The most common rounds in the eBay interview process are HR.
What are the top questions asked in eBay Software Developer interview?

Some of the top questions asked at the eBay Software Developer interview -

  1. Let’s say you have 100,000 records and you want to delete 95,000 at a time an...read more
  2. There are three threads have been assigned different work. Say, T1 takes 10 sec...read more
  3. Let us assume there are 3 baskets with different number of balls say p,q and r....read more

Tell us how to improve this page.

eBay Software Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

eBay Software Developer Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Assistant Manager
28 salaries
unlock blur

₹5 L/yr - ₹11 L/yr

Key Account Manager
27 salaries
unlock blur

₹5 L/yr - ₹9.9 L/yr

Senior Business Analyst
23 salaries
unlock blur

₹13.2 L/yr - ₹29 L/yr

Associate Category Manager
13 salaries
unlock blur

₹9 L/yr - ₹27 L/yr

Business Analyst
11 salaries
unlock blur

₹9.7 L/yr - ₹17 L/yr

Explore more salaries
Compare eBay with

Amazon

4.1
Compare

Etsy

4.2
Compare

Flipkart

3.9
Compare

Google

4.4
Compare
Did you find this page helpful?
Yes No
write
Share an Interview