Comments

Post a Comment

Popular posts from this blog

Hackerrank - Quicksort 2 - Sorting

Image
     Problem Submissions Leaderboard Discussions In the previous challenge, you wrote a partition method to split an array into two sub-arrays, one containing smaller elements and one containing larger elements than a given number. This means you 'sorted' half the array with respect to the other half. Can you repeatedly use partition to sort an entire array? Guideline In Insertion Sort, you simply went through each element in order and inserted it into a sorted sub-array. In this challenge, you cannot focus on one element at a time, but instead must deal with whole sub-arrays, with a strategy known as "divide and conquer". When partition is called on an array, two parts of the array get 'sorted' with respect to each other. If partition is then called on each sub-array, the array will now be split into four parts. This process can be repeated until the sub-arrays are small. Notice that when partition is called on just one of the numbers, the...
Read more

Product Sum - Interviewbit

Product Sum Understanding the problem We are given a "special" array, which contains integers and optionally other "special" arrays. We are asked to write a function that is going to return the sum of the elements in the "special" array. If the element is a "special" array, we need to sum up the elements in the "special" array and then multiply the sum by the depth of the "special" array. For instance, if the input array is  [3, [4, 5]] , then the result should be  3 + 2 * (4 + 5) = 21 ; if the input array is  [6, [4, [5]]] , then the result should be  6 + 2 * (4 + 3 * 5) = 44 . Approach One might notice that the "special" array has a recursive structure. Therefore, the problem can be solved recursively. We are going to have a recursive function which takes in a "special" array and the depth of the "special" array as arguments. The depth of the initial input array is going to be  1 . The recursive...
Read more

Code Goda 2022 - Special Numbers

Problem Statement - 1 Mr. Agoji given a shuffled string made by randomly shuffling a special string.  A string will be called special only if it is formed by joining some special words any number of times. Special words are mapping of numbers (0 <= number < 10) to their words, for example, mapping of '0' to 'zero', mapping of  '1' to 'one', and so on.  Mr. Agoji is asked to convert the shuffled string into smallest special number. A special number is a number formed using numbers (0 <= number < 10) without any leading zeroes.  Mr. Agoji being not so good with numbers and strings ask for your help. Input Format  The first line of the input T contains the number of test cases,  1 <= T <= 100 For each test case.  There will be a, s shuffled string, on a separate line   1 <= s.length <= 100000  Output Format  For each test case, on the new line print the special number and if all the numbers are zero print z...
Read more