Endor Labs

Details

Internship Only (With possible conversion based on performance)

04/11/23

Log Files: A bank has transaction logs in the form of “sender_user_id receiver_user_id amount”. Given multiple such logs in an array and a threshold value of transactions, return a list of the user_id’s whose total transaction count is greater than the threshold in ascending order.
Example:
```
88 99 200
99 20 100
20 99 200
12 12 200

Threshold: 2

| ID | Transactions |
|----|--------------|
| 88 | 1            |
| 99 | 3            |
| 20 | 2            |
| 12 | 1            |

> 12 is considered as just 1 transaction as it is a self-transfer

Output:
['20', '99']
```

Good Binary Strings: A binary string is a string consisting of 0’s and 1’s.
A good binary string is defined as follows:
1. The number of 1’s is the same as the number of 0’s
2. For every prefix in the string, the number of 1’s is not less than the number of 0’s
You are given a good binary string. This string can contain multiple good binary substrings.
If two substrings are good and are adjacent (no overlap) to each other, they can be swapped. Perform zero or more swaps of such adjacent good substrings on the given binary string to get the lexicographically largest string.
They didn’t mention binary string here, so I’m assuming it is the lexicographically largest string.

Coding Friends: Two friends Erica and Bob like to solve questions, each day they solve one question.
There are 3 types of questions:
Type Points
E 1
M 3
H 5
Two lists are given that entail what problems both solve every day.
Print ‘Erica’, ‘Bob’ or ‘Tied’ depending on who has the higher points at the end of all the problems.