Latest Questions | Page 8

FindMaximumWeights
Amazon's fulfillment centers handle packages of various weights, and they need to optimize their sorting process.
Given an array weight that denotes the weights of n packages, the goal is to create the lexicographically maximal resulting array sorted in non-increasing order using the following operations:
1. Discard the first package from the current weight array.
2. A dd the first element to the resulting array, then remove it along with the next k (a fixed constant) elements from the current array.
Operation 2 can also be applied when fewer than k elements remain after the current element; in that case, the entire remaining array is removed.

The resulting array must have packages arranged in non-increasing weight order.
Given an array weight of size n and an integer k, find the lexicographically maximal resulting array sorted by non-increasing order of weight that can be obtained. Show More

GetMaxThroughput

The developers at Amazon are working on optimizing database query times. There are n host servers, where the throughput of the i-th host server is given by host_throughput[i].
These servers are grouped into clusters of size three. The throughput of a cluster, denoted as cluster_throughput, is defined as the median of the three servers’ throughput values. Each host server can be part of at most one cluster, and some servers may remain unused.

The total system throughput, called system_throughput, is the sum of the throughputs of all the clusters formed. The task is to find the maximum possible system throughput.

Note:
The median of a cluster of three host servers is the 2nd highest throughput when the three values are sorted in ascending or descending order.

Example:
Input:
n = 5
host_throughput = [2, 3, 4, 3, 4]

Output:
The maximum number of clusters that can be formed is 1, and two host servers will remain unused. Show More

Given a String and an Array
Your solution will be scored against multiple hidden test cases, with a sample case provided for reference.
The default code includes a mechanism for reading input strings. You will need to parse these strings into the appropriate variables as needed.
The output data type does not matter, as long as the characters in the output match the expected result.
Task:
Give n a long string S and an array of smaller strings T, write a program to check if each string in T exists within S.
When checking, ignore differences in uppercase and lowercase letters.
Example:
If S is "Coffeeshop" and T is "hot coffee", then:
S does not contain "hot".
S does contain "coffee". Show More

Format a String
Your solution will be scored against multiple hidden test cases, with a sample case provided for your reference.
The default code includes a mechanism for reading input strings. You will need to parse these strings into the appropriate variables as needed.
The output data type is not a concern, as long as the characters within the output match the expected outcome.

Task:
Giv en a string such as "THIS_IS_A_TEST" containing underscores and uppercase characters, write a program to format it into a more human-friendly, readable format.
Convert the underscores to spaces.
Change the first letter of each word to uppercase.
Input:
The input consists of a string that may contain letters, underscores, and spaces.
Output:
Print the formatted string after converting underscores to spaces and capitalizing the first letter of each word.

Sample Input:
THIS_IS A_TEST
Sample Output:
This Is A Test Show More

CPU scheduling algorithms are used to efficiently manage the execution of processes. A core can handle one process at a time, but CPUs often have multiple cores. Given n processes, where ith process starts at start i and finishes at end i, both inclusive, determining the minimum number of cores needed to handle all the processes.

In an e-commerce product search system, users input queries to search for items. You are given an array products of length n representing the product names and an array queries of length q containing search query strings.
Implement a function that, for each query string, returns all products that are anagrams of the query string. An anagram is any string that can be formed by rearranging the le tters of another string.

The function getProductMatches takes the following inputs:
string products[n]: the list of all available product names
string queries[q]: the list of search query strings

The function should return a list of products for each query that are anagrams of the query string, sorted alphabetically.
Example
Input:
n = 4
products = ["duel", "speed", "dule", "cars"]
q = 2
queries = ["spede", "deul"]
Output:
["speed"]
["duel", "dule"]

Explanation:
For queries[0] = "spede", the only anagram of "spede" is "speed", so the answer for this query is ["speed"].
For queries[1] = "deul", the anagrams in the product list are "duel" and "dule", so the answer for this query is ["duel", "dule"].
The function getProductMatches should return a list of lists, where each inner list contains the matching anagram products for a given query, sorted alphabetically. Show More

getQueryAnswers
In a machine learning model, there are n data entries stored in the model's output cache cacheEntries. Each entry contains three values:
1. timestamp – when the prediction was made.
2. modelId – the identifier of the machine learning model.
3. predictionValue – the model's output, represented as a string containing an integer.

A query handler receives q queries in th e form of queries[q][2], where each query consists of:
- modelId – identifying the machine learning model.
- timestamp – specifying the time at which the prediction was made.

Implement a function getQueryAnswers that:
- Takes two inputs:
- cacheEntries[n][3]: A list of cached predictions.
- queries[q][2]: A list of queries.
- Returns an array of integers, where each value corresponds to the predictionValue for the given modelId and timestamp. Show More

A company needs an efficient strategy to optimize resource allocation for servers based on performance metrics. The performance of each server is represented by performance[i], where 0 ≤ i < n. A server's rank is defined by the count of distinct performance metrics that are greater than or equal to its own performance metric.
To allocate resources, two positive integer constants, inc and dec, are used to determine increment and decrement values, respectively. The resource allocation for each server is calculated as follows:
resource allocation = inc × (n + 1 - server's rank) - dec × rank
The task is to calculate the resource allocation for each server based on their performance.

Example:
inc = 500
dec = 100
n = 6
performance = [3, 2, 4, 3, 5, 5]
Server index 0 has a rank of 3 since 3, 4, and 5 are greater than or equal to its performance of 3. The resource allocation is calculated as:
500 × (6 + 1 - 3) - 100 × 2 = 1800 Show More

FunWithAnagrams
Two strings are anagrams if they are permutations of each other. In other words, both strings have the
same size and the same characters. For example, "aaagmnrs" is an anagram of "anagrams". Given a
array of strings, remove each string that is an anagram of an earlier string then return the remaining array in sorted order.

Example
str = ['code', 'doce', 'ecod', 'framer', 'f rame']
- "code" and "doce" are anagrams. Remove "doce" from the array and keep the first occurrence "code" in the array.
- "code"and "ecod" are anagrams. Remove "ecod" from the array and keep the first occurrence "code'
in the array.
- "code" and "framer" are not anagrams. Keep both strings in the array.
- "framer" and "frame" are not anagrams due to theextra 'r'in 'framer'. Keep both strings in the array.
· Order the remaining strings in ascending order: [ "code","frame", "framer"].

Function Description
Complete the function funWithAnagrams in the editor below.
funWithAnagrams has the following parameters: Show More

Take it apart

Given an array A of length N, Alex and Bob have decided to play a game called "Take it apart." At the beginning of the game, players pick a side of the array, either the start (S) or the end (E), and it's fixed for the rest of the game. Then, they start playing in turns. Alex goes first. They pick a number from their side and remove the number from the array. This number is cons idered collected by the respective player.

Task
Your task is to calculate the minimum absolute difference between the sum of collected numbers by Alex and Bob.

Function description
Complete the function solve provided in the editor. This function takes the following two parameters and returns the required answer:
- N: Represents the size of the array A.
- A: Represents the numbers in the array A.

Input format
Note: This is the input format that you must use to provide custom input.
- The first line contains T, denoting the number of test cases. T also specifies the number of times you have to run the solve function on a different set of inputs. Show More