import java.util.Hashtable;
import java.util.Stack;
import java.util.regex.Matcher;
import java.lang.CharSequence;
import java.lang.StringBuffer;
public class Reverse {
public static void main(String[] args) {
String str = "Vijay is at Office";
ArrayList
char str1[] = str.toCharArray();
Stack se = new Stack
for(int i=0;i
ab.add(String.valueOf(str1[i]));
System.out.println(ab);
}else{
String strr =null;
int a =0;
for(String gh:ab){
if(a==0){
strr =gh;
a=1;
}
else{
strr = strr+gh;
}
}
se.push(strr);
ab.clear();
}
if(i==str1.length-1){
String ghkk = null;
int j=0;
for(String gh1:ab){
if(j==0){
ghkk =gh1;
j=1;
}
else{
ghkk = ghkk+gh1;
}
}
se.push(ghkk);
ab.clear();
}
}
System.out.println(se.size());
for(int i=0;i
}
}
}
/* for(int i=0;i
result[j] = str1[i];
}
else{
String kl = null;
for(int k=0;k
kl=String.valueOf(result[k]);
}
else{
kl = kl +String.valueOf(result[k]);
}
}
System.out.println("KL"+kl);
s.push(String.valueOf(kl));
}
}
for(int i=0;i
System.out.print(s.pop());
}else{
System.out.print(s.pop()+" ");
}
}
}*/
