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

Related Articles

  1. Daily Interview Question: Edit Distance
  2. [Daily Problem] Longest Increasing Subsequence
  3. A trick for getting good at coding interviews FASTER
  4. Top K Frequent words
  5. Daily Interview Problem: Largest Product of 3 Elements I
  6. Daily Interview Problem: Validate Binary Search Tree
  7. Daily Interview Problem: Largest BST in a Binary Tree
  8. Patterns for breaking down questions you haven
  9. Batch Programming in XP
  10. Sorting a list with 3 unique numbers

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