Latest Questions | Page 13

A subarray is any contiguous block of an array's elements. Given an array of integers, find the sum
of all elements of all subarrays of that array.

Example
For example, a three element array [4, 5, 6] can be made into the following subarrays:
1 element subarrays: [4], [5], [6]
2 element subarrays: [4,5], [5,6]
3 element subarrays: [4, 5, 6]

The sum of all subarrays is 4 + 5 + 6 + (4+5) + (5+6)
+(4+5+6)=50.

Function Description

subarraySum has the following parameter(s):
int arr[n]: an array of integers to process

Returns:
int: an integer representing the sum of all subarrays of the given array

Constraints

- 1 <= n <= 2× 105
- 1<=arr[i] ≤ 10^3, where 0 ≤ 7< n Show More

Students in a class are asked to stand in ascending order according to their heights for the annual
class photograph. Determine the number of students not currentlylstanding in their correct
positions.

Example
height = [1, 1, 3, 3, 4, 1]

The 3 students indicated in red at indices 2, 4 and 5, are not in the right positions. The correct
positions are [1, 1, 1, 3, 3, 4]. Return 3.

Functi on Description
Complete the function countStudents in the editor below.

countStudents has the following parameter(s): int height[n]: an array of heights in the order the
students are standing

Returns:
int: the number of students not standing in the correct positions.

Constraints
· 1≤n≤ 105 Show More

Amazon Prime Games is designing a game. The player needs to pass n rounds sequentially in this
game. Rules of play are as follows:

- The player loses power[i] health to complete round
- The player's health must be greater than 0 at all times.
- The player can choose to use armor in any one round. The armor will prevent damage of min(armor, power[il).
Determine the minimum starting health fo r a player to win the game.
Example
power = [1, 2, 6, 7]
armor = 5

Give the player 12 units of health at the beginning of the game. One of the optimal strategies is to use the armor in the third round and only lose 1 unit instead of 6. The health of the player after each
round is:

Round, health

0. 12
1. 12 - power[0] =12-1=11
2. 11 - power[1] = 11 -2 =9
3.9 - power[2] + armor=9-6+5=8
4. 8 - power[3] =8-7=1

No lower starting health will allow a win.

Function Description
Complete the function getMinimumValue in the editor below. Show More

Oldest Book per Genre

You have been provided with two tables, library_books and book_genres, containing information about books and their corresponding genres.

Write an SQL query to find the oldest book (based on publication_year) in each genre. If there are multiple books with the same publication year in a genre, return the one that appears first alphabetically by title.

Table descripti on
Input format

Table: library_books
book_id, int, Represents the unique ID of the book
book_title, string, Represents the title of the book
genre_ld, int, Represents the ID of the genre of the book Show More

Winner Winner

Alice and Bob are playing a game to decide who is better. They both play alternatively. Alice starts first. The subjects and the books are read sequentially.
The rules of the game are as follows:
- Both of them have N subjects.
- Let array S denote the number of books in each subject.
- Let array P denote the points for completing a book in a particular subject.
- All books o n one subject have the same points.
In one move, a player has to complete the following steps:
- They can skip all books of a subject if they want. They can keep skipping books till they want. Skip here means that the books of the subject become unavailable to read for both of them. As a result, the whole subject becomes unavailable. The player has the choice to skip subjects as
long as he wants without losing his turn.
- They read one book on a subject if it is available. On reading the book, the points of that person increase by P[i] where P[i] is the points for completing the book. So the number of books on that particular subject decreases by one. Note that he can read only one book in this step. The chance immediately goes to the other person just after he reads. If no book is available, the game ends.
The other person continues with the remaining subjects and the remaining books. The game goes on
alternatively until no book is available to read. Show More

Watering plants

Imagine you are a park ranger responsible for maintaining N plants along a hiking trail. The plants are arranged in a straight line and numbered from 0 to N - 1: with the ith plant located at x = i. You have a water source at x = -1, which you must use to refill your watering can.

Each plant requires a different amount of water and you must water them in order, from left to r ight. If you run out of water while watering a plant, you must return to the water source to refill your watering can before continuing to the next plant. You cannot refill your watering can before it is empty or it
cannot water the next plant, and it takes one step to move one unit on the x-axis.
Determine the number of steps you must take to water all of the plants along the hiking trail successfully.
Notes
- You start at -1.
- The location of the plants starts from O.

Function description
Complete the function solution() provided in the editor. The function takes the following 3 parameters and returns the solution:

- N. Represents the number of plants
- C : Represents the capacity of the water can
- plants : Represents the water requirements of the plant

Input format for custom testing
Note: Use this Input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code
-The first line contains N denoting the number of plants.
-The second line contains C denoting the capacity of the can Show More

Profits

John is a shopkeeper. He can buy N items from the producer, the ith of which costs cost[i]. He can sell the it item at sell[i]. Initially, he has K dollars and O items in his shop. At any moment, his store can accommodate at most 1 item, which means he has to sell the previous item before buying the
next one from the producer.
What is the maximum profit he can achieve?

Notes
- He can buy and sell any number of items.
- He can use the profit previously earned to buy new items.
- One item can be bought and sold at most once.
- Items can be bought and sold in any order and not necessarily in the order given as input.

Function description following 4 parameters and returns the solution:
- N: Represents the number of items
- K: Represents the initial amount
- cost: Represents the cost price of items
- sell. Represents the selling price of items

Input format for custom testing
Note: Use this input format if you are testing against custom
input or writing code in a language where we don't provide
boilerplate code
- The first line contains N. denoting the number of items.
- The second line contains K, denoting the initial amount.
- The third line contains cost, denoting the cost price of items
- The fourth line contains sell, denoting the selling price of items

Output format
Print an integer representing the maximum total profit. Show More

Balanced mixture

Given A number of powerful resources and B number of weak resources. You have to select a balanced mixture of these resources. A balanced mixture has C resources containing no less than 4 powerful resources and no less than one weak resource. You are given integers A, B, and C. Each powerful and weak
resource is unique in itself. Hence, two mixtures with the same number of pow erful and weak resources are considered different if at least one of the resources is different in the 2 mixtures. Print the number of ways of selecting a balanced mixture
with the given number of resources.
Function description
Complete the function Balanced(). This function takes the following 3 parameters and returns the required answer:
- A: Represents the number of powerful resources
- B: Represents the number of weak resources
- C. Represents the number of resources in a balanced mixture

Input format for custom testing
Note: Use this input format if you are testing against custom
input or writing code in a language where we don't provide
boilerplate code
- The first line contains an integer A denoting the number of powerful resources.
- The second line contains an integer B denoting the number of weak resources
- The third line contains an integer C denoting the number of resources in a balanced mixture Show More

Software developers at Amazon are developing a new library for Natural Language Processing. In one of its
modules, every string needs to be preprocessed in a particular manner to find the length of its longest self-sufficient
proper substring
A self-sufficient proper substring is one where
1. the substring is not the entire string s
2.no letter that occurs inside the substring also occurs out side the substring

Given the string fullString of length n, find the length of its longest self-sufficient proper substring. If none exists,
return 0.
Example
fullString = "amazonservices"

Here The length fullString, n = 14. Show More