EV_First Unique Character asked in Infosys march 2022 on hackerrank platform

-

                                                 EV_First Unique Character

connect with me on
Instagram
Github
Youtube
                                                 3. EV_First Unique Character

A unique character is one that appears only once in a string. Given a string consisting of lowercase English letters only, return the index of the first occurrence of a unique character in the string using 1-based indexing. If the string does not contain any unique character, return-1.

Example

s="statistics"

The unique characters are [a, c] among which a occurs first. Using 1-based indexing, it is at index 3.

Function Description

Complete the function getUnique Character in the editor below.

getUniqueCharacter has the following parameter(s):

string s: a string

Returns

int: either the 1-based index or -1

Constraints

• 1 s. length of ss 105

. The string s consists of lowercase English letters only.

►Input Format For Custom Testing

☛ Sample Case O

Constraints

• 1 length of ss 10³

• The string s consists of lowercase English letters only.

✓ Input Format For Custom Testing The first line contains a string, s.

Sample Case 0

Sample Input For Custom Testing

hackthegame

Sample Output

3

Explanation

The unique characters are [c, k tg m) out of which the character c occurs first, at index 3.

Sample Case 1

Sample Input For Custom Testing

falafal

Sample Output

-1

Explanation

All the characters present occur at least twice in the given string. There

are no unique characters.

Constraints

• 1 length of ss 10³

• The string s consists of lowercase English letters only.

✓ Input Format For Custom Testing

The first line contains a string, s.

Sample Case 0

Sample Input For Custom Testing

hackthegame

2

Sample Output

3

3

Explanation

The unique characters are [c, ktg m] out of which the character c occurs first, at index 3.

Sample Case 1

Sample Input For Custom Testing

falafal

Sample Output

-1

Explanation

All the characters present occur at least twice in the given string. There are no unique characters.




Practise on live C++ Compiler
connect with me on
Instagram
Github
Youtube

Comments

Post a Comment

Popular posts from this blog

EV Minimize Array Cost asked in Infosys- march 2022 (available in c++ only)

-
                                                             EV_Minimize Array Cost connect with me on Facebook Twitter Instagram Github Youtube len(arr)-1 Σ(arri-arri-1)² i=1 len(arr) is the size of the array. Insert any integer at any location of the array such that the cost of the array is minimized. Find the minimum possible cost of the array after inserting exactly one element. Example a= [1, 3, 5, 2, 10] The cost of the array before insertion =(1-37+(3-57+(5-2)²+(2-102²= 81. Two of many scenarios are shown below. 1. Insert 4 between 3 and 5, cost of array = (1-37+(3-47+(4-57+(5-2)²+(2 107²2² = 79. 2. Insert 6 between 2 and 10, cost of array =(1-37+(3-5)+(5-27²+(2-67² + (6 107² = 49. It can be proven that 49 is the minimum cost possible. Return 49. Function Description Complete the function getMinimumCost in the editor below. mumest fas the following parameter arrfet an array of ietsge
Read more

Harry and Porter asked in MountainBlue ,2022

-
                                                          Problem Statement   Harry and Potter choose a word string. Harry chose a number M  (less than the length of the string) and Potter chose N (less than the length of the string).  Harry will cut M letters from the end of the string, add them to the beginning and will give it to Potter. Then, Potter will also cut N letters from the end of the string,  add it to the beginning and give it to Harry. This process will continue till they get the original word string back.  For a given string and given values of M and N, find the number of turns in which they will get the original word string back . Example If the string is AbcDef, M= 1 and N = 2 the Output must be 4 4604  Explanation This is how the words tend will change. Abcbef > fAbcDe Dejbes- cDefAb AbcDef As there are 4 steps needed to bring the.....................
Read more

For e-learning, various tutorials are provided to the students.

-
Image
 For e-learning, various tutorials are provided to the students. One of the tutorials shows the highlighter on a number A on the number line. There is a "jump" button in the tutorial. On pressing the "jump" button, the highlighter moves by a fixed number D towards the right side if D is positive and towards the left side if D is negative. The student has to press the button N number of times. The tutorial has various sets of exercises. For every exercise, the positions of the highlighter before every "jump" button press will be stored in the database. Write an algorithm to find the position of the highlighter before.....
Read more