LeetCode | Weekly Contest 201 | Problem: Find Kth Bit in Nth Binary String

The Time Complexity for the solution is O(log n) and Space Complexity is O(1)

[vivekshelke]

good job!
i was looking for the recursive solution. but everyone was explaining bruteforce one untill i came here.

thank you for the nice explaination once again, goodluck

[nirbhay]

Very Good Explanation
Keep it up the good work

[AkhilVarma-vt]

Good explanation!
Could not find the optimized solution with explanation like this anywhere else.

[rhythmbhandari]

bro ur english is not understandable pls explain in hindi