Below problem statement is mandatory to attempt. You can write in any programing language.

How to compute the first and last character of a string that is not repeated?

Example: "This is a sample text"

From the beginning $"h"$ is the non repeating character and $"x"$ is the non repeating character from the end.

Output: $h$ and $x$