Java solution for Higher Number Set Bits

2 files changed, 45 insertions, 1 deletions

diff --git a/challenge-114/ziameraj16/README.md b/challenge-114/ziameraj16/README.md
index 336ee591a8..d066640c97 100644
--- a/challenge-114/ziameraj16/README.md
+++ b/challenge-114/ziameraj16/README.md
@@ -20,5 +20,28 @@ Enter the number
 Enter the number
 999
 1001
-/perlweeklychallenge-club/challenge-114/ziameraj16/java$
+```
+
+# Higher Integer Sets Bits
+## Java Solution
+
+To compile the code run
+```java
+javac HigherIntegerSetBits.java
+```
+To run
+```java
+java HigherIntegerSetBits
+```
+### Example
+```bash
+/perlweeklychallenge-club/challenge-114/ziameraj16/java$ javac HigherIntegerSetBits.java
+/perlweeklychallenge-club/challenge-114/ziameraj16/java$ java HigherIntegerSetBits
+Enter the number
+3
+5
+/perlweeklychallenge-club/challenge-114/ziameraj16/java$ java HigherIntegerSetBits
+Enter the number
+12
+17
 ```
diff --git a/challenge-114/ziameraj16/java/HigherIntegerSetBits.java b/challenge-114/ziameraj16/java/HigherIntegerSetBits.java
new file mode 100644
index 0000000000..4d8f03fa63
--- /dev/null
+++ b/challenge-114/ziameraj16/java/HigherIntegerSetBits.java
@@ -0,0 +1,21 @@
+import java.util.Scanner;
+
+public class HigherIntegerSetBits {
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        System.out.println("Enter the number");
+        int number = scanner.nextInt();
+        System.out.println(findNextNumberWithSameOnes(number));
+
+    }
+
+    public static int findNextNumberWithSameOnes(int n) {
+        long value = Integer.toBinaryString(n).chars().filter(ch -> ch == '1').count();
+        while(true) {
+            if (value == Integer.toBinaryString(++n).chars().filter(ch -> ch == '1').count()) {
+                return n;
+            }
+        }
+    }
+}