problem no 65: check if the string is isogram or not.

-

 problem:

Given a string S of lowercase alphabets, check if it is isogram or not. An Isogram is a string in which no letter occurs more than once.

Example 1:

Input:
S = machine
Output: 1
Explanation: machine is an isogram
as no letter has appeared twice. Hence
we print 1.

Example 2:

Input:
S = geeks
Output: 0
Explanation: geeks is not an isogram
as 'e' appears twice. Hence we print 0.

Your Task:
This is a function problem. You only need to complete the function isIsogram() that takes a string as a parameter and returns either true or false.



code:


 bool isIsogram(string s)

    {

        unordered_map<char,int> mapp;

        for(char element:s)

        {

            mapp[element]++;

        }

       int flagforisogram=1;

        for(auto ele:mapp)

        {

            if(ele.second>1)

            {

                flagforisogram=0;

            }

        }

        if(flagforisogram==1)

        {

        return true;    

        }

        else

        {

            return false;

        }

        

    }

Comments

Post a Comment

Popular posts from this blog

problem no 18: number of buildings that can see the sun . ( or facing the sun.)

-
Image
 QUESTION: Given an array H representing heights of buildings. You have to count the buildings which will see the sunrise (Assume : Sun rise on the side of array starting point). Example 1: Input: N = 5 H[] = {7, 4, 8, 2, 9} Output: 3 Explanation: As 7 is the first element, it can see the sunrise. 4 can't see the sunrise as 7 is hiding it. 8 can see. 2 can't see the sunrise. 9 also can see the sunrise. Example 2: Input: N = 4 H[] = {2, 3, 4, 5} Output: 4 Explanation: As 2 is the first element, it can see the sunrise. 3 can see the sunrise as 2 is not hiding it. Same for 4 and 5, they also can see the sunrise.        ANSWER:   int countBuildings(int h[], int n) { int count=0; int max=INT_MIN; for(int i=0;i<n;i++) { if(h[i]>max) { count=count+1; max=h[i]; } } return count; }  
Read more

problem no 7:Given two numbers A and B, find Kth digit from right of AB.

-
 QUESTION: Given two numbers A and B , find K th digit from right of A B .   Example 1: Input: A = 3 B = 3 K = 1 Output: 7 Explanation: 3 3 = 27 and 1st digit from right is 7 Example 2: Input: A = 5 B = 2 K = 2 Output: 2 Explanation: 5 2 = 25 and second digit from right is 2. ANSWER: int kthDigit(int A,int B,int K){      long long int num=pow(A,B);      int count=0;      int rem;      while(num>0)      {                    rem=num%10;                    num=num/10;          count=count+1;          if(count!=K)          {         ...
Read more

problem 3: given two integers N and M. The problem is to find the number closest to N and divisible by M. If there are more than one such number, then output the one having maximum absolute value.

-
  Closest Number Given non-zero two integers N and M . The problem is to find the number closest to N and divisible by M . If there are more than one such number, then output the one having maximum absolute value .   Example 1: Input: N = 13 , M = 4 Output: 12 Explanation: 12 is the Closest Number to 13 which is divisible by 4. Example 2: Input: N = -15 , M = 6 Output: -18 Explanation: -12 and -18 are both similarly close to -15 and divisible by 6. but -18 has the maximum absolute value. So, Output is -18   ANSWER:   int closestNumber(int n , int m) { int q = n / ...
Read more