As a globally renowned e-commerce giant. eBay (web auction company)In this article, I will share some classic questions in eBay OA interviews and provide comprehensive and practical strategies to help you stand out in this job-hunting competition.
eBay OA - Coding 1
Given an integer array videoChunks with a length of n, and an integer k, the requirement is to divide the array into k consecutive sub-arrays so that the total cost of all sub-arrays is minimized.
The cost of each sub-array is defined as: the first element of the sub-array + the last element of the sub-array.
Example
InputvideoChunks = [7, 8, 3, 9, 6]k = 2
One optimal division method[7, 8], [3, 9, 6]
Cost calculation(7 + 8) + (3 + 6) = 15 + 9 = 24
eBay OA - Coding 2
Maximizing the "Greatness" of an Array
Given a 0-indexed integer array nums, you can rearrange nums into a new array perm (the way of permutation is up to you).
We define the "greatness" of nums as the number of indices that satisfy the following conditions.
0 <= i < nums.length and perm[i] > nums[i]
Please return the maximum achievable "greatness."
Example.
Input: nums = [1,3,5,2,1,3,1]
Output: 4
Explanation:
One optimal permutation is perm = [2,5,1,3,3,1,1].
For indices 0, 1, 3, 4, perm[i] > nums[i], so we return 4.
eBay OA - Coding 3
There are N jars, some of which contain chocolates, and some may be empty. Find the maximum number of chocolates that Andrew can obtain, with the condition Find the maximum number of chocolates that Andrew can obtain, with the condition that he cannot take chocolates from adjacent jars.
Write an algorithm to calculate the maximum number of chocolates that Andrew can get without taking chocolates from adjacent jars.
Example.
Input:
6
5 30 99 60 5 10Output:
114Explanation:
Andrew can take chocolates from jars 1, 3, and 5 (5 + 99 + 10 = 114).
Crack eBay OA with Programehelp
Struggling with eBay's Software Engineer Internship OA? Programehelp has solutions. We offer assignment writing, interview coaching, online support, and proxy services. Our dedicated team ensures direct communication and full satisfaction. Don't let OA challenges stop you. Our dedicated team ensures direct communication and full satisfaction. Contact us now for a shot at acing your eBay application!
