After all the servers are down, the developers must send one more request to conclude the failure of the application.

The developers at Amazon want to perform a reliability drill on some servers. There are n servers where the i-th server can serve request[i] number of requests and has an initial health of health[i] units.

Each second, the developers send the maximum possible number of re quests that can be served by all the available servers. With the request, the developers can also send a virus to one of the servers that can decrease the health of a particular server by k units. The developers can choose the server where the virus should be sent. A server goes down when its health is less than or equal to 0.

Find the minimum total number of requests that the developers must use to bring all the servers down.

Example
Consider n = 2, request = [3, 4], health = [4, 6], k = 3.

The minimum number of requests required is 21.

| No. of Requests | Virus Server | Server’s New Health | Total Requests |
|----------------|--------------|----------------------|----------------|
| 3 + 4 = 7 | 1 | 6 - 3 = 3 | 7 |
| 3 + 4 = 7 | 1 | 3 - 3 = 0 (server 1 dies) | 14 |
| 3 | 0 | 4 - 3 = 1 | 17 |
| 1 | 0 | 1 - 3 = -2 (server 0 dies) | 18 |
| - | - | - (conclude the failure) | 21 | Show More

A service maintains a database with three string columns:

Column Name | Description
------------|------------
user_id | The user ID of the user who created the URL
short_url | The shortened URL
actual_url | The actual URL to redirect to

There are m users with ids from 0 to m - 1 and q requests for the short URLs. For each request i, report the actual URL and the number of reque sts processed for the user who created the short URL till the i-th request.

Given an array of n strings, database, where the i-th row is represented by the string database[i] in the format "<user_id> <short_url> <actual_url>", and q queries represented by the array of strings, queries, for each requested short URL, report an array of strings of length 2 with the actual URL and the number of times a request is made using a short URL created by a particular user.

Example
Suppose there are m = 3 users, database = ["0 sdsf www.google.com", "1 juytf www.google.com", "0 opoit www.kaggle.com"], and requests = ["juytf", "sdsf", "opoit"].

Short URL | Actual URL | Created By | Count for User
-----------|------------|------------|---------------
juytf | www.google.com | 1 | 1
sdsf | www.google.com | 0 | 1
opoit | www.kaggle.com | 0 | 2 Show More

Given a string, how many different substrings exist in it that have no repeating characters? Two substrings are considered different if they have a different start or end index.
Example
s = "abac"
The substrings that have no repeating characters in them are "a", "b", "a", "c", "ab", "ba", "ac", and "bac". Note that "aba" and "abac" do not qualify because the character 'a' is repeated in t hem. Also, note that two substrings, "a" and "a", both qualify because their start indices are different: s[0] and s[2]. There are 8 substrings that have no repeating characters.

Function Description
Complete the function findSubstrings in the editor below.
findSubstrings has the following parameter:
string s: the given string
Returns
int: the number of substrings in s that have no repeating characters

Constraints
1 ≤ length of s ≤ 10⁵
s consists of only lowercase English letters, ascii['a'-'z'].
Input Format For Custom Testing
Sample Case 0
Sample Input For Custom Testing
bcada Show More

Network Park - Maximum Noiseless Networks

A network company wants to establish a network park to reduce the noise of different network operators. In network park, different operators will setup up their sender antenna, or receiver antenna, or both. The sender antenna and receiver antenna are represented by two list of size N and M respectively. These antennas will only receive/send to their r espective sender/receiver antenna, but doing this process will retain some noise. Noise is a result of a crossed signal i.e., a signal in which the signal of one network operator is overlapped by the signal of the other network operator. Now network company wants to know the maximum numbers of network that will be noiseless.

Write an algorithm to find the maximum numbers of network that will be noiseless.
Input
The first line of the input consists of an integer - sender_size, representing the total number of sender antennas.
The next line consists of N space-separated integers, representing sender antennas(N).
The next line consists of an integer - receiver_size, representing the total number of receiver antennas(M).
The next line consists of M space-separated integers, representing receiver antennas.
Output
Print an integer representing the maximum number of networks that will be noiseless.

Example
Input:
3
785
3
758
Output:
2 Show More

Recruitment Software - Application Display Update
There are N applicants who have applied for a job vacancy. Each applicant has an application ID ranging from 1 to N.
During the initial round of recruitment, the company's software assigns each applicant a score value, which can be positive or negative:
- A positive score indicates the applicant is qualified for the vacancy.
- A negative score indicates the applicant is not qualified and is not visible to the recruiter.
Recruiter's Request
The recruiter wants access to all N applications, but they have a constraint of performing a maximum of K iterations to change the score values.

Operations Allowed
In each iteration, the recruiter can change the score value of the ith applicant from positive to negative or negative to positive.
If there is an (i+1)th applicant, the software automatically changes their score as well.
The goal is to ensure that all N applicants become visible to the recruiter in at most K iterations.

Input Format
First line: An integer application_size (N), representing the total number of applicants.
Second line: N space-separated integers, representing the score values of all N applicants.
Third line: An integer iterations (K), representing the maximum number of iterations allowed.
Output Format
Print space-separated integers, representing the application IDs whose scores must be changed by the recruiter in order to make all N applications visible. Show More

A chat application is building a new immersive feature for their customers to enhance their experience. To train the model for this feature, the developers have prepared a dataset.

In the dataset, there are two columns:
The first column contains a new search term A (a string written without spaces).
The second column contains N unique space-separated words.
Task
The training model is design ed to accept both columns as input and return all feasible sentences after inserting spaces in the search term A, such that:
- Each word in the sentence exists in the second column.
- A word from the second column can be used multiple times.
- Each letter from the search term A must be used in forming the sentence.
- The relative positions of the letters in search term A must remain the same in the output.

Input Format
First line: A string searchTermA, representing the search term A without spacing.
Second line: An integer word_size, representing the total number of words in the second column.
Third line: N space-separated words, representing the list of words available for sentence formation. Show More

Houses in Hackerland
The city of Hackerland has many houses, each of which is connected via roads. There are house_nodes number of houses, numbered 0 to house_nodes - 1, where each pair of houses is connected and has a unique shortest path between them. Thus, the network of houses and roads forms an undirected tree structure comprising house_nodes nodes and (house_nodes - 1) edges. Each of the ed ges has a value denoted by val[i], which can either be 0 or 1.

To summarize, the overall tree is represented as follows:
house_nodes: the number of nodes
house_from, house_to: the arrays representing an undirected edge between house_from[i] and house_to[i] for 1 ≤ i ≤ house_nodes - 1.
val[]: the value of each edge in the tree, which can be either 0 or 1.

Problem Statement
Given the network of houses and roads, the task is to find the number of sequences of length k (h[1], h[2], ... h[k]) such that while visiting:
From house h[1] to h[2],
Then from h[2] to h[3],
And so on until reaching house h[k],
Using the unique shortest path between them, at least one edge with value '1' is visited. Show More

Modified Knapsack Problem

The Knapsack problem is a well-known problem in the field of computer programming and problem-solving. To make it more interesting, an interviewer uses a modified version of the problem.
Given n items, where the weight of the i-th item is 2^i, and the cost of the i-th item is cost[i], find the minimum amount needed to purchase the items such that the combined weight o f the purchased items is at least minWeight.

Example
Consider n = 5 ,cost = [2, 5, 7, 11, 25] ,minWeight = 26

One of the optimal ways to purchase the items is as follows:
Buy 2 units of the 0th item and 3 units of the 3rd item.
Total cost = (2 × 2) + (3 × 11) = 37.
Total weight = (2 × 2^0) + (3 × 2^3) = 26, which is at least minWeight.
Return the total cost of the items, 37.

Function Description
Complete the function getMinimumCost in the editor below.
getMinimumCost has the following parameters:
- int cost[n]: the cost of each item
- int minWeight: the minimum combined weight Show More

Question 2

Implement a Least Frequently Used (LFU) cache data structure of size cacheSize that handles two types of queries: GET and PUT.

A GET query attempts to retrieve the value of a given key.

If the key is present in the cache, it is returned.

Otherwise, it returns -1.

A PUT query updates or inserts a key-value pair into the cache.

When the cache is full, the least frequentl y used key is removed to accommodate the new key-value pair.

If there is a tie in the frequency of keys, then the least recently used key is removed.

Return an array of integers where each i-th element is the answer for the i-th GET query.

Example
Suppose
cacheSize = 1
q = 5
queries = ["PUT 1 1", "PUT 2 2", "GET 1"]

Only cacheSize = 1 element is stored in the cache. Show More

A forklift operator navigates products within an automotive parts warehouse. The dashboard displays a real-time map showing open and blocked sections as an n x m matrix of 1's (open) and 0's (blocked). The operator starts at the top-left corner of the map at warehouse[0][0] and aims to reach the bottom-right corner at warehouse[n-1][m-1].

Movements can only be made to the right or downward. Giv en the warehouse map, calculate the number of distinct paths from warehouse[0][0] to warehouse[n-1][m-1]. Return the result modulo (10⁹+7).

Example
warehouse = [ [1, 1, 0, 1], [1, 1, 1, 1] ]

The matrix below is drawn from the warehouse array, showing open and blocked sections of the warehouse. 1 indicates an open section, and 0 indicates a blocked section. It is only possible to travel through open sections, so no path can go through the section at (0, 2). Show More