There are N trolleys used to transport products and each trolley is given a unique ID from 0 to N-1. A trolley operates for a certain time period and is able to carry products. For each trolley, the automated system stores three parameters i.e., the start and end time of operation (both inclusive) and units of products carried. A trolley can be operated within a specified period. No two trolleys c an be operated during the same period, but if a trolley's operating period ends at point T, then another trolley can be immediately started at T. The system must store the maximum number of products transported.

Write an algorithm to find the maximum number of products transported.

Input
The first line of the input consists of two space-separated integers - trolleyList_row and trolleyList_col, representing the number of trolleys (N) and the number of parameters associated with each trolley (trolleyList_col(M) is always equal to three).
The next N lines consist of M space-separated integers representing the starting of the period, ending of the period and, the number of products carried by the trolley, respectively.

Output
Print an integer representing the maximum number of products transported.

Constraints
0 ≤ trolleyList_row ≤ 10^4
0 ≤ starting of the period, ending of the period ≤ 1000
0 < number of products carried by the trolley ≤ 104
trolleyList_col = 3

Example
Input:
4 3
0 2 4
0 4 9
2 4 6
5 10 20

Output:
30 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

1. Simple Text Queries

In this challenge, you will be given an array of sentences and an array of queries. Determine which
sentences contain all of the words of a query. If no sentence contains all of the words, the answer to
that query is [-1].

Example:
sentences = ['bob and alice like to text each other', 'bob does not like to ski but does not like to fall',
'Alice likes to ski']
que ries = ['bob alice', 'alice', 'like', 'non occurrence']

The results of the queries are:

0. sentences[0] -> [0]
1. sentences[0] -> [0]
2. sentences[0], sentences[1], sentences[1] -> [0, 1, 1]
3. none match -> [-1]

Return a 2-dimensional integer array: [[0], [0], [0, 1, 1], [-1]].

Note: The word "like" in queries[2] does not match "likes" in sentences[2]. The word "alice" does not match
"alice" in sentence[2]. Matches must be exact.

After each query has been processed, add an array of indices of the matching sentences to the answer. Show More