To the Top
File:  root - text - article - 2019 - 12 - circle-of-chained-words.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 393 Views, 15250 Search Bots | 107 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:

Two words can be 'chained' if the last character of the first word is the same as the first character of the second word.

Given a list of words, determine if there is a way to 'chain' all the words in a circle.

Example:
Input: ['eggs', 'karat', 'apple', 'snack', 'tuna']
Output: True
Explanation:
The words in the order of ['apple', 'eggs', 'snack', 'karat', 'tuna'] creates a circle of chained words.

Here's a start:


from collections import defaultdict

def chainedWords(words):
# Fill this in.

print chainedWords(['apple', 'eggs', 'snack', 'karat', 'tuna'])
# True
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 393 Views, 15250 Search Bots | 107 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Largest Product of 3 Elements I
  2. Daily Interview Problem: First Missing Positive Integer
  3. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  4. [Daily Problem] Remove k-th Last Element From Linked List
  5. Daily Interview Problem: Full Binary Tree
  6. Daily Interview Puzzle: Ways to Traverse a Grid
  7. Daily Interview Problem: Largest BST in a Binary Tree
  8. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  9. [Daily Problem] Add two numbers as a linked list
  10. Algorithm Interview: Longest Consecutive Sequence

Comments (0)

    Be the first one to comment this page !


Page Edited: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">