To the Top
File:  root - text - article - 2019 - 10 - find-cycles-in-a-graph.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 394 Views, 21480 Search Bots | 72 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:

Given an undirected graph, determine if a cycle exists in the graph.

Here is a function signature:


def find_cycle(graph):
# Fill this in.

graph = {
'a': {'a2':{}, 'a3':{} },
'b': {'b2':{}},
'c': {}
}
print find_cycle(graph)
# False
graph['c'] = graph
print find_cycle(graph)
# True


Can you solve this in linear time, linear space?
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Cateogry: Computing | 394 Views, 21480 Search Bots | 72 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Min Range Needed to Sort
  2. [Daily Problem] Add two numbers as a linked list
  3. Daily Interview Problem:Create a balanced binary search tree
  4. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  5. [Daily Problem] Angles of a Clock
  6. Staying on a Chess Board
  7. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  8. Most Frequent Subtree Sum
  9. 56 Bytes
  10. CPU Utilization

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="index, follow">