Algorithm to Delete a Character to Make a Valid Palindrome
Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome. Example 1: Input: “aba” Output: True Example 2: Input: …
Category: string
Algorithm to Count the Minimum Add to Make Parentheses Valid
Given a string S of ‘(‘ and ‘)’ parentheses, we add the minimum number of parentheses ( ‘(‘ or ‘)’, and in any positions ) so that the resulting …
The Brace Expansion Algorithms using Breadth First Search or Depth First Search
A string S represents a list of words. Each letter in the word has 1 or more options. If there is one option, the letter is represented as is. …
In-place Run-Length String Compressions using C++
Given an array of characters, compress it in-place. The length after compression must always be smaller than or equal to the original array. Every element of the array should …
Print Strings Right Justified – in a Rectangular Frame
Task: Write a function that takes a list of strings and prints them, one per line, right justified, in a rectangular frame. For example the list gets printed as: …