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 | 665 Views, 19827 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 | 665 Views, 19827 Search Bots | 107 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview: Make the Largest Number
  2. [Daily Problem] Witness of The Tall People
  3. Plus One
  4. 56 Bytes
  5. Algorithm Interview: Shifted String
  6. CPU Utilization
  7. Find Pythagorean Triplets
  8. Progess made
  9. Binary Tree Level with Minimum Sum
  10. Longest Substring Without Repeating Characters

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