Write a java program to find first non-repeating character in a string. Given an input string, Write a java code to find first non-repeating character in a string.
For example –
i) Input string – java
Output – j (j is the first non-repeating character)
ii) Input string – web rewrite
Output – b (b is the first non-repeating character)
Given two strings, write a code to check whether two strings are anagram of each other or not. In this tutorial, I am going to discuss multiple approaches and their java implementation to check if two strings are anagrams or not.
Let’s first understand what is an anagram? and how we are going to solve this problem.
Two strings are said to be anagrams of each other if it contains the same characters, only the order of characters in both the strings is different. In other words, both strings must contain the same exact letters in the same exact frequency.