硬币基地karat店面

平台： Karat

面试官： 南非外包小哥
15 min - Design Social Media

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

g的逻辑，没有特别的算法

1. Write a function that takes the logs as input, builds the transition graph and returns it as an adjacency list with probabilities. Add __START__ and __END__ states.
   
2. 
   
3. Specifically, for each resource, we want to compute a list of every possible next step taken by any user, together with the corresponding probabilities. The list of resources should include __START__ but not __END__, since by definition __END__ is a terminal state.
   
4. 
   
5. Expected output for logs1:
   
6. transition_graph(logs1) # =>
   
7. {
   
8.     '__START__': {'resource_1': 0.25, 'resource_2': 0.125, 'resource_3': 0.5, 'resource_6': 0.125},
   
9.     'resource_1': {'resource_6': 0.333, '__END__': 0.667},
   
10.     'resource_2': {'__END__': 1.0},
    
11.     'resource_3': {'__END__': 0.4, 'resource_1': 0.2, 'resource_2': 0.2, 'resource_3': 0.2},
    
12.     'resource_4': {'__END__': 1.0},
    
13.     'resource_5': {'resource_4': 1.0},
    
14.     'resource_6': {'__END__': 0.5, 'resource_5': 0.5}
    
15. }
    
16. 
    
17. 
    
18. For example, of 8 total users, 4 users have resource_3 as a first visit (user_1, user_2, user_3, user_5), 2 users have resource_1 as a first visit (user_6, user_22), 1 user has resource_2 as a first visit (user_7), and 1 user has resource_6 (user_8) so the possible next steps for __START__ are resource_3 with probability 4/8, resource_1 with probability 2/8, and resource_2 and resource_6 with probability 1/8.
    
19. 
    
20. These are the resource paths per user for the first logs example, ordered by access time:
    
21. {
    
22.     'user_1': ['resource_3', 'resource_3', 'resource_1'], r
    
23.     'user_2': ['resource_3', 'resource_2'],
    
24.     'user_3': ['resource_3'],
    
25.     'user_5': ['resource_3'],
    
26.     'user_6': ['resource_1', 'resource_6', 'resource_5', 'resource_4'],
    
27.     'user_7': ['resource_2'],
    
28.     'user_8': ['resource_6'],
    
29.     'user_22': ['resource_1'],
    
30. }
    
31. 
    
32. 
    
33. Expected output for logs2:
    
34. transition_graph(logs2) # =>
    
35. {
    
36.   '__START__': {'resource_3': 1.0},
    
37.   'resource_3': {'resource_3: 0.857, '__END__': 0.143}
    
38. }
    
39. 
    
40. Expected output for logs3:
    
41. transition_graph(logs3) # =>
    
42. {
    
43.   '__START__': {'resource_5': 1.0},
    
44.   'resource_5': {'__END__': 1.0}
    
45. }
    
46. 
    
47. Complexity analysis variables:
    
48. 
    
49. n: number of logs in the input
    
50. 
    
51. 
    
52. sample_input:
    
53. logs = {
    
54.      { "6500", "user_1", "resource_1"  },
    
55.      { "4200", "user_2", "resource_2" },
    
56.      { "7800", "user_22", "resource_1" },
    
57.      { "980", "user_7", "resource_2" },
    
58.      { "23", "user_6", "resource_1" },
    
59.      { "6000", "user_1", "resource_3" },
    
60.      { "345", "user_6", "resource_5" },
    
61.      { "3200", "user_2", "resource_3" },
    
62.      { "2", "user_1", "resource_3" },
    
63.      { "201", "user_6", "resource_6" },
    
64.      { "998", "user_8", "resource_6" },
    
65.      { "5621", "user_3", "resource_3" },
    
66.      { "10212", "user_6", "resource_4" },
    
67.      { "29899", "user_5", "resource_3" }
    
68. }
    
69. 
    
70. sample_output of above input:
    
71. __START__: [["resource_3": 0.5], ["resource_2": 0.125], ["resource_1": 0.25], ["resource_6": 0.125]]
    
72. resource_1: [["__END__": 0.6666667], ["resource_6": 0.33333334]]
    
73. resource_2: [["__END__": 1.0]]
    
74. resource_3: [["__END__": 0.4], ["resource_3": 0.2], ["resource_2": 0.2], ["resource_1": 0.2]]
    
75. resource_4: [["__END__": 1.0]]
    
76. resource_5: [["resource_4": 1.0]]
    
77. resource_6: [["__END__": 0.5], ["resource_5": 0.5]]

复制代码

他们家到底是怎么决定是karat还是自己面 karat是不是就不是面经题了

1. 问了一下recruiter说是最近面试多，安排不过来
2. karat 每个公司好像有自己的题库