Array ( [0] => [1] => questions [2] => Strings [3] => Non-repeating-Character )
Given a string K. You have to find the first non repeating character from given string.
First line contains the string K.
Print the first non repeating character.
maximum
a
knowledge is divine
k
he is my favourite hero
i
Login to see Discussion
Approach 1: using Brute Force
step-i) initialize a character answer to null
step-ii) initialize i to O
step-iii) assign 0 to count
step-iv) assign i to j
step-v) if i equal to j go to step vii
step-vi) if character at i is equal to character at j of strinng then increment the count
step-vii)increment j by one value
step-viii) repeat steps vi and vii till j is less than length of string
step-ix)if count equal to 0 assign character at index i of string to answer and go to step xii
step-x) increment i by one value
step-xi)repeat steps iii to x till i is less than length of string
step-xii) return the count
Time Complexity: O(n^2)
Space Complexity: O(1)
Approach 2: using hashing
step-i) create a char array count of size 256
step-ii) traverse through string increment the value of count array at index equal to ascii value of character of string
step-iii) initialize character answer to null
step-iv) assign 0 to i
step-v) check if the value of count at index equal to ascii of character at i position of string is 1
step-vi) if it is 1 assign that character to answer and go to ix
step-vii) increment i value by one
step-viii) repeat steps v to vii till i is less than length of string
step-ix) return answer
Time Complexity: O(n)
Space Complexity: O(1)
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution