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

Related Articles

  1. Daily Interview Problem: Spiral Traversal of Grid
  2. Daily Interview Problem: Reverse Words in a String
  3. Spreadsheet Columns
  4. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  5. Sorting a list with 3 unique numbers
  6. Daily Interview Puzzle: Minimum Size Subarray Sum
  7. Binary Tree Level with Minimum Sum
  8. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  9. [Daily Problem] Remove k-th Last Element From Linked List
  10. Algorithm Interview: Subarray With Target 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" />