Company: JPMORGAN

Given a matrix of size m * n, where m denotes the number of rows (starting with index 0) and n denotes the number of columns (starting with index 0). The elements in the matrix are populated with values either 1 or 0. A 1 indicates the matrix position is available for establishing the connection, and a 0 indicates the matrix position is not available for establishing the connection.

We need to connect the available adjacent positions vertically, horizontally, and diagonally, and count the number of distinct connections established.

For example, given a matrix of size 3 * 4, the elements are stored as follows:

The expected output is 8.

In the above example, the positions are connected as follows, and hence 8 connections are possible:
1. (0,0) -> (1,1)
2. (2,0) -> (1,1)
3. (1,1) -> (1,2)
4. (1,2) -> (0,3)
5. (1,2) -> (1,3)
6. (1,2) -> (2,3)
7. (0,3) -> (1,3)
8. (1,3) -> (2,3)

Input:
- m: integer representing the number of rows
- n: integer representing the number of columns
- matrix: m * n matrix

Output:
- r: integer representing the total number of connections

Constraints:
- 0 < m, n < 100
- Connection is always between two adjacent cells (horizontally, vertically, or diagonally). 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