top of page
Forum Posts
Lynelle Fernandes
Aug 26, 2024
In 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
sb = sb[:-1]
hashset = set()
visited = [False]*len(tiles)
dfs(hashset,visited, tiles, "")
print(len(hashset) - 1)
------------------------------------------------------------------------------
Result : print(len(hashset) - 1)
0
0
0
Lynelle Fernandes
Aug 21, 2024
In LeetCode
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":
res += "1"
return res
for i in range(n-1):
s = dp[-1] + "1"
s += rev(inv(dp[-1]))
dp.append(s)
#print(dp)
return dp[n-1][k-1]
0
0
0
Lynelle Fernandes
Aug 21, 2024
In LeetCode
@cache in python
Reference:
https://www.youtube.com/watch?v=ccjqyssgz90
0
0
0
Lynelle Fernandes
Aug 21, 2024
In LeetCode
This problem dives into bit manipulation
Reference :
https://www.youtube.com/watch?v=_zJ-AlmKNPE
0
0
0
Forum Posts: Members_Page
Lynelle Fernandes
Admin
More actions
bottom of page