From af119541a0279f6df53ecfa85b367e5c6d717393 Mon Sep 17 00:00:00 2001
From: anu0012 <anurag30671371@gmail.com>
Date: Thu, 6 Oct 2016 15:15:27 +0530
Subject: [PATCH] Add new question

---
 .../TechInterview/FirstNonRepeated.class      | Bin 0 -> 1426 bytes
 src/TechInterview/FirstNonRepeated.java       |  56 ++++++++++++++++++
 2 files changed, 56 insertions(+)
 create mode 100644 build/classes/TechInterview/FirstNonRepeated.class
 create mode 100644 src/TechInterview/FirstNonRepeated.java

diff --git a/build/classes/TechInterview/FirstNonRepeated.class b/build/classes/TechInterview/FirstNonRepeated.class
new file mode 100644
index 0000000000000000000000000000000000000000..a52987c4716b1e57d64c24ca1dba98a4c75906c3
GIT binary patch
literal 1426
zcmZux&r?%Z6#nkZ%e(M+RICL2fdz}j1jHz6s^ZT^DNzJVC<xu~h`0DOyfER#>Yk-5
zXI$7t?R3Lh76Ejo<H{KwyXmI8&a{7qj>hkXNP?2gJNLYE&i&50-?{I+djIrK0LL(8
zBZ5we{q^_;T{a9H&>|`kvtglAzjWK^!9g3nIMjeR4r_5lqR&Pnj%smCTaIglgpF@;
zLW`3UrzH9Xtka(F1!o09(b%|vnatf#0^5c>Ukw-LW>kL6oypQ-&bgj1&=UP==$3oO
zjb~kdHl7aho<G~KH#VjNH*@={J711x#S*6_&PWj2PUi~wj2iGXP-MW%F9gFme^kvY
zH&8bYX*>rlXcgFA#x4Y2HlEJ7zOV8U=Nz2J1s(96gCs6)iW+nmZZfHZOBi4-2j62*
zBIV#Rt}wlWAzXDZjFFGK%5|swK+USWgKM~`Lw|5EinN0<{3tQ*U;@{*m=tLGv|5^~
z=O3B5r80rQjx9(bCDp^Q#7!I5iQ8<tw-Bf~0YlRqStr@c#Z&%#Az-+2=h&^C(JdXi
z0n%4@10Jm0$rKx=-vyeZvCkXEwr6g-`3v-$(NrwS6I2hCq{qz!Do@NiZnmICe%6VT
zwKy9wtf?WB^8;Rvg)8bFE3Z^o=6Ri;{@4_YnpMo!wUxJ~zRCuHI?oTrb#i^>Qnjfo
zy<_4KnGra#1?1<5wFnzYLOBgk<@y?LbCv6LO4x!LGbx$ZL0R_5BqjQbVR_@|Kr_Eo
z{WJLRE`yv=+sjpO4R^0VJfR}6i_$6^TTzeQ*h8J6;sL^_qwoJ`FeaA~T7fy#Q$+Yo
z+oDnW4Szj@HMs&gtZfOCvhGwkl&~UJ#QX!(y}QB@tBCql*lTDo@Cbc1rW$n(j)CWB
zEaD4udKKH&&=kVN5_Z<am>c#*ODvThGfgNVBT{Ed=s5W?Qx)rXv@BzL#aG0aX2M!R
z{i5Xlml5k%*z_7j>{u%GX&#I+4^yNHWS{|UXd+pyXy?C!qiP?AS|^TE8$=g=K@|7-
z{s7&0NY7(VyERU=7dVWUID*%-{mps#4|n{F1pecQYa{Ym*zeFJu~(FcE+xLwx<osl
f4)*0O2Akg?{0?Cuj#4SHl29c|*C<$rUcdeTbi74w

literal 0
HcmV?d00001

diff --git a/src/TechInterview/FirstNonRepeated.java b/src/TechInterview/FirstNonRepeated.java
new file mode 100644
index 0000000..da44049
--- /dev/null
+++ b/src/TechInterview/FirstNonRepeated.java
@@ -0,0 +1,56 @@
+/***
+
+Given a string s consisting of lowercase Latin Letters, find the first non repeating character in s.
+
+Input:
+
+The first line contains T denoting the number of testcases. Then follows description of testcases.
+Each case begins with a single integer N denoting the length of string. The next line contains the string s.
+ 
+Output:
+
+
+ For each testcase, print the first non repeating character present in string.
+ 
+ Print -1 if there is no non repeating character.
+
+***/
+
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+class FirstNonRepeated {
+	public static void main (String[] args) {
+		
+		
+		Scanner sc = new Scanner(System.in);
+		int t = sc.nextInt();
+		while(t-->0)
+		{
+		    Map<Character,Integer> map= new HashMap<>();
+		    int n = sc.nextInt();
+		    String s = sc.next();
+		    
+		    for(int i=0;i<n;i++)
+		    {
+		        if(map.containsKey(s.charAt(i)))
+		        map.put(s.charAt(i),map.get(s.charAt(i))+1);
+		        else
+		        map.put(s.charAt(i),1);
+		    }
+		    int check = 0;
+		    for(int i=0;i<n;i++)
+		    {
+		        if(map.get(s.charAt(i))==1)
+		        {
+		            System.out.println(s.charAt(i));
+		            check = 1;
+		            break;
+		        }
+		    }
+		    if(check == 0)
+		    System.out.println(-1);
+		}
+	}
+}
\ No newline at end of file