Given a string, return its encoding defined as follows: First, the string is divided into the least possible number of disjoint substrings consisting of identical charactersfor example, "aabbbc" is divided into ["aa", "bbb", "c"]Next, each substring with length greater than one is replaced with a concatenation of its length and the repeating characterfor example, substring"bbb" is replaced by "3b"Finally, all the new strings are concatenated together in the same order and a new string is returned.Example
For s = "aabbbc", the output should be lineEncoding(s) = "2a3bc". Input/Output [execution time limit] 3 seconds (java) [input] string s
String consisting of lowercase English letters. Guaranteed constraints: 4 ≤ s.length ≤ 15. [output] string
Encoded version of s. [Java] Syntax Tips // Prints help message to the console// Returns a string/…
My answer is O(n) and just use Math.abs
Given the positions of a white bishop and a black pawn on the standard chess board, determine whether the bishop can capture the pawn in one move.
The bishop has no restrictions in distance for each move, but is limited to diagonal movement. Check out the example below to see how it can move: Example
For bishop = "a1" and pawn = "c3", the output should be bishopAndPawn(bishop, pawn) = true.
For bishop = "h1" and pawn = "h3", the output should be bishopAndPawn(bishop, pawn) = false. Input/Output [execution time limit] 3 seconds (java) [input] string bishop
Coordinates of the white bishop in the chess notation. [input] string pawn
Coordinates of the black pawn in the same notation. [output] boolean true if the bishop can capture the pawn, false otherwise. [Java] Syntax Tips // Prints help message to the console// Returns a string// // Globals declared here will cause a compilation error,// declare variables inside th…