Add coding exercises for Facebook interviews
Add attempts at solving coding problems to Briefcase.
This commit is contained in:
parent
d2d772e43e
commit
aa66d9b83d
66 changed files with 2994 additions and 0 deletions
22
scratch/facebook/find-duplicate-optimize-for-space.py
Normal file
22
scratch/facebook/find-duplicate-optimize-for-space.py
Normal file
|
|
@ -0,0 +1,22 @@
|
|||
import random
|
||||
|
||||
def find_duplicate(xs):
|
||||
print(xs)
|
||||
# entry point in our cycle is the duplicate
|
||||
i = xs[0]
|
||||
j = xs[xs[0]]
|
||||
while i != j:
|
||||
print(i, xs[i], j, xs[j])
|
||||
i = xs[i]
|
||||
j = xs[xs[j]]
|
||||
# detect cycle
|
||||
j = 0
|
||||
while i != j:
|
||||
i = xs[i]
|
||||
j = xs[j]
|
||||
return xs[i]
|
||||
|
||||
n = random.randint(5, 10)
|
||||
xs = [random.randint(0, n - 1) for _ in range(n)]
|
||||
result = find_duplicate(xs)
|
||||
print(xs, result)
|
||||
Loading…
Add table
Add a link
Reference in a new issue