页面顶部 Top
文件:  root - text - article - 2019 - 11 - course.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1419 次阅读, 13977 次搜索 | 159 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Google:

By the way, check out our NEW project AlgoPro (http://algopro.com) for over 60+ video coding sessions with ex-Google/ex-Facebook engineers.

You are given a hash table where the key is a course code, and the value is a list of all the course codes that are prerequisites for the key. Return a valid ordering in which we can complete the courses. If no such ordering exists, return NULL.

Example:

{
'CSC300': ['CSC100', 'CSC200'],
'CSC200': ['CSC100'],
'CSC100': []
}


This input should return the order that we need to take these courses:
['CSC100', 'CSC200', 'CSCS300']

Here's your starting point:


def courses_to_take(course_to_prereqs):
# Fill this in.

courses = {
'CSC300': ['CSC100', 'CSC200'],
'CSC200': ['CSC100'],
'CSC100': []
}

print courses_to_take(courses)
# ['CSC100', 'CSC200', 'CSC300']
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1419 次阅读, 13977 次搜索 | 159 个单词 定阅此目录的博客

猜您喜欢...

  1. How to Play WAV music under DOS?
  2. Algorithm Interview: Longest Consecutive Sequence
  3. Algorithm Interview: Convert Roman Numerals to Decimal
  4. Daily Interview Problem: Sort Colors
  5. Fibonacci coding
  6. Algorithm Interview: Permutations of numbers
  7. Daily Interview Problem: Arithmetic Binary Tree
  8. Longest Substring Without Repeating Characters
  9. Daily Interview Problem: Deepest Node in a Binary Tree
  10. First and Last Indices of an Element in a Sorted Array

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />