{"id":1846,"date":"2020-07-01T09:37:36","date_gmt":"2020-07-01T09:37:36","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=1846"},"modified":"2022-03-30T23:06:07","modified_gmt":"2022-03-30T23:06:07","slug":"print-first-non-repeating-character-in-a-string","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/print-first-non-repeating-character-in-a-string\/","title":{"rendered":"Print first Non-repeating character in a string"},"content":{"rendered":"

\"\"<\/p>\n

Concepts Used:<\/h3>\n
\n

Hashing.<\/p>\n<\/blockquote>\n

Difficulty Level:<\/h3>\n
\n

Easy.<\/p>\n<\/blockquote>\n

Problem Statement :<\/h3>\n
\n

You are given a string str consisting of lowercase Latin letters. Find the first non-repeating character in str.<\/p>\n

Note:<\/em><\/strong> You have to traverse the string only once.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

Tets Case:<\/h3>\n
Input:\nprepbytes\n\nOutput:\n1\n\nExplanation:\nIn the string 'prepbytes', we start traversing from the first index(since first non repeating character is to be answered).\n'p' does not satisfy the criteria because it is repeated at index 3. 'r' is the first char which is non repeating.<\/code><\/pre>\n
Solving Approach:<\/h3>\n
\n
    \n
  1. This problem can be easily solved with hash maps(hashing).<\/li>\n
  2. Start from 0th index and store the frequency of each letter.<\/li>\n
  3. Run another loop wich checks the first element with 1 as the frequency.<\/li>\n<\/ol>\n<\/blockquote>\n
    Solutions:<\/h3>\n
    \t\t\t\t\t\t