779. K-th Symbol in Grammar - LeetCode Solution


Recursion

Python Code:

class Solution:
    def kthGrammar(self, N: int, K: int) -> int:
        def solve(n, k):
            
            if n==1 and k==1:
                return False
            
            mid = (2**(n-1))//2
            
            if k <= mid:
                return solve(n-1, k)
            else:
                return not solve(n-1, k-mid)
            
        
        if solve(N, K):
            return 1
        else:
            return 0


Comments

Submit
0 Comments
More Questions

1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture
709A - Juicer
1358C - Celex Update
1466B - Last minute enhancements
450B - Jzzhu and Sequences
1582C - Grandma Capa Knits a Scarf
492A - Vanya and Cubes
217A - Ice Skating
270A - Fancy Fence
181A - Series of Crimes
1638A - Reverse
1654C - Alice and the Cake
369A - Valera and Plates
1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness