Software Engineer

Step 1: Split the given inputString into words using split() method.
Step 2: Then take each individual word, reverse it and append to reverseString.
Step 3: print reverseString.

public class ReverseEachWord
{
static void reverseEachWordOfString(String inputString)
{
String[] words = inputString.split(" ");

String reverseString = "";

for (int i = 0; i < words.length; i++) 
{
String word = words[i];

String reverseWord = "";

for (int j = word.length()-1; j >= 0; j--) 
{
reverseWord = reverseWord + word.charAt(j);
}

reverseString = reverseString + reverseWord + " ";
}

System.out.println(inputString);

System.out.println(reverseString);

System.out.println("-------------------------");
}

public static void main(String[] args) 
{
reverseEachWordOfString("Java Concept Of The Day");

reverseEachWordOfString("Java J2EE JSP Servlets Hibernate Struts");

reverseEachWordOfString("I am string not reversed");

reverseEachWordOfString("Reverse Me");
}
}

Step 1 : Create one HashMap object called elementCountMap with elements of inputArray as keys and their occurrences as values.

Step 2 : Check every element of inputArray for its presence in elementCountMap.

Step 3 : If an element is already present in elementCountMap, increment it’s count by 1.

elementCountMap.put(i, elementCountMap.get(i)+1);

Step 4 : If an element is not present in elementCountMap, add this element to elementCountMap with 1 as it’s value.

elementCountMap.put(i, 1);

Step 5 : Print elementCountMap. This will contain all the elements of inputArray along with their occurrences.

Step 1 : Define one HashMap called charCountMap with Character as key and Integer as value. This map will hold the characters and their count in the given string.

Step 2 : Convert inputString to char array called strArray.
Step 3 : Iterate through all chars of strArray and update their occurrences in charCountMap.

Step 4 : Iterate through all chars of strArray and check their count in charCountMap. Any first occurring character with 1 as it’s count will be the first non-repeated character in input String.

Step 5 : Iterate through all chars of strArray and check their count in charCountMap. Any first occurring character with >1 as it’s count will be the first repeated character in inputString.

Tip 1 : sine of an angle —> Math.sin();
Tip 2 : cosine of an angle —> Math.cos();
Tip 3 : tangent of an angle —> Math.tan();
Tip 4 : sec of an angle —> 1/Math.sin();
Tip 5 : cosec of an angle —> 1/Math.cos();
Tip 6 : cot of an angle —> 1/Math.tan();

Tip 1 : Give them appropriate answer also showing them interested to join organisation 
Tip 2 : Fit for the position because I have that much of skills & expertise