diff --git a/Java/OneBitTwoBit.java b/Java/OneBitTwoBit.java
new file mode 100644
index 0000000..72d1389
--- /dev/null
+++ b/Java/OneBitTwoBit.java
@@ -0,0 +1,23 @@
+package Leetcode.String;
+
+public class OneBitTwoBit {
+    public static void main(String[] args) {
+
+    }
+    public boolean isOneBitCharacter(int[] bits) {
+        int i=0;
+      while (i<=bits.length-2){
+          if (bits[i]==0){
+          i++;
+          }else {
+              i+=2;
+          }
+      }
+      if (i==bits.length-2){
+          return true;
+      }else {
+          return false;
+      }
+
+    }
+}
diff --git a/Java/Palindrom_String.java b/Java/Palindrom_String.java
new file mode 100644
index 0000000..2870d1a
--- /dev/null
+++ b/Java/Palindrom_String.java
@@ -0,0 +1,33 @@
+package Leetcode.String;
+
+import java.util.Scanner;
+
+public class Palindrom_String {
+    public static void main(String[] args) {
+        Scanner scanner=new Scanner(System.in);
+        String s=scanner.nextLine();
+        System.out.println(isPalindrome(s));
+
+    }
+    public static boolean isPalindrome(String s) {
+        s = s.replaceAll("[^a-zA-Z0-9]", " ");
+        s=s.toLowerCase();
+        StringBuilder s1=new StringBuilder();
+        for(int i=0;i<s.length();i++){
+            if(s.charAt(i)!=' '){
+                s1=s1.append(s.charAt(i));
+            }
+        }
+        int i=0;
+        int j=s1.length()-1;
+
+        while (i<=j){
+            if (s1.charAt(i)!=s1.charAt(j))
+                return false;
+            i++;
+            j--;
+        }
+//        System.out.println(s1);
+        return true;
+    }
+}
diff --git a/Java/Reverse_Words_in_a_String.java b/Java/Reverse_Words_in_a_String.java
new file mode 100644
index 0000000..c143cd2
--- /dev/null
+++ b/Java/Reverse_Words_in_a_String.java
@@ -0,0 +1,40 @@
+package Leetcode.String;
+
+import java.util.Scanner;
+
+public class Reverse_Words_in_a_String {
+    public static void main(String[] args) {
+        Scanner scanner=new Scanner(System.in);
+        String s=scanner.nextLine();
+        System.out.println(reverseWords(s));
+    }
+    public static String reverseWords(String s) {
+        String rev="";
+       int prev=0;
+       for (int i=0;i<s.length(); i++){
+           if (s.charAt(i)==' ' || i==s.length()-1){
+               String sub="";
+               if (i==s.length()-1)
+                sub=s.substring(prev,i+1);
+               else if (s.charAt(i)==' ')
+                   sub=s.substring(prev,i+1);
+               else {
+                   sub=s.substring(prev,i);
+               }
+
+               String r="";
+               sub=sub.trim();
+               if (sub.length()>0){
+               for (int j=sub.length()-1;j>=0;j--){
+                   r+=sub.charAt(j);
+               }
+
+               rev+=r+" ";
+               }
+               prev=i;
+           }
+       }
+       return rev.trim();
+    }
+
+}