EasyNo. 2490

Circular Sentence — LeetCode 2490 Python Solution

Pattern
Hash Map
Topics
String
Reading time
2 min

The problem

A sentence is a list of words that are separated by a single space with no leading or trailing spaces. For example, "Hello World", "HELLO", "hello world hello world" are all sentences.

Example

Input
sentence = "leetcode exercises sound delightful"
Output
true
Explanation
The words in sentence are ["leetcode", "exercises", "sound", "delightful"].

Python solution

PythonSolution
class Solution:
    def isCircularSentence(self, sentence: str) -> bool:
        ss = sentence.split()
        n = len(ss)
        return all(s[-1] == ss[(i + 1) % n][0] for i, s in enumerate(ss))

Complexity

Time
O(n)
Space · auxiliary
O(n)

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 2490. Circular Sentence is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems

Related problems
No.ProblemDifficulty
2496Maximum Value of a String in an ArrayEasy
0006Zigzag ConversionMedium
0008String to Integer (atoi)Medium
0038Count and SayMedium
0058Length of Last WordEasy
0065Valid NumberHard

Frequently asked questions

How hard is LeetCode 2490. Circular Sentence?

LeetCode 2490. Circular Sentence is rated Easy on LeetCode.

What is the time complexity of LeetCode 2490. Circular Sentence?

The Python solution on this page runs in O(n).

What is the space complexity of LeetCode 2490. Circular Sentence?

The Python solution on this page uses O(n) auxiliary space.

What topics does LeetCode 2490. Circular Sentence cover?

LeetCode 2490. Circular Sentence is tagged String on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.