string - The Poor Coder | Algorithm Solutions (Page 2)

leetcode

Leetcode - Increasing Decreasing String Solution

Given a string s. You should re-order the string using the following algorithm: 1. Pick the smallest character from s and append it to the result. 2. Pick the smallest character from s which is greater than the last appended character to the result and append it. 3. Repeat step

leetcode

Leetcode - Decrypt String from Alphabet to Integer Mapping Solution

Given a string s formed by digits ('0' - '9') and '#' . We want to map s to English lowercase characters as follows: * Characters ('a' to 'i') are represented by ('1' to '9') respectively. * Characters ('j&

leetcode

Leetcode - Remove Sub-Folders from the Filesystem Solution

Given a list of folders, remove all sub-folders in those folders and return in any order the folders after removing. If a folder[i] is located within another folder[j], it is called a sub-folder of it. The format of a path is one or more concatenated strings of the

leetcode

Leetcode - Split a String in Balanced Strings Solution

Balanced strings are those that have an equal quantity of 'L' and 'R' characters. Given a balanced string s, split it in the maximum amount of balanced strings. Return the maximum amount of split balanced strings. Example 1: Input: s = "RLRRLLRLRL" Output: 4 Explanation:

leetcode

Leetcode - Alphabet Board Path Solution

On an alphabet board, we start at position (0, 0), corresponding to character board[0][0]. Here, board = ["abcde", "fghij", "klmno", "pqrst", "uvwxy", "z"], as shown in the diagram below. We may make the following moves: * 'U&

leetcode

Leetcode - Defanging an IP Address Solution

Given a valid (IPv4) IP address, return a defanged version of that IP address. A defanged IP address replaces every period "." with "[.]". Example 1: Input: address = "1.1.1.1" Output: "1[.]1[.]1[.]1" Example 2: Input: address = "255.100.

leetcode

Leetcode - Long Pressed Name Solution

Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times. You examine the typed characters of the keyboard. Return True if it is possible that it was your friends

leetcode

Leetcode - Reverse Only Letters Solution

Given a string S, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positions. Example 1: Input: "ab-cd" Output: "dc-ba" Example 2: Input: "a-bC-dEf-ghIj" Output: "j-Ih-gfE-dCba" Example

leetcode

Leetcode - Find and Replace Pattern Solution

You have a list of words and a pattern, and you want to know which words in words matches the pattern. A word matches the pattern if there exists a permutation of letters p so that after replacing every letter x in the pattern with p(x), we get the

leetcode

Leetcode - Buddy Strings Solution

Given two strings a and b, return true if you can swap two letters in a so the result is equal to b, otherwise, return false. Swapping letters is defined as taking two indices i and j (0-indexed) such that i != j and swapping the characters at a[i] and

leetcode

Leetcode - Goat Latin Solution

A sentence S is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only. We would like to convert the sentence to "Goat Latin" (a made-up language similar to Pig Latin.) The rules of Goat Latin are as follows: * If a word

leetcode

Leetcode - Most Common Word Solution

Given a string paragraph and a string array of the banned words banned, return the most frequent word that is not banned. It is guaranteed there is at least one word that is not banned, and that the answer is unique. The words in paragraph are case-insensitive and the answer