• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Given a string, find the first character which is non-repetitive

April 13, 2014 by Dhaval Dave

Given a string, find the first character which is non -repetitive i.e that character must not be present anywhere else in the string.

With two different solutions.

Eg : Input : teeterson      
     Output : r, as it is the first element which 
                        is non repetitive.

Solution 1 :

1) Scan the string from left to right and construct the count array.
2) Again, scan the string from left to right and check for count of 
each character, if you find an element who's count is 1, return it.

Time Complexity : O(2N)= O(N)
Space Complexity : O(N)

Solution 2 :

To reduce Time for searching , we can use Hashmap.
Benefit from previous solution:
to get count for 2,3 etc we can easily use this function with little modification
To search for count 1, no need to iterate array again.

map < int , character > m;
map < int , character > : iterator it;
void *getNonRepChar(char *str)
{
    int *count = (int *)calloc(sizeof(int), NO_OF_CHARS);
    int i;
    for (i = 0; *(str+i);  i++){
       count[*(str+i)]++;
       m.insert(make_pair(count,*(str+i)));
    }//for ended
  return count;
}//function ended

 it.find(1);
 if(it != end() ){
   // element found
   character op = it->second ; 
   printd (" %c has count %d" ,op,1); 
  }
 else  
 printf ("Not found Such element");

Time Complexity : O(N)
Space Complexity : O(N)

-IF YOU LIKE OUR EFFORT, PLEASE LIKE AND SHARE OUR FB-PAGE AND SITE

Similar Articles

Filed Under: Hacker Earth Questions, Interview Questions, problem Tagged With: string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Doubly linked list

Reverse a Linked List in groups of given size

Amazon Interview Experience – SDE Chennai

Code Chef PRGIFT Solution

Find the number ABCD such that when multipled by 4 gives DCBA.

The Magic HackerEarth Nirvana solutions Hiring Challenge

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Maximum of all subarrays of size k

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

DFS (Depth First Search)

Find min element in Sorted Rotated Array (With Duplicates)

Given Set of words or A String find whether chain is possible from these words or not

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Subset Sum Problem Dynamic programming

Leetcode: Edit Distance

Generate next palindrome number

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Search element in a matrix with all rows and columns in sorted order

strtok()

Given a float number convert it into the string WITHOUT using any inbuilt Function

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Python Dictionaries

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Convert number to words java

Get Minimum element in O(1) from input numbers or Stack

Spanning Tree

ADOBE Aptitude C Language Test

Linked List V/S Binary Search Tree

Handle duplicates in Binary Search Tree

Print vertical sum of all the axis in the given binary tree

Copyright © 2026 · Genesis Framework · WordPress · Log in