• 0

Country: United States

Comment hidden because of low score. Click to expand.
1
of 1 vote

``````def get_tournament_winner(games_played):
return (set([player for player in games_played]) -  # O(N)
set([win for winns in games_played for win in winns]) ) # + O(N)

def test():
input1 = [(1, [3,5,8,9]), (2, [1, 4, 6]), (3, [4, 9]), (4, )]
winner = get_tournament_winner(input1)
if winner != {2}:
print(f"Test failed {winner}")
else:
print("Test ok")

if __name__ == "__main__":
test()``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

P1>P2 and P2>P3 implies P1>P3
The first question is basically finding the max in an array. First compare between P1 and P2, store the bigger one and then match the result with P3. This process goes on till PN.

The second question is basically sorting the players. This is merge sort where the results of the pairwise matches determine which element is larger.

Comment hidden because of low score. Click to expand.
0
of 0 vote

int x

Comment hidden because of low score. Click to expand.
0
of 0 vote

what was the input other than N?

Comment hidden because of low score. Click to expand.
0
of 0 vote

What was the inputs other than N?

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````// players: [0, n-1]
// w wins w
func Question1(n int, wins [][]int) int {
// Two iteration, but strictly O(1) space
var loser int
for _, w := range wins {
loser = w
// mark loser's index using negative value
wins[loser] = math.MinInt32 + abs(wins[loser])
}

for i := 0; i < n; i++ {
// winner never loses
if wins[i] > 0 {
return i
}
}
return -1
}
func Question2(n int, wins [][]int) []int {
// topological sort
// O(n) time, O(n) space
games := make(map[int][]int)
ans, degrees := make([]int, n), make([]int, n)
for _, w := range wins {
games[w] = append(games[w], w)
degrees[w]++
}
// there should always be all-game losers, otherwise the deadlock occurs
var queue []int
for i, in := range degrees {
if in == 0 {
queue = append(queue, i)
}
}

for len(queue) > 0 {
size := len(queue)
for i := 0; i < size; i++ {
cur := queue[i]
n--
ans[n] = queue[i]
for _, winner := range games[cur] {
degrees[winner]--
if degrees[winner] == 0 {
queue = append(queue, winner)
}
}
}
queue = queue[size:]
}
return ans
}``````

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.