页面顶部 Top
文件:  root - text - article - 2019 - 12 - circle-of-chained-words.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 394 次阅读, 15571 次搜索 | 107 个单词

定阅此目录的博客 | 浏览 | 博客存档
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
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 394 次阅读, 15571 次搜索 | 107 个单词 定阅此目录的博客

猜您喜欢...

  1. Spreadsheet Column Title
  2. Sort a Partially Sorted List
  3. Daily Interview Problem: Full Binary Tree
  4. Palindrome Integers
  5. Daily Interview Problem: Reverse Words in a String
  6. Non-decreasing Array with Single Modification
  7. Algorithm Interview Question: Nth Fibonacci Number
  8. Daily Interview Puzzle: Minimum Size Subarray Sum
  9. Daily Interview Problem: Buddy Strings
  10. Daily Interview Problem: Queue Using Two Stacks

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />