You're doing a fantastic job! Could you help me with something unrelated: My OKX wallet holds some USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). Could you explain how to move them to Binance?

Rust kaise h mam

I cracked a job by learning python form youtube 😅😅

so ma'am in this code ------------> if(size2==0 ) will be written first then if(size1 == 0) . because if take input str1 = "abcdefgh" , str2 = "efh" the output -----> false . which is wrong , so to correct it take 2nd condition of if 1st.

print(len(A.split()[1]))

I appriciate

here is the text- Life is beautiful, but not always. It has lots of problems you have to face everyday. Don't worry though! All these problems make you⚫→ strong, it gives you courage to stand alone in future. Life is full of moments of joy, pleasure, success and comfort punctuated by misery, defeat, failures and problems. There is no human being on Earth, strong, powerful, wise or rich, who has not experienced, struggle, suffering or failure. You have to work hard to reach to the highest position. Life is full of paths, you just have to- choose the right one. Life is interesting and amazing like the stars up in the skies. With no doubt, Life is beautiful and full of celebrations. However you should always be ready to face adversity and challenges.. There are difficult situations in life as well. Be careful!! You might get hurt too hard. Life is sometimes too. selfish to think about. yourself. Then life is too hard to handle. Falling in love! People tend to fall in love nowadays but i personally. think the right time has to come... You might also get hurt in Love. You might be broken-hearted as the people. say. Life is the place where people treat everyone differently, racism exists as well as bullying. People tend to say. bad stuff behind.

proaylty -> it is probability

simple- x=[9,8,7,6,5,4] z=x[: : -1] print(z)

it's simple- x="hello netsetos" y=x.split() z=len(y[-1]) print(z)

Yaa, this in too much helpful content to understand the triangular lower and upper ❤ Thank you soo much from india

5:30 how do you know who is '3rd' position element to compare with Pivot? If you knew, isn't that the answer already?

str1= set(input("enter a first string:")) str2 = set(input("enter a second string:")) print(str1.intersection(str2))

def find_pair(l1,sum): if l1[0]+l1[-1]==sum: return l1[0],l1[-1] elif l1[0]+l1[-1]>sum: n=len(l1) l1=l1[0:-1] return find_pair(l1,sum) elif l1[0]+l1[-1]<sum: n=len(l1) l1=l1[1:] return find_pair(l1,sum) else: return l1[0],l1[-1] find_pair(l1,sum)

Very clear explanation, thanks

You didn't explain what is the role of recursion with maxheapify in the code

This quetion there is no values is equal to given int The output is. -1 -1

Awesome

may i ask...how do you get the #16?

if(guest>K) statement should be outside the for loop

a=[1,2,4,5,6,7] n=a[-1] s1=n*(n+1)//2 s2=sum(a) r=s1-s2 print(r)

l1=['naina','kimi','sheena'] l2=[852345,763567,691276] d=dict(zip(l1,l2)) print(d)

length = "Sneha Snehal" listsplit = length.split(" ") print(len(listsplit[-1]))

maxdiff=[5,32,45,4,12,18,25] maxdiff.sort() print(maxdiff[-1]-maxdiff[-2])

sentence="Sheena eating mango and apple. Her sister also loves eating apple and mango" sentences=sentence.split() print(sentences) for word in sentences: counts=sentence.count(word) print(f"Number of times ${word} appears:", counts)

Or You can use below also def common_letters(): set1 = set(input("Enter your first string :- ")) set2 = set(input("Enter your second string :- ")) common = set1.intersection(set2) return list(common) common_letters()

Interview night study for tomorrow

def reverseString(string): return ' '.join((string.split(' ')[::-1]))

2-1=2 how😅9:42

def find_common_letters(str1, str2): common_letters = set(str1) & set(str2) return list(common_letters) string1 = "NAINA" string2 = "REENE" common = find_common_letters(string1, string2) print("Common letters:", common)

def count_words(): str1 = input('Enter the string') list_=str1.split() dic_={} for i in list_: if i in dic_: dic_[i]= dic_[i]+1 else: dic_[i]=1 print(dic_) count_words()

Guys I might be cooked

nice explanation especially where u showed the pattern 5:00

Watching this video for tomorrows(12.10.24)interview at cochin for python developer

at 6.43 what is x:x(i) ?

A = [40,50,60,80] B = [100,50,20,10] a=set(A) b=set(B) a.intersection(b)

I m pasting my external ip but the webpage is not loading

matching_bracket = {')': '(', ']': '[', '}': '{'} stack = [] for char in expression: if char in matching_bracket.values(): stack.append(char) elif char in matching_bracket: if not stack or stack.pop() != matching_bracket[char]: return False return not stack

d={} for i in s: if i in d: d[i]=d[i]+1 else: d[i]=1 m=[ ] for k,v in d.items(): if v==1: m.append(k)

good

def max_sum(arr): curr_value = 0 max_value = arr[0] for i in range(len(arr)): curr_value += arr[i] # Always update max_value to track the highest sum so far max_value = max(max_value, curr_value) # Reset curr_value if it goes negative if curr_value < 0: curr_value = 0 return max_value

Could you please recommend any free online course to help me improve in my programming skills?

a=[1,1,2,2,3,3,4,4,5,5,6,6] b=[] for i in a: if i not in b: b.append(i) b

word=input("enter the input:").upper() word2=input("enter the second word:").upper() for i in set(word): if i in set(word2): print(i)

l = [1,2,4,5,6] for i in range(1,len(l)): if l[i]-1 not in l: print(f'{l[i]-1} is missing')

now with inbuilt functions from itertools import combinations b=combinations(list,2) a=[ ] for i in b: print(i) z=abs(i[0]-i[1]) print(z) a.append(z)

I got error that error is Node() takes no arguments... how to solve this err