Latest Questions | Page 11

The longest diagonals of a square matrix are defined as follows:
- The first longest diagonal goes from the top-left corner to the bottom-right corner.
- The second longest diagonal goes from the top-right corner to the bottom-left corner.

Given a square matrix, your task is to swap its longest diagonals by exchanging their elements at the corresponding positions.

Example:

matrix = [[1, 2, 3],
[4, 5, 6],
[7, 8, 9]] Show More

3. Cluster Queries

In a Salesforce global infrastructure, there are customer support clusters numbered from 1 to clusters, distributed across multiple regions. These clusters are interconnected by n communication links, represented by the array connections, such that if two clusters are connected directly or indirectly, they belong to the same support network.

Each cluster has a case resolut ion system to handle customer cases. If a cluster's resolution system goes offline, it forwards the cases to the active cluster in the same support network with the lowest ID, which then resolves the cases. If no active clusters remain in the network, the case is logged as unresolved.

You need to process q queries of two types:

1. A case-assignment query: "1 cluster_id", where a case is assigned to the specified cluster.
2. A system-failure query: "2 cluster_id", where the resolution system of the specified cluster goes offline.

For each case-assignment query, output the ID of the cluster that resolves the case. Specifically:
- When a case-assignment query is made to cluster sender_cluster_id, find the active cluster in the same support network as sender_cluster_id with the lowest ID and output its ID.
- If no active clusters remain in the network, output -1.

Example:
Suppose:
clusters = 3
n = 2
connections = [[1, 2], [2, 3]]
q = 5
queries = [[2, 2], [1, 2], [2, 1], [2, 3], [1, 1]]

Function Description:
Complete the function getAssignedCluster in the editor below.

getAssignedCluster has the following parameters:
- int clusters: number of clusters
- int connections[n][2]: the connections between clusters
- int queries[q][2]: the queries

Returns:
- int: the ID of the cluster that resolves the case, or -1 if no active cluster remains in the network.

Constraints:
- 1 ≤ clusters ≤ 10^5
- 0 ≤ n ≤ 10^5
- 1 ≤ q ≤ 2 × 10^5
- 1 ≤ connections[i][0], connections[i][1] ≤ clusters
- 1 ≤ queries[i][0] ≤ 2
- 1 ≤ queries[i][1] ≤ clusters
- There is at least 1 query of type 1.

Input Format For Custom Testing:
The first line contains an integer, clusters.
The next line contains an integer, n, the number of interconnections.
The next line contains an integer, 2.

Each line i of the subsequent n lines (where 0 ≤ i < n) contains two integers, connections[i][0] and connections[i][1].

The next line contains an integer, q, the number of queries.
The next line contains an integer, 2.

Each line i of the subsequent q lines (where 0 ≤ i < q) contains two integers, queries[i][0] and queries[i][1]. Show More

2. Salesforce Latency Optimization

Given a Salesforce infrastructure with API nodes, cloud regions, and API edges (bidirectional API connections between them), the i-th connection links regions api_from[i] and api_to[i] with a latency of api_weight[i]. The max-latency of a region is the maximum latency of any API within that region.

Split this infrastructure into at most k independent region s by disabling some API connections such that the maximum of the max-latency of all regions formed is minimized. Given api_nodes, api_from, and api_to, determine the minimum possible value of the maximum max-latency of the regions formed.

Example:
Suppose:
api_nodes = 3
m = 3
k = 2
api_from = [1, 2, 3]
api_to = [2, 3, 1]
api_weight = [4, 5, 3]

Function Description:
Complete the function optimizeAPIRegions in the editor below.

optimizeAPIRegions has the following parameter(s):
- api_nodes: the number of cloud regions
- api_from[api_edges]: one endpoint of the API connections
- api_to[api_edges]: the other endpoint of the API connections
- api_weight[api_edges]: the latency of the API connections
- k: the maximum number of regions after disabling some APIs

Returns:
- int: the minimum possible value of the maximum of max-latency of the networks formed

Constraints:
- 1 ≤ api_nodes ≤ 10^5
- 0 ≤ api_edges ≤ 1.5 × 10^5
- 1 ≤ api_from[i], api_to[i] ≤ api_nodes
- 1 ≤ api_weight[i] ≤ 10^9
- 1 ≤ k ≤ n
- It is guaranteed that the graph is initially connected.

Input Format For Custom Testing:
Sample Case 0:

Sample Input For Custom Testing:
STDIN:
api_nodes = 2, api_edges = 1
api_from = [1]
api_to = [2]
api_weight = [3]
k = 1

Sample Output:
3

Explanation:
In this case, the graph has 2 nodes connected by 1 API edge with latency 3. Since we are allowed to create only 1 region (k=1), the minimum possible value of the maximum latency of the network is 3. Show More

1. Salesforce Cloud server requests

In a Salesforce multi-cloud architecture, there is a circular network of m cloud servers, numbered from 1 to m, where servers 1 and m are adjacent. These servers handle various customer requests, and the latency between switching from one server to the next or the previous is given by an array, transitionTime[i], representing the time required to transition f rom the ith server to its adjacent servers.

A sequence of requested servers (represented as an array of length n, requestedServers) must be visited in the given order to handle customer workloads. The task is to determine the minimum time required to process all the requests, starting from server 1.

Example:
m = 3
n = 4
transitionTime = [3, 2, 1]
requestedServers = [1, 3, 3, 2]

- The pointer is initially at server 1, and the first server to be visited is number 1, hence it takes 0 seconds to visit it.
- To move from server 1 to 3, the path followed could be 1 -> 2 -> 3, which takes 3 + 2 = 5 seconds, or the path could be 1 -> 3, which takes 3 seconds. Choosing the shorter path, server 3 is visited in 3 seconds.
- The pointer is already at server 3, so the third server takes no time to visit.
- To move from server 3 to 2, either the path could be 3 -> 2, which takes 1 second, or the path could be 3 -> 1 -> 2, which takes 1 + 3 = 4 seconds. Choosing the shorter path, the fourth required server is visited in 1 second after visiting the third server.

Hence, the minimum possible time to visit all the required servers is 4 seconds.

Function Description:
Complete the function minRequestTime in the editor below.

minRequestTime takes the following parameter(s):
- int requestedServers[n]: the sequence of servers to be visited
- int transitionTime[m]: the time taken to switch connections from each server and connect to its adjacent server

Returns:
- long: the minimum total time required to visit all the requested servers, considering the transition time of servers

Constraints:
- 1 ≤ requestedServers(i) ≤ m
- 1 ≤ m ≤ 1000
- 1 ≤ transitionTime(i) ≤ 10^6 Show More

Directory Structure (SDE Question) - Part A

You are given a directory structure represented as a tree, where each node represents a directory that can have any number of child directories.

- Each child directory will have a unique name.
- The second line of the input will contain the root name and its child directories.

Based on the given input, you have to construct the directory struct ure and implement three functions: countDescendants, cutPaste, and copyPaste.

Function Details:

1. countDescendants(path)
- Takes one argument: directory path
- Returns the number of descendants of the directory

Examples:
countDescendants("root") => 7
countDescendants("root/a") => 2
countDescendants("root/b") => 0
countDescendants("root/c") => 2
countDescendants("root/a/d") => 0
countDescendants("root/a/e") => 0

2. cutPaste(src, dest)
- It takes two arguments: source directory and destination directory
- Cuts the source directory from its parent and pastes it inside the destination directory

Example:
cutPaste("root/a", "root/c")

3. copyPaste(src, dest)
- It takes two arguments: source directory and destination directory
- Copies the source directory and pastes it into the destination

Example:
copyPaste("root/a","root/c")

Output:
- countDescendants(node): print the total number of descendants or "Invalid command"
- cutPaste(src, dest): print "OK" or "Invalid command"
- copyPaste(src, dest): print "OK" or "Invalid command"

Negative Conditions:
- If the source is an ancestor of the destination, print "Invalid command"
- If source = destination, print "Invalid command"
- If the destination already has a directory of the source's name, print "Invalid command"
- If not a valid path for the source or destination, print "Invalid command"
- If command causes total nodes > 10^6, print "Invalid command"

Input Bounds:
- 1 <= n <= 10^5 (structure lines)
- 1 <= q <= 10^5 (commands)
- Total number of nodes at any point: <= 10^6 Show More

Problem Statement

You are given an array arr of positive integers of size n. Each value in the array represents the number of toffees in a packet. Each packet can have any number of toffees. For example, if arr = [2, 3], this means that the first packet has 2 toffees and the second has 3 toffees. There are x students. The task is to distribute toffee packets among x students such that:

- Eac h student gets exactly one packet.
- The difference between the maximum number of toffees given to a student and the minimum number of toffees given to a student is minimized.

Input & Output

Input Format:
- The first line is an integer n, which represents the number of chocolate packets.
- The next line is an integer x, which represents the number of students.
- The next line contains n space-separated integer values that represent the number of toffees in each packet.

Input Constraints:
- n > x > 1

Output Format:
- An integer representing the difference between the maximum and minimum number of toffees given to a student.

Example 1:

Input:
7
3
7 3 2 4 9 12 56

Output:
2

Explanation:
Imagine Student 1 got the 2nd packet, Student 2 got the 3rd packet, and Student 3 got the 4th packet. So, the three students get 3, 2, and 4 toffees respectively.
The difference between the maximum (4) and minimum (2) number of toffees is 2. For no other distribution will this difference be smaller. Show More

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

Given three points a(x1, y1), b(x2, y2), and c(x3, y3), determine if they form a non-degenerate triangle. Then, check if two points, p(xp, yp) and q(xq, yq), are inside or on the triangle.

Return the corresponding scenario number:
0. The lines do not form a valid non-degenerate triangle.
1. Point p is inside the triangle, but point q is not.
2. Point q is inside the triangle, but point p is not.
3. Both points p and q are inside the triangle.
4. Neither point p nor point q is inside the triangle.

Note: A triangle is considered non-degenerate if it meets the following conditions, where |ab| denotes the length of the line segment between points a and b:
· |ab| + |bc| > |ac|
· |bc| + |ac| > |ab|
· |ab| + |ac| > |bc|

Example
1 = a(x1, y1) : (2, 2)
2 = b(x2, y2) : (7, 2)
3 = c(x3, y3) : (5, 4) Show More

Vowel SubString

Given a string composed of lowercase letters within the ASCII range 'a'-'z', determine the number of substrings that consist solely of vowels, where each vowel appears at least once. The vowels are ['a', 'e', 'i', 'o', 'u']. A substring is defined as a contiguous sequence of characters within the string.
Example
s = 'aeioaexaaeuiou'

There is a substring to the left that is made of vowels, 'aeioae', which is followed by an 'x'. Since 'x' is not a vowel, it cannot be included in the substring, and this substring does not contain all of the vowels. It is not a qualifying substring. Moving to the right, there are four substrings that do qualify: 'aaeuiou', 'aaeuid', 'aeuiou', and 'aeuio'.

Function Description
Complete the function vowelSubstring in the editor with the following parameter(s):
string s: a string
Returns
int: the number of substrings that consist of vowels only ('a', 'e', 'i', 'o', 'u') where every vowel appears at least once.

Constraints
1 ≤ size_of(s) ≤ 10^5
s[i] is in the range ascii['a'-'z'] (where 0 ≤ i < size_of(s)) Show More

Coding Wars
There are 'N' coders standing in a line, where i denotes the ith position of a coder with a rating of Ri. All ratings are distinct.
You have to form a team of 3 from amongst them with the condition:
Any three coders with positions (i, j, k) and ratings ("Ri< Rj< Rk" or "Ri > Rj > Rk") and(1 <= i < j < k <= N)
You have to find out how many such teams exist (1 coder can be part of m ultiple teams).
Input:
N = 5
Ratings = [5, 2, 3, 1, 4]
Output:
3
(5, 2, 1), (5, 3, 1), (2, 3, 4) Show More