Compress String

January 14, 2022 less than 1 minute read

Given a string lowercase alphabet s, eliminate consecutive duplicate characters from the string and return it.

That is, if a list contains repeated characters, they should be replaced with a single copy of the character. The order of the elements should not be changed.

Constraints

0 ≤ n ≤ 100,000 where n is the length of s

https://binarysearch.com/problems/Compress-String

ExamplesPermalink

Example 1Permalink

Input

s = a

Output

answer = a

Example 2Permalink

Input

s = aaaaaabbbccccaaaaddf

Output

answer = abcadf

SolutionPermalink

	string solve(string s)
	{
	if (s.empty())
	return s;
	ostringstream o;
	char prev = s[0];
	int idx = 1;
	o << prev;

	while (idx < s.length())
	{
	if (s[idx] != prev)
	{
	o << s[idx];
	prev = s[idx];
	}
	idx++;
	}

	return o.str();
	}

view raw Compress-String.cpp hosted with ❤ by GitHub

Share on

Twitter Facebook LinkedIn

Anagram Substrings

October 13, 2022 less than 1 minute read

Given two strings s0 and s1, return the number of substrings where s1 contains any anagram of s0.

Anagram Partitioning

September 27, 2022 1 minute read

You are given two non-empty strings a and b that are the same length. Partition them into substrings such that each pair of a and b’s substring is the same s...

String Equivalence Relations

September 25, 2022 2 minute read

You are given three lowercase alphabet strings a, b and target. Strings a and b have the same length and are defined to be equivalent: a[i] = b[i]. For examp...

Minimum Window Substring

August 31, 2022 less than 1 minute read

Given two lowercase alphabet strings a and b, return the length of a minimum substring in a that contains all the characters of b.

Xuanken Tay