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

Related Articles

  1. Floor and Ceiling of a Binary Search Tree
  2. Algorithm Interview: No Adjacent Repeating Characters
  3. Generate All IP Addresses
  4. Fix Brackets
  5. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  6. [Daily Problem] Longest Palindromic Substring
  7. Daily Interview Problem: Trapping Rainwater
  8. Daily Interview Problem: Largest BST in a Binary Tree
  9. Find Pythagorean Triplets
  10. Algorithm Interview: Make the Largest Number

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