• 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

ADOBE Aptitude C Language Test

Interfaces in C++ (Abstract Classes in C++)

Max Sum in circularly situated Values

Add Sub Multiply very large number stored as string

SAP Off Campus Hiring_ March 2015 Verbal Skills

Number of Islands BFS/DFS

Possible sizes of bus to carry n groups of friends

Print Power Set of a Set

Word Break Problem

Leetcode: Edit Distance

Generic Object Oriented Stack with Template

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Mirror of Tree

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

Urban Ladder Written Test.

Templates in C++

Apriori algorithm C Code Data Mining

Python List

flattens 2 D linked list to a single sorted link list

Coin Collection Dynamic Programming

VMWare Openings

Leetcode: Merge Intervals

Trie Dictionary

Maximum path sum between two leaves

Regular Expression Matching

Find the smallest window in a string containing all characters of another string

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Find the kth number with prime factors 3, 5 and 7

System Design: Designing a LLD for Hotel Booking

Facebook Interview Question : Interleave List

Copyright © 2025 · Genesis Framework · WordPress · Log in