Part 1: Find the next string in Lexicographical_order that matches these rules:
- Must contain three neighboring, ascending letters (
ghi) - Must not contain any of the letters
i,o, orl - Must contain two distinct pairs of letters
Part 1: Find the next string in Lexicographical_order that matches these rules:
ghi)i, o, or lPart 1: Given a list of distances between cities of the form London to Dublin = 464, calculate the shortest route that visits each city exactly once.
Part 1: Given an escaped string of the form "\xa8br\x8bjr\"", convert it to the escaped form: br js. Calculate the total difference of lengths between the former (16) and the latter (5).
Part 1: Given a list of definitions of the form 123 -> x, NOT e -> f, and x AND y -> z, with possible operations NOT, AND, OR, LSHIFT, and RSHIFT, find the value of a. Assume all values are 16-bit integers.
Part 1: Given a 1000 by 1000 grid of lights and a list of instructions of the form (turn on|turn off|toggle) 5,10 through 15,20, determine how many lights are on.
Part 1: A ’nice’ string contains at least three vowels, one double letter (such as xx), and none of the strings ab, cd, pq, or xy. Count nice strings.
Part 1: Mine Adventcoins. Basically, find the lowest integer such that the string {prefix}{integer} has an md5 hash with at least 5 leading zeros. 123
Part 1: Given a string of <>^v characters which mean move west, east, north, or south respectively and starting at the origin, how many unique positions do you pass through?
Part 1: A gift requires enough wrapping paper to cover the surface plus an additional amount equal to the area smallest side. Calculate the total wrapping paper needed for a list of dimensions of the form 2x3x4.