max(list)

list.sort() list[-1)

list.count(3)

to chek uni --->len(x) == len(set(x))

• *baki wale mai tle aa ja raha hai

dfs from typing import List

def bfsTraversal(n: int, adj: List[List[int]]) -> List[int]: anslist = [] visited = [0]*n def bfs(v): if(not visited[v]):

        visited[v] =1
        anslist.append(v)
        for k in adj[v]:
            bfs(k)

bfs(0)
print(anslist)
return anslist

bfs from typing import List

def bfsTraversal(n: int, adj: List[List[int]]) -> List[int]: anslist = [] queue = []#append pop(0) visited = [0]*n def bfs(v): queue.append(v) while(len(queue)):

        node = queue.pop(0)
        if(visited[node]):
            continue
        visited[node] = 1
        anslist.append(node)
        for k in adj[node]:
            if(visited[k]):
                continue
            queue.append(k)
bfs(0)
return anslist

cars.sort()

for i in range(0,len(nums)): for y in range(i+1,len(nums)):

for x in l1: curr.next = ListNode(x) curr = curr.next

string reverser : [::-1] abs()

remove floating ->int()

test_list.insert(0, 6) test_list[:0] = [6] test_list = [6] + test_list

int to bin: bin(x) -> 0b.... sorting List: l.sort(key = lambda a:-a) l[::-1]

sorting map: l = {1:1,2:2,-1:3}

for x in sorted(l.items(),key = lambda a:a[1]):
	print(x)
print(sorted(l))