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

Related Articles

  1. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  2. Algorithm Interview Question: Max and Min with Limited Comparisons
  3. Design Tic-Tac-Toe
  4. Daily Interview Problem: Group Words that are Anagrams
  5. Daily Interview Problem: Find the Number of Islands
  6. Daily Interview Problem: Full Binary Tree
  7. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  8. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  9. Algorithm Interview Question: Nth Fibonacci Number
  10. Daily Interview Puzzle: Minimum Size Subarray Sum

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