AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
eBay Interview Questions and Answers for Freshers
eBay Interview Experiences for Freshers
2 interviews found
Anonymous
(2 Questions)
- Q1. About your self intro
- Q2. About role explain role
Interview Preparation Tips
Experience: There were around 10 MCQ questions and 3 coding questions. Quantitative ability was tested in MCQs and programming and algorithmic skills were tested in coding questions.
Tips: Don’t try to over-optimize your algorithms if time doesn’t permit. First write a pretty decent algorithm. You will get through the written test. After that, try to optimize your algorithm only if time permits.
Total Questions: 13
Round: Technical Interview
Experience: Questions on basic data structures of Computer Science. Basic tree algorithms with coding. Some analytical questions.
Tips: In all the interviews, try to be as confident as possible. Sometimes they will just see your confidence and they will take you through that round. So be confident and be happy.
Skill Tips: CGPA > 7.5, decent algorithmic skills and coding skills, good analytical skills. No computer science in-depth knowledge is required. They didn’t consider any extra-academic involvement. Maths ability such as probability was required. Quantitative ability was required in Written Test. Proficiency with any programming language was enough. You should be able to explain your BTP project in full details. For internship, apart from project related technical knowledge, you should have an idea of the business relevance of the project. Try to prepare with people giving CAT. This will help enormously.
Skills: Coding
College Name: IIT KHARAGPUR
Software Engineer Interview Questions asked at other Companies
Interview questions from similar companies
I applied via Naukri.com and was interviewed before Mar 2021. There were 3 interview rounds.
Online aptitude test with general aptitude questions.
(1 Question)
- Q1. Basic js, ES6 features, Angular Questions, Node.js Lifecycle, event loop, mongodb questions, some HR questions
Interview Preparation Tips
Interview Questionnaire
1 Question
- Q1. They asked 3 Coding questions and 5 MCQ all of them were very simple. One was related to fibbonaci. Another one was like there was 2d array and at i,j sum till row i and sum till j was given and all the el...
Interview Preparation Tips
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
- Ans.
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
- Q2.
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...
- Ans.
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
- Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
- Ans.
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Interview Preparation Tips
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Skills evaluated in this interview
I appeared for an interview before May 2021.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Find the k-th Node from the End of a Linked List
Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...
- Ans.
To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.
Iterate through the linked list to determine its size.
Calculate the position of the k-th node from the end based on the size of the list.
Traverse the list again to reach the k-th node from the end.
Return a pointer to the k-th node from the end.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
High level System Design
- Q1. Can you design a system like Uber, explaining the various components and architecture involved?
- Ans.
Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.
User app for booking rides and tracking
Driver app for accepting rides and navigation
Server for handling requests and communication between apps
Database for storing user, driver, and ride information
Algorithms for matching riders with drivers and routing
Round duration - 45 minutes
Round difficulty - Easy
Basic HR questions
Interview Preparation Tips
Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation
Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack
Skills evaluated in this interview
Aditya Sundaram
Interview Preparation Tips
Experience: First round was a simple round which involved 10 multiple choice questions and 3 coding questions on hackerrank platform.
Round: Technical Interview
Experience: Mainly on topics like networks, data structures and algorithms, operating systems. The interviewers looked for people who have had prior experience in web development and asked questions regarding web development in depth too.
Tips: I recommend everyone to read the book titled, 'Cracking the Coding Interview' as it was helpful in my approach to an interview.
General Tips: The one major thing that would give you the edge in joining Myntra would definitely be exposure to web development. Since it is not a part of the curriculum , it's all the more important for you to familiarize yourself with web development. In fact, a few projects in the same field would put you in a very advantageous position to get the job.
Skill Tips: 1. Start your placement preparations well ahead, no point regretting later.
2. Keep a concise resume. Do not take your resume to several pages.
3. Do not neglect aptitude preparation. Many people do this mistake and end up not clearing the first round for several companies.
4. Be thorough with your basics across all subjects. (Do not neglect any subject, even they you may like a few and dislike the others.)
5. Keep in mind, the interviewers are really friendly and try to make sure that you're not nervous during the interview. All they want to do is to test you. Be confident and give it your best shot.
Skills:
College Name: NIT Surathkal
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.
- 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
- 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.
- 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
- 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...
- 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...
- 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...
- 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.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Interview Questionnaire
4 Questions
- Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
- Ans.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
- Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
- Ans.
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
- Q3. Design question
- Q4. Find friends of friend who already are not friends with you
- Ans.
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
Interview Preparation Tips
Experience: It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Tips: Just walk the interviewer through the solution you're proposing.
Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.
Round: Other Interview
Experience: This was bar-raiser round.
Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras
Skills evaluated in this interview
I appeared for an interview before Apr 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
- Q1.
Kth Largest Element Problem Statement
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Example:
Input:
Array: [2,1,5,6,3,8], K ... - Ans.
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order
Return the Kth element from the sorted array
Handle multiple test cases
- Q2.
Orange Rotting Problem Statement
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
- Value 0: Represents an empty cell.
- Value 1: Represents a fresh orang...
- Ans.
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find the initial rotten oranges and add them to the queue.
Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.
Continue until the queue is empty, ke...
Round duration - 45 minutes
Round difficulty - Easy
This was a design round.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
eBay Interview FAQs
Some of the top questions asked at the eBay interview for freshers -
Tell us how to improve this page.
eBay Interviews By Designations
- eBay Software Engineer Interview Questions
- eBay Software Developer Interview Questions
- eBay Senior Business Analyst Interview Questions
- eBay Quality Inspector Interview Questions
- eBay Product Manager Interview Questions
- eBay Mts Software Engineer Interview Questions
- eBay Financial Analyst Interview Questions
- eBay Senior Java Developer Interview Questions
- Show more
Interview Questions for Popular Designations
Interview Questions from Similar Companies
Fast track your campus placements
|
Assistant Manager
28
salaries
|  ₹5 L/yr - ₹11 L/yr |
|
Key Account Manager
27
salaries
| ₹5 L/yr - ₹9.9 L/yr |
|
Senior Business Analyst
23
salaries
| ₹13.2 L/yr - ₹29 L/yr |
|
Associate Category Manager
13
salaries
| ₹9 L/yr - ₹27 L/yr |
|
Business Analyst
11
salaries
| ₹9.7 L/yr - ₹17 L/yr |
Amazon
Etsy
Flipkart
- Home >
- Interviews >
- eBay Interview Questions >
- eBay Interview Questions for Fresher
