Solving LeetCode !

Recurrsion and BackTracking Reference - https://www.youtube.com/watch?v=-3EwpW5UiVo Code - def dfs(hashset,visited, tiles, sb): hashset.add(sb) for i in range(len(tiles)): if not visited[i]: visited[i] = True sb += tiles[i] dfs(hashset, visited, tiles, sb) visited[i] = False

@cache in python Reference: https://www.youtube.com/watch?v=ccjqyssgz90

class Solution: def findKthBit(self, n: int, k: int) -> str: dp = ["0"] def rev(val): return val[::-1] def inv(val): res = "" for i in val: if i == "1": res +="0" elif i == "0":

This problem dives into bit manipulation Reference : https://www.youtube.com/watch?v=_zJ-AlmKNPE