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, 19846 Search Bots | 107 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 665 Views, 19846 Search Bots | 107 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 665 Views, 19846 Search Bots | 107 Words 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Two Tricks of Delphi
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- [Daily Problem] Longest Palindromic Substring
- CPU Utilization
- Invert a Binary Tree
- Daily Interview Problem: Merge List Of Number Into Ranges
- Daily Interview Problem: Minimum Removals for Valid Parenthesis
- Daily Interview Problem: Trapping Rainwater
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- Daily Interview Problem: Jump to the End
©2006~2024 SteakOverCooked - 0.00968 Seconds(s) - 5593.975 KB/s - 63 Online
Memory: 516.3 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !