EasyNo. 1370

Increasing Decreasing String — LeetCode 1370 Python Solution

Pattern
Hash Map
Topics
Hash Table, String, Counting
Reading time
2 min

The problem

You are given a string s. Reorder the string using the following algorithm: Remove the smallest character from s and append it to the result.

Example

Input
s = "aaaabbbbcccc"
Output
"abccbaabccba"
Explanation
After steps 1, 2 and 3 of the first iteration, result = "abc"

Python solution

PythonSolution
class Solution:
    def sortString(self, s: str) -> str:
        cnt = Counter(s)
        cs = ascii_lowercase + ascii_lowercase[::-1]
        ans = []
        while len(ans) < len(s):
            for c in cs:
                if cnt[c]:
                    ans.append(c)
                    cnt[c] -= 1
        return "".join(ans)

Complexity

Time
O(n × |Σ|)
Space · auxiliary
O(|Σ|)

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1370. Increasing Decreasing String is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Hash Table and Counting.

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
1366Rank Teams by VotesMedium
0299Bulls and CowsMedium
0383Ransom NoteEasy
0387First Unique Character in a StringEasy
0451Sort Characters By FrequencyMedium
0692Top K Frequent WordsMedium

Frequently asked questions

How hard is LeetCode 1370. Increasing Decreasing String?

LeetCode 1370. Increasing Decreasing String is rated Easy on LeetCode.

What is the time complexity of LeetCode 1370. Increasing Decreasing String?

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

What is the space complexity of LeetCode 1370. Increasing Decreasing String?

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

What topics does LeetCode 1370. Increasing Decreasing String cover?

LeetCode 1370. Increasing Decreasing String is tagged Hash Table, String and Counting 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.