页面顶部 Top
文件:  root - text - article - 2019 - 12 - circle-of-chained-words.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 393 次阅读, 15212 次搜索 | 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, | 英文 | 主页 | 类别: 计算机科学 | 393 次阅读, 15212 次搜索 | 107 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  2. Daily Interview Problem: Buddy Strings
  3. Spreadsheet Columns
  4. Skip the readings, focus on problems. And use all the hints!
  5. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  6. Detect Linked List Cycle
  7. Daily Interview Problem: Merge K Sorted Linked Lists
  8. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  9. Daily Interview Problem: Decode String
  10. Most Frequent Subtree Sum

评论 (0)

    当前页暂时没有评论。


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