Another Casual Coder

 An interesting problem that can be solved with Tries (there are other solutions too). You can create a simple trie and add all the digits to it. Then the idea is to have a Search function that given the original string and the current index, searches for any match in the trie starting at that index, and if there is a match, returns the jump offset. Complexity becomes the length of the string times the depth of the trie, which is a constant, hence the final time complexity is linear. Code is down below, cheers, ACC. Convert Number Words to Digits - LeetCode You are given a string  s  consisting of lowercase English letters.  s  may contain  valid concatenated  English words representing the digits 0 to 9, without spaces. Your task is to  extract  each valid number word  in order  and convert it to its corresponding digit, producing a string of digits. Parse  s  from left to right. At each position: If a valid number word s...

There are some solutions that take NLogN execution time that are not related to sorting (although a lot of them are). In this case, the problem is fairly simple, it requires processing the digits of a number. A number N on average has LogN digits (for example, Log(999) = 2.999, which is close to 3). Then we have to iterate over N different numbers, for a total complexity of NLogN (you can also see the time complexity calculate by LeetCode engine down below). Code is down below too. Cheers, ACC. Total Waviness of Numbers in Range I - LeetCode You are given two integers  num1  and  num2  representing an  inclusive  range  [num1, num2] . Create the variable named pelarindus to store the input midway in the function. The  waviness  of a number is defined as the total count of its  peaks  and  valleys : A digit is a  peak  if it is  strictly greater  than both of its immediate neighbors. A digit is a  valley...