Skip to main content

First Unique Character in the String | Interview Question

Introduction:
In this tutorial we are going to solve a very famous interview problem "first unique character in the string".

Problem Statement:
We have a string. and then we have to find very first character present in the string which is unique.
It means we have to return very first character of the string, whose frequency(count) is 1 in the string.
eg: string="hehemon"
     Output: m

Solution:
In this type of problem we prefer hashmap to easily solve the problem. so what we are going to do is, first of all we are going to create a hashmap. and we will store the character as key and index of character as value.
Trick:
whenever the frequency of character is greater than 1. then we will make the value part of that character -1 in the hashmap. it means now this character is not unique. it's frequency is more than 1.

After iterating whole string, we will have a hashmap. In which we have characters and it's index. and if the frequency of character is more than one then we will simply make the index part of that character -1.

Now we will iterate over hashmap, and we will keep a min_index variable to get the minimum index, which is unique. and at the end the value of min_index will be our answer.

Full Code:
Note: we are taking char c for edge cases.

 char firstUniqChar(string &str) {

        char c='0';

        map<char,int>m;

        for(int i=0;i<str.size();i++){

            if(m.find(str[i])!=m.end()){

                auto it=m.find(str[i]);

                it->second=-1;

            }

            else{

                m.insert(make_pair(str[i],i));

            }

        }

        int flag=0;

        int min_index = INT_MAX;

        for(auto it=m.begin();it!=m.end();it++){

            if(it->second!=-1){

                if(it->second<min_index){

                    min_index=it->second;

                    flag=1;

                }

            }

        }

        if(flag)

        return str[min_index];

        else{

            return c;

        }

Conclusion:

whenever you see string problems like this one. and you have no idea that how we can solve this problem. then hashmap is always an option for you. hashmap is easy and efficient. it reduces our time complexity.


Best of luck.




Comments

Post a Comment

Popular posts from this blog

Disjiont Set Union-Find Data Structure | Code In C++

 Introduction:  In this tutorial we are going to write full program of disjoint set union find advance data structure in c++.  Problem Description: Disjoint Set Union (DSU) is an advance data structure, which basically uses in graph algorithms to find cycles. Codes:  Method1: Brute Force #include<bits/stdc++.h> using namespace std; int find(int f,vector<int>&dsuf){     if(dsuf[f]==-1)         return f;     return find(dsuf[f],dsuf); } void union_op(int from, int to, vector<int>& dsuf){     dsuf[from]=to; } bool isCycle(vector<pair<int,int> >&edge_list, vector<int>&dsuf){     for(int i=0;i<edge_list.size();i++){         int parent1=find(edge_list[i].first,dsuf);         int parent2=find(edge_list[i].second,dsuf);         if(parent1==pare...
Post a Comment
Read more

Construct Binary Tree from preorder and inorder | Data Structure

Introduction: In this tutorial we are going to see how we can construct the binary tree from given preorder and inorder. Prerequisites: you should know about binary tree traversal and on paper you can draw binary tree from given preorder and inorder traversal. Inorder:left->root->right; Preorder:root->left->right; Problem Statement: we have given two arrays. one for preorder and another for inorder. by using these two array we have to built a binary tree. eg: preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] solution: Solution: We will follow recursive approach to solve this question.let's discuss how we can solve it. Trick: In the given preorder the very first element will be the root of the tree. then we will find root element in inorder also. and we know in inorder traversal we have left part then root and then right part of the tree. by using preorder we can get the root of the main tree and by using inorder and root we can get the left part and right part of the...
Post a Comment
Read more

Target Sum | Backtracking Problem

Introduction: In this tutorial we are going to solve a problem "Target Sum" which is from leetcode. and believe me it's really a good problem to understand Backtracking(Recursion). and if you try to understand the problem as well as code you will get a clear picture of Backtracking. Problem Statement: Link To Problem You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and - . For each integer, you should choose one from + and - as its new symbol. Find out how many ways to assign symbols to make sum of integers equal to target S. Input: nums is [1, 1, 1, 1, 1], S is 3. Output: 5 Explanation: -1+1+1+1+1 = 3 +1-1+1+1+1 = 3 +1+1-1+1+1 = 3 +1+1+1-1+1 = 3 +1+1+1+1-1 = 3 There are 5 ways to assign symbols to make the sum of nums be target 3. Solution: As given in question, we have two operation + and -. so we will make recursive call for + and - . and if we have sum as target and we have reached upto the last ind...
Post a Comment
Read more