Questions tagged [string-manipulation]

String-manipulation problems are problems where given a sting / a set of strings, the goal is to compute a string satisfying given constraints (usually resulting from input string(s) by adding, removing or permuting characters).

Filter by
Sorted by
Tagged with
1
vote
1answer
41 views

Lexicographically Smallest String

Problem Statement: Given a string/pattern only consisting of '<' and '>' symbol, find the lexicographically smallest string that satisfies the pattern(made up of only lowercase english alphabets)...
1
vote
2answers
632 views

What is the time complexity of this “reverse words” algorithm?

I had to write an algorithm that, given the input ['h', 'a', 'r', 'd', ' ', 'i', 's', ' ', 'c', 's'] would return ...