Stripe店面挂经

题目就是：

上午面完，下午就收到模版拒信，挺有效率的。面试体验很一般，面试官上来就说不要求优化，你想优化的随意，我们主要看你的思路和交流。

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

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

case就对了！但这种风气感觉是在无法认同，所以被拒也是双方都解脱了

这种基本是模拟工作面试吧， 测试在fintech公司的工作过程中挺重要的

解决方案

1. #include <iostream>
   
2. #include <string>
   
3. #include <unordered_map>
   
4. #include <vector>
   
5. #include <queue>
   
6. #include <algorithm>
   
7. 
   
8. using namespace std;
   
9. 
   
10. 
    
11. /**
    
12. *
    
13. *  TEST
    
14. *
    
15. *  */
    
16. class Test{
    
17.     public:
    
18.     static int totalCase;
    
19.     static int testCase;
    
20.     Test(bool expected, bool result);
    
21.     Test(vector<string> expected, vector<string> result);
    
22.     void printVector(vector<string> v);
    
23.     static void printTestSuit(); // to directly access Test::printTestSuit() in main
    
24. };
    
25. int Test::totalCase = 0;
    
26. int Test::testCase = 0;
    
27. 
    
28. Test::Test(bool expected, bool result){
    
29.     totalCase++;
    
30.     if(result == expected){
    
31.         cout << "Test Passed : " << "(expected: " << expected << ", result: " << result << ")" << endl;
    
32.         testCase++;
    
33.     }
    
34.     else {
    
35.         cout << "Test Failed : " << "(expected: " << expected << ", result: " << result << ")" << endl;   
    
36.     }
    
37. }
    
38. Test::Test(vector<string> expected, vector<string> result){
    
39.     totalCase++;
    
40.      if(expected == result){
    
41.         cout << "Test Passed : " << "(expected: "; printVector(expected);  cout << ", result: "; printVector(result); cout << ")" << endl;
    
42.         testCase++;
    
43.     } else {
    
44.         cout << "Test Failed : " << "(expected: "; printVector(expected); cout << ", result: "; printVector(result); cout << ")" << endl;   
    
45.     }
    
46. }
    
47. 
    
48. void Test::printVector(vector<string> v){
    
49.     cout << "{";
    
50.     for(int i = 0; i < v.size() - 1; i++){
    
51.         cout << v[i] << ", ";
    
52.     }
    
53.     cout << v[v.size() - 1] << "}";
    
54. }
    
55. 
    
56. void Test::printTestSuit(){
    
57.     cout << testCase << " / " << totalCase <<  " Total Cases Passed" << endl;
    
58. }
    
59. 
    
60. /**
    
61. *
    
62. *  WISHLIST
    
63. *
    
64. *  */
    
65. class WishList{
    
66.     public:
    
67.     unordered_map<string, vector<string>> wishList = {
    
68.         {"a", {"c", "d"}},
    
69.         {"b", {"d", "a", "c"}},
    
70.         {"c", {"a", "b"}},
    
71.         {"d", {"c", "a", "b"}},
    
72.         {"e", {""}}
    
73. 
    
74.         // {"a", {"b", "c", "d"}},
    
75.         // {"b", {"a", "d", "c"}},
    
76.         // {"c", {"d" ,"a", "b"}},
    
77.         // {"d", {"a", "c"}}
    
78. 
    
79.         // {"a", {"c", "d"}},
    
80.         // {"b", {"d", "a", "c"}},
    
81.         // {"c", {"a", "b"}},
    
82.         // {"d", {"c", "a", "b"}}
    
83.         
    
84. 
    
85.     };
    
86.     bool has_mutual_first_choice(string userName);
    
87.     bool has_mutual_pair_for_rank(string userName, int rank);
    
88.     bool has_mutual_pair_for_rank(string userName, int uRank, int mRank);
    
89.     vector<string> changePair(string user, int index);
    
90.     vector<string> changed_pairings(string userName, int index);
    
91. };
    
92. 
    
93. // part 1
    
94. bool WishList::has_mutual_first_choice(string userName){
    
95.     if(!wishList[userName].empty() && wishList.find(userName) != wishList.end()){
    
96.         const int firstChoice = 0;
    
97.         string usersFirstChoice = wishList[userName][firstChoice];
    
98.         if(wishList.find(usersFirstChoice) != wishList.end()
    
99.             && !wishList[usersFirstChoice].empty()
    
100.             && wishList[usersFirstChoice][firstChoice] == userName){
     
101.             return true;
     
102.         }
     
103.     }
     
104.     return false;
     
105. }
     
106. 
     
107. // part 2
     
108. bool WishList::has_mutual_pair_for_rank(string userName, int rank){
     
109.     if(wishList[userName].size() > rank && wishList.find(userName) != wishList.end()){
     
110.         string usersChoice = wishList[userName][rank];
     
111.         if(wishList.find(usersChoice) != wishList.end()
     
112.             && wishList[usersChoice].size() > rank
     
113.             && wishList[usersChoice][rank] == userName)
     
114.             return true;
     
115.     }
     
116.     return false;
     
117. }
     
118. 
     
119. 
     
120. bool WishList::has_mutual_pair_for_rank(string user, int uRank, int mRank){
     
121.     if(uRank < 0) return false;
     
122.     if(wishList[user].size() > uRank && wishList.find(user) != wishList.end()){
     
123.         string mutualUser = wishList[user][uRank];
     
124.         if(wishList.find(mutualUser) != wishList.end()
     
125.             && wishList[mutualUser].size() > mRank
     
126.             && wishList[mutualUser][mRank] == user)
     
127.             return true;
     
128.     }
     
129. 
     
130.     return false;
     
131. }
     
132. 
     
133. // part 3-1 - swap user rank index with index-1
     
134. vector<string> WishList::changePair(string user, int index){
     
135.     // return matched all users before and after swap with same mutual ranking
     
136.     vector<string> ans;
     
137.     // before swap
     
138.     if(wishList[user].size() > index && wishList.find(user) != wishList.end()){
     
139.         vector<string> usersWishlist {wishList[user]};
     
140.         for(int i = 0 ; i < usersWishlist.size(); i++){
     
141.             if(has_mutual_pair_for_rank(user, i))
     
142.                 ans.push_back(usersWishlist[i]);
     
143.         }
     
144.         // after swap
     
145.         if(index > 0){
     
146.             if(has_mutual_pair_for_rank(user, index, index - 1))
     
147.                 ans.push_back(usersWishlist[index]);
     
148. 
     
149.             if(has_mutual_pair_for_rank(user, index - 1, index))
     
150.                 ans.push_back(usersWishlist[index - 1]);
     
151.         }
     
152.     }
     
153.     return ans;
     
154. }
     
155. 
     
156. 
     
157. vector<string> WishList::changed_pairings(string userName, int index){
     
158.     // before swap
     
159.     vector<string> ans;
     
160.     if(wishList[userName].size() > index && wishList.find(userName) != wishList.end()){
     
161.         vector<string> usersWishList {wishList[userName]};
     
162.         if(index > 0){
     
163.             if(has_mutual_pair_for_rank(userName, index) != has_mutual_pair_for_rank(userName, index, index - 1))
     
164.                 ans.push_back(usersWishList[index]);
     
165. 
     
166.             if(has_mutual_pair_for_rank(userName, index - 1) != has_mutual_pair_for_rank(userName, index - 1, index))
     
167.                 ans.push_back(usersWishList[index - 1]);
     
168.         }
     
169.     }
     
170.     if(ans.empty()) return {""};
     
171.     return ans;
     
172. }
     
173. 
     
174. 
     
175. 
     
176. 
     
177. 
     
178. int main(){
     
179. 
     
180.     WishList* wishList = new WishList();
     
181. 
     
182. 
     
183. 
     
184. 
     
185.     Test(1, wishList->has_mutual_first_choice("a"));
     
186.     Test(1, wishList->has_mutual_first_choice("c"));
     
187.     Test(0, wishList->has_mutual_first_choice("b"));
     
188. 
     
189.     Test(1, wishList->has_mutual_pair_for_rank("a", 1));
     
190.     Test(1, wishList->has_mutual_pair_for_rank("a", 0));
     
191. 
     
192.     Test({"a","b","d"}, wishList->changePair("c", 1));
     
193. 
     
194.     Test({"a"}, wishList->changed_pairings("d", 1));
     
195.     Test({"c"}, wishList->changed_pairings("b", 2));
     
196.     Test({""}, wishList->changed_pairings("b", 1));
     
197. 
     
198. 
     
199.     Test::printTestSuit();
     
200. 
     
201.     return 0;
     
202. }
     

复制代码