页面顶部 Top
文件:  root - text - article - 2019 - 11 - course.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 1477 次阅读, 15567 次搜索 | 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, | 英文 | 主页 | 类别: 计算机科学 | 1477 次阅读, 15567 次搜索 | 159 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Circle of Chained Words
  2. Binary Tree Level with Minimum Sum
  3. Find Missing Numbers in an Array
  4. Fibonacci coding
  5. Longest Substring Without Repeating Characters
  6. Daily Interview Problem: Distribute Bonuses
  7. Plus One
  8. Absolute Path
  9. Skip the readings, focus on problems. And use all the hints!
  10. Daily Interview Problem: Look and Say Sequence

评论 (0)

    当前页暂时没有评论。


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