Unique Characters

PKJ

 Unique Characters 

 Problem Statement: 
The program must accept a string S as the input. The program must find the unique characters present in the string (remove duplicates) and print them in the order of their occurrence in the string S.
Note: At least one unique character will be present in the string S.

Boundary Condition(s):
1 <= Length of S <= 100

Input Format:
The first line contains the string S.

Output Format:
The first line contains the unique characters in S (in the order of their occurrence in S).

 Example Input/Output 1: 
 Input: 
Ethernet112

 Output: 
Ehrn2

Explanation:
The unique characters in the string "Ethernet112" are E, h, r, n and 2.
So they are printed in the order of their occurrence in the string "Ethernet112".
Hence the output is Ehrn2.

Example Input/Output 2:
Input:
lollipop

Output:
i

 Note: Max Execution Time Limit: 2000 millisecs 

 Solution: 

 Programming Language: C Language 

#include <stdio.h>
#include <stdlib.h>
int main() {
    char a[101];
    scanf("%s",a);
    int charc[128]={0};
    for(int i=0;a[i]!='\0';i++){
        charc[a[i]]++;
    }
    for(int i=0;a[i]!='\0';i++){
        if(charc[a[i]]==1){
            printf("%c",a[i]);
        }
    }
}

//Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Print Alphabets

PKJ
 Coding Problem Keys   Print Alphabets   Problem Statement  Given two alphabets C1 and C2 as input, the program must print the alphabets from C1 to C2 (inclusive of C1 and C2).  Boundary Condition(s)  a <= C1 < z C1 < C2 <= z  Input Format  The first line contains the two alphabets C1 and C2 separated by space(s).  Output Format  The first line contains the alphabets from C1 to C2 (inclusive of C1 and C2) separated by a space.  Example Input/Output 1   Input  a d   Output  a b c d   Explanation  The alphabets from a to d is abcd . Hence the output is a b c d .  Example Input/Output 2   Input  g l  Output  g h i j k l   Explanation  The alphabets from g to l is ghijkl . Hence the output is g h i j k l .  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  a,b= input ...
Click to Continue...

Sort Number By Unit and Tenth Digits

PKJ
 Coding  Problem  Keys   Sort Number By Unit and Tenth Digits    Problem Statement  Given N positive integers, the program must sort the numbers based on their unit digits (Smaller to larger). If the unit digits are same, then consider tenth digit to sorts. Assume no two numbers will have both unit and tenth digits equal.  Input Format  The first line contains N. The second line contains N integers separated by a space.  Output Format  The first line contains the sorted integers separated by a space.  Boundary Conditions  1 <= N <= 100  Example Input/Output 1   Input  9 12 223 10 4345 189 9 455 61 82  Output  10 61 12 82 223 4345 455 9 189  Note:  Max Execution Time Limit: 5000 millisecs   Solution:   Programming Language: Python 3 Language  n= int ( input ()) l= input ().split() k= sorted ([i[::- 1 ] for i in l]) print (*[i[::- 1 ] for i ...
Click to Continue...

Move Hundreds to End

PKJ
 Coding Problem Keys   Move Hundreds to End   Problem Statement  Fill in the missing lines of code to implement the method  (function) moveHundreds (int array[], int size) so that the method moves all the integer values with 100 to the end of the array. The order of the remaining integers must be maintained.  Boundary Condition(s)  1 <= N <= 1000  Example Input/Output 1   Input  6 12 100 45 8 100 25   Output  12 45 8 25 100 100   Explanation  There are two integer values as 100 which are moved to the end. The remaining integers 12 45 8 25 are printed in the same order as given in the input.  Example Input/Output 2   Input  8 100 100 65 100 14 100 100 56   Output  65 14 56 100 100 100 100 100  Max Execution Time Limit: 4000 millisecs   Solution   Programming Language: C Language  void moveHundreds ( int array[], int size){ int ar...
Click to Continue...

Matrix Unit Digit Swap

PKJ
 Coding Problem Keys   Matrix Unit Digit Swap   Problem Statement  The program must accept an integer matrix of size R*C, where C is even and swap the unit digits of the elements in columns 1 and 2, then 3 and 4 and so on till columns C-1 and C. Then the program must print the revised matrix as the output.  Input Format  The first line contains the value of R and C separated by space(s). The next R lines each containing C integer values separated by a space.  Output Format  R lines each containing C integer values separated by a space.  Constraints  1 <= R, C  <= 100 1 <= Value of an element in the matrix <= 1000  Example Input/Output 1   Input  3 4 96 61 138 32 150 67 131 177 172 103 83 45   Output  91 66 132 38 157 60 137 171 173 102 85 43  Max Execution Time Limit: 1000 millisecs   Solution   Programming Language: Python 3 Language  r,c= map ( int ,...
Click to Continue...

Array Elements - Divisible by D

PKJ
 Coding Problem Keys   Array Elements - Divisible by D   Problem Statement  An array of N positive integers are passed as input. D which is a positive integer is also passed as the input. The program must print the elements in the array which are divisible by D.  Boundary Condition(s)  2 <= N <= 10000 1 <= D <= 9999  Input Format  The first line contains the value of N. The second line contains the N values, each separated by a space. The third line contains the value of D.  Output Format  The first line contains the elements among the array which are divisible by D, with each value separated by a space.  Example Input/Output 1   Input  6 10 20 30 40 50 60 4  Output  20 40 60  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  n= int ( input ()) l= list ( map ( int , input ().split())) d= int ( input ()) ...
Click to Continue...

Next Multiple of X after N

PKJ
 Coding Problem Keys    Next Multiple of X after N    Problem Statement  The program must accept two integers N and X as the input. The program must print the next multiple of X after N as the output.  Input Format  The first line contains N and X separated by a space.  Output Format  The first line contains the next multiple of X after N.  Boundary Condition(s)  1 <= N, X < 10 ⁷  Example Input/Output 1   Input  147 20   Output  160  Explanation  The next multiple of 20 after 147 is 160 . Hence the output is 160.  Example Input/Output 2   Input  20 10   Output  30  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  # Published By PKJCODERS  ( Note:  Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 
Click to Continue...