_1545.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1545 {
publicstaticclassSolution1 {
publiccharfindKthBit(intn, intk) {
String[] strings = newString[n];
strings[0] = "0";
for (inti = 1; i < n; i++) {
strings[i] = formString(strings[i - 1]);
 }
returnstrings[n - 1].charAt(k - 1);
 }

privateStringformString(Stringstr) {
returnstr + "1" + reverse(invert(str));
 }

privateStringreverse(Stringstr) {
StringBuildersb = newStringBuilder();
returnsb.append(str).reverse().toString();
 }

privateStringinvert(Stringstr) {
StringBuildersb = newStringBuilder();
for (charc : str.toCharArray()) {
if (c == '1') {
sb.append('0');
 } else {
sb.append('1');
 }
 }
returnsb.toString();
 }
 }
}