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 | 392 Views, 21021 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 | 392 Views, 21021 Search Bots | 72 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview: No Adjacent Repeating Characters
  2. Algorithm Interview: Longest Consecutive Sequence
  3. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  4. Batch Programming in XP
  5. Binary Tree Level with Minimum Sum
  6. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  7. Daily Interview Problem: Find the k-th Largest Element in a List
  8. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  9. Generate All IP Addresses
  10. Daily Interview Problem: Merge K Sorted Linked Lists

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    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" />