TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Together (YC S19) interviewing engineers that can solve this algorithm problem

1 点作者 nathan_gold大约 1 年前
At Together, we help people find peers, mentors and experts at their company to learn from.<p>We support matching 1on1, in groups, and events and workshops to increase knowledge transfer within a company and improve career development.<p>For example, employees at customers like the United Nations match around the world to discuss how to advance their career, how to move to another office, and their learnings and advice.<p>-----THE PROBLEM-----<p>We&#x27;re challenging engineers like you to provide a solution to the following problem. If it makes sense, we&#x27;ll accelerate you through our interview process for Engineer II:<p>- You have m mentees - You have M mentors - You have N match scores between mentees and mentors, based on how good of a match they are for mentorship. - mxM &gt; N, because not every mentee is eligible to match with every mentor. It depends on seniority constraints. - Each mentee has a maximum mentor limit of 1 - Each mentor has a maximum mentee limit of l, where 0&lt;l&lt;4<p>How would you find the ideal set of matches to maximize match scores across all mentees and mentors?<p>Submit your answer in the &quot;Anything else we should know&quot; field here: <a href="https:&#x2F;&#x2F;app.dover.io&#x2F;apply&#x2F;Together&#x2F;cdb7d244-6af1-4647-adc1-fc3e1cd210db&#x2F;?rs=76643084" rel="nofollow">https:&#x2F;&#x2F;app.dover.io&#x2F;apply&#x2F;Together&#x2F;cdb7d244-6af1-4647-adc1-...</a>

暂无评论

暂无评论