Incedo Interview Experience

Problems in Round: 1

Problem: Finding String Length

How to count characters in a string? (Learn)

Problems in Round: 1

Problem: String Sum

Dhoni is the security administrator of the company you are working and you are junior to him. Dhoni’s job is to come up with new and innovative encryption algorithms to encrypt the data while sending it to the receiver. He came up with a new encryption algorithm as follows: Let’s suppose there is a string ‘STR’ of length ‘N’ which consists of lowercase English letters and numbers from ‘0’ to ‘9’. The above algorithm will first find the total of all the digits occurring in the string ‘STR’ and remove them from the string, then will sort the whole string in alphabetical order and push all digits sum at the end of the above-generated string. In case there is no digit present in the given string, we don't add anything at the end. He is analyzing how effective this algorithm will be so he asked you to automate this process so that he gets the results quicker. So can you help hip to automate this process?. NOTE: The sum of numbers occurring in the string may have more than one digit. EXAMPLE : Input: ‘N’ = 7, ‘STR’ = ac2bew3 Output: abcew5 In this case, the digit occurring in the ‘STR’ is ‘2’ and ‘3’. Their sum is ‘5’. And when we sort the letters in alphabetical order we get “abcew”. Hence the concatenation of both is “abcew5”. Input Format : The first line will contain the integer 'T', the number of test cases. Each test case consists of two lines. The first line of input contains one integer, ‘N’ the length of the string ‘STR’. Followed by a line containing the string ‘STR’ of length ‘N’. Output format : For each test case, print the final string obtained after performing the mentioned steps. Note : You don't need to print anything. It has already been taken care of. Just implement the given function. Constraints : 1 <= ‘T’ <= 10 1 <= ‘N’ <= 10^5 ‘STR’ consists of lowercase letters or digits. It is guaranteed that sum of ‘N’ over all test cases is <= 10^5 Time Limit: 1 sec

Problem Metadata

Problem Type: CODE

Average Solve Time: 10 minutes

Success Rate: 90%

Maximum Score: 80

Practice Topics: Sorting, Strings

Test Cases: 5

Default Language: cpp

Problems in Round: 1

Problem: HR question

Why do u want to join this company?