To the Top
File:  root - text - article - 2019 - 11 - course.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1476 Views, 15411 Search Bots | 159 Words

Subscribe to Feed Burner | Browse | Archive
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']
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 1476 Views, 15411 Search Bots | 159 Words Subscribe to Feed Burner

Related Articles

  1. How to Play WAV music under DOS?
  2. Patterns for breaking down questions you haven
  3. Plus One
  4. Two Tricks of Delphi
  5. [Daily Problem] Witness of The Tall People
  6. Spectrum Master
  7. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  8. Daily Interview Problem: Circle of Chained Words
  9. Algorithm Interview Question: Symmetric k-ary Tree
  10. Algorithm Interview Question: H-Index

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />