• 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

Stock Buy Sell to Maximize Profit

Count number of ways to reach a given score in a game

Level order traversal in Spiral form

Amazon Interview On-Campus For Internship – 1

Find min element in Sorted Rotated Array (Without Duplicates)

Check if an array has duplicate numbers in O(n) time and O(1) space

Circular Linked List

1014 Practice Question of New GRE – Princeton

C Program for TAIL command of UNIX

DFS (Depth First Search)

Binary Tree Isomorphic to each other

Given a sorted array and a number x, find the pair in array whose sum is closest to x

SAP Off Campus Hiring_ March 2015 Computer Skills

VMWare SDEII Interview

Amazon Interview Experience – SDE Chennai

Hackerearth : Counting Subarrays

Sort an array according to the order defined by another array

Trapping Rain Water

Calculate price of parking from parking start end time prices

Serialise Deserialise N-ary Tree

Diagonal Traversal of Binary Tree

Microsoft BING Interview Experience

ADOBE Aptitude C Language Test

Daughter’s Age VeryGood Puzzle

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

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

Maximum occurred Smallest integer in n ranges

Convert number to words java

Cisco Hiring Event 21st – 22nd Feb 2015

Find min element in Sorted Rotated Array (With Duplicates)

Copyright © 2026 · Genesis Framework · WordPress · Log in