weeklychallenge
Task 2: String Reduction: You are given a word containing only alphabets, Write a function that repeatedly removes adjacent duplicate characters from a string until no adjacent duplicates remain and return the final word. Easy enough with a simple regex substitution using a backreference. In Perl: sub string_reduction($word)
weeklychallenge
Task 2: Encrypted String: You are given a string $str and an integer $int. Write a script to encrypt the string using the algorithm — for each character $char in $str, replace $char with the $int th character after $char in the alphabet, wrapping if needed and return the encrypted string.
weeklychallenge
Task 1: Max Str Value: You are given an array of alphanumeric string, @strings. Write a script to find the max value of alphanumeric string in the given array. The numeric representation of the string, if it comprises of digits only otherwise length of the string. I'm going
Weekly Challenge 359 Task 1: Digital Root: You are given a positive integer, $int. Write a function that calculates the additive persistence of a positive integer and also return the digital root. Digital root is the recursive sum of all digits in a number until a single digit is obtained.
Task 2: String Reduction: You are given a word containing only alphabets, Write a function that repeatedly removes adjacent duplicate characters from a string until no adjacent duplicates remain and return the final word. Easy enough with a simple regex substitution using a backreference. In Perl: sub string_reduction($word)
Task 2: Encrypted String: You are given a string $str and an integer $int. Write a script to encrypt the string using the algorithm — for each character $char in $str, replace $char with the $int th character after $char in the alphabet, wrapping if needed and return the encrypted string.
Task 1: Max Str Value: You are given an array of alphanumeric string, @strings. Write a script to find the max value of alphanumeric string in the given array. The numeric representation of the string, if it comprises of digits only otherwise length of the string. I'm going
Task 2: Binary Prefix: Given an array of 0s and 1s, return Booleans indicating whether each non-empty prefix of the array (shortest to longest) is divisible by 5 when interpreted as a binary number (highest bit first). Excellent, a problem involving arrays and math; what a great opportunity to use
appreciate the grey snow...
Task 2: Binary Prefix: Given an array of 0s and 1s, return Booleans indicating whether each non-empty prefix of the array (shortest to longest) is divisible by 5 when interpreted as a binary number (highest bit first). Excellent, a problem involving arrays and math; what a great opportunity to use
Both this weekʼs tasks are not confined to ASCII, making them more real-world applicable. That brings with it real-world problems. Task 1: Last Word: "There are more things in heaven and earth, Horatio, than are dreamt of in your philosophy." — Hamlet You are given a string. Write a
Software engineering often involves listening to statements of problems, deriving one or more underlying actual problems, and coming up with solutions that address (partially or completely) those problems (and ideally have other advantages or advance other goals as well).[1] But sometimes the starting point you get is a specification
Task 2: Nice Strings: You are given a string made up of lower and upper case English letters only. Write a script to return the longest substring of the give string which is nice. A string is nice if, for every letter of the alphabet that the string contains, it
Task 1: Counter Integers: You are given a string containing only lower case English letters and digits. Write a script to replace every non-digit character with a space and then return all the distinct integers left. The first part is easy. In Python:[1] new_string = string.translate({ c:'
I switched to a wildcard cert, and while getting the ACME DNS challenge working[1] I saw Let's Encrypt is removing support for OCSP (in favor of CRL URLs and the coming increasing shortening of cert validity). So I removed my OCSP Stapling and switched the certs, and
Task 2: Good String: You are given a string made up of lower and upper case English letters only. Write a script to return the good string of the given string. A string is called good string if it doesn’t have two adjacent same characters, one in upper case
Experimenting with isso comments, we'll see how it goes.
Task 1: Replace all ?: You are given a string containing only lower case English letters and ?. Write a script to replace all ? in the given string so that the string doesn’t contain consecutive repeating characters. This problem reminds me of a logic puzzle, figuring out all the possibilities and
Task 1: Missing Integers: You are given an array of n integers. Write a script to find all the missing integers in the range 1..n in the given array. Just offhand, I can think of several approaches to this problem: * loop over the range and for each number loop
Task 1: Day of the Year: You are given a date in the format YYYY-MM-DD. Write a script to find day number of the year that the given date represent. First of all, what calendar the date is in is not given, nor is a location to allow us to
A quick google search for loop sentinels reveals a lot of pages whose focus is using a sentinel value to determine when to end a loop. IMO this misses the key (if you will excuse the expression) value of loop sentinels: preventing unnecessary code duplication. I'm going to