recursion

Author: Simcoderan

Med1545.java

@@ -0,0 +1,14 @@
+class Med1545 {
+        public char findKthBit(int n, int k) {
+          if (n == 1)
+            return '0';
+          final int midIndex = (int) Math.pow(2, n - 1); // 1-indexed
+          if (k == midIndex)
+            return '1';
+          if (k < midIndex)
+            return findKthBit(n - 1, k);
+          return findKthBit(n - 1, midIndex * 2 - k) == '0' ? '1' : '0';
+        }
+      }
+    
+