Be the first user to complete this post

  • 0
 Add to List
Beginner

214. Find the last non repeating character in a given string.

Objective: Given a string, write an algorithm to find the last non-repeating character in it.

Example:

String input = "algorithms tutorials"
Output: 'u'

String input = "aabbccdd"
Output: No repeating character found.

Approach:

Naive approach: This problem can be easily solved using two nested loops from right to left. Take each character from the outer loop and check the character in the rest of the string using the inner loop and return the first character which is nonrepeating (from right to left).  Time complexity is O(N^2).

Better approach: Using extra space

  • Iterate the string from right to left.
  • Count the occurrence of each character and store it on a map.
  • Iterate the string again from right to left and check if the character has count = 1 in the map created in the previous step, if yes then return that character.
  • If none of the characters has count = 1 in the map, return null.




import java.util.HashMap;

public class Main {
    public static Character getCharacter(String input){
        //remove all the spaces
        input = input.replaceAll(" ", "");
        Character nonRptChar = null;
        //Will store each character and it's count
        HashMap<Character, Integer> map = new HashMap<>();
        for (int i = 0; i <input.length(); i++) {
            Character chr = input.charAt(i);
            if(map.containsKey(chr)){
                map.put(chr,map.get(chr)+1);
            }else{
                map.put(chr, 1);
            }
        }
        //Iterate the string from right to left and return the character for which the count is 1 in map
        for (int i = input.length()-1; i >=0; i--) {
            if(map.get(input.charAt(i))==1){
                nonRptChar = input.charAt(i);
                break;
            }
        }
        return nonRptChar;
    }

    public static void main(String[] args) {
        String input = "algorithms tutorial";
        Character result = getCharacter(input);
        if(result!=null){
            System.out.println("Last Non Repeating Character in '"+input+"' is: " + result);
        }else{
            System.out.println("No Repeating Character found");
        }
    }
}



def get_character(input_str):
    input_str = input_str.replace(" ", "")
    char_count = {}

    for char in input_str:
        if char in char_count:
            char_count[char] += 1
        else:
            char_count[char] = 1

    for char in reversed(input_str):
        if char_count[char] == 1:
            return char

    return None

if __name__ == "__main__":
    input_str = "algorithms tutorial"
    result = get_character(input_str)
    if result:
        print(f"Last Non Repeating Character in '{input_str}' is: {result}")
    else:
        print("No Repeating Character found")



package main

import "fmt"

func getCharacter(input string) rune {
	charCount := make(map[rune]int)

	for _, char := range input {
		if char != ' ' {
			charCount[char]++
		}
	}

	for i := len(input) - 1; i >= 0; i-- {
		char := rune(input[i])
		if charCount[char] == 1 {
			return char
		}
	}

	return 0
}

func main() {
	input := "algorithms tutorial"
	result := getCharacter(input)
	if result != 0 {
		fmt.Println("Last Non Repeating Character in '" + input + "' is: " + string(result))
	} else {
		fmt.Println("No Repeating Character found")
	}
}

Output:

Last Non Repeating Character in 'algorithms tutorials' is: u

Related Problems: