Company: Wells Fargo
Difficulty: medium
Count of Non-Repeated Characters The current selected programming language is C++14. We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. You can use cout to debug your code. The cout may not work in case of syntax/runtime error. The version of GCC being used is 5.5.0. A data compression software uses various steps to compress a string of data. One of the steps involves finding the count of characters that are not repeated in the string. Write an algorithm for the software developer to find the count of characters that are not repeated in the string. Input Format The input consists of a string compString , representing the string to be compressed. Output Format Print an integer representing the count of characters that are not repeated in the string. If no such character is found or the input string is empty, then print 0 . Constraints 0 ≤ length of compString Note The input string compSt