No Idea! [HackerRank] [Interview] | Python | Problem Solving
HTML-код
- Опубликовано: 11 сен 2024
- This video is about No Idea! problem from HackerRank.
Problem: www.hackerrank...
#Hackerrank #Python #Interview
Sample Code:
n,m=map(int,input().split())
arr=list(map(int,input().split()))
A=set(map(int,input().split()))
B=set(map(int,input().split()))
print(sum((i in A) - (i in B) for i in arr))
For 1 : 1 Tutoring
WhatsApp contact : 7278222619
mail: jaiswalsatya93@gmail.com
You can support via UPI : sattujaiswal@okhdfcbank
Follow me on:
Whatsapp:
chat.whatsapp....
Facebook:
/ sat567
Linkedin:
/ satyendra-jaiswal-9035...
Instagram:
/ jaiswal_satyendra
If you enjoyed this video, make sure to checkout my other video Capitalize! problem from HackerRank - ruclips.net/video/iV2ezsexlE8/видео.html. Don't forget to like , subscribe and share with others who can learn from it. Thanks.
Thank you , good concept
Glad it helped😊. Please do share with your friends too😊
Thanks broo for a nice lecture..👍🙂
why does some programs dosen't work in pypy3??
The explanation was really great but we should increase our video speed
HELP!! why it s not working in opposite manner where arr be converted into set
why should we use set in A and B and why we should not use list?
i am unable to understand last line of code
i am from electronics abhi 4 din se python sikh raha hu but muje to hackerrank question hi samaj nahi aa rahe
it is normal for everyone?
yes..Its normal for every beginner nothing to worry.
@@codingcart yes..
what do you use to draw on a macbook? I'm just curious.
We are using:-
amzn.to/2wnAE9F
really helpful !!
So glad!
Bhi thora speed combine nhi karo.. thora process m karo ki samaj aa jaya..
App short hand bahut use karta ho..
Hey i just doing the same thing but my compiler shows that i exceeded the time limit.
Question: what is the reason for mapping the n,m"s value?
for taking a,b and arr in specific range...
why dont u give size of array and sets ?
how many easy level problems are there on python hackerrank
You can filter out from each topic..but it's not constant, they upload new problems time to time.
you can simply use issubset() function
No it's for all the elements we've to check every element here!
happiness=0
n,m=map(int,input().split())
array=list(map(int,input().split()))
A=set(map(int,input().split()))
B=set(map(int,input().split()))
for i in array:
if i in A:
happiness+=1
elif i in B:
happiness-=1
print(happiness)