Тёмный

ACM ICPC Team HackerRank Solution 

JAVAAID - Coding Interview Preparation
Подписаться 37 тыс.
Просмотров 12 тыс.
50% 1

Опубликовано:

 

4 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 47   
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
JAVAAID community: RU-vid recently changed the way they monetize my content. My channel now needs 1,000 subscribers so it would be awesome if you could show your support by both watching my videos and subscribing to my channel if you haven’t already done so. Monetizing my videos allows me to invest back into the channel with new equipment so a small gesture from you goes a huge way for me. Many thanks for your support!
@shivamarora3384
@shivamarora3384 4 года назад
man love you, you got a new sub! I wish you did it in python though.
@RonaldoCR-fi9nk
@RonaldoCR-fi9nk 5 лет назад
This is the problem I wasn't able to get in HackerRank. I checked the comments, sample output but still didn't get it. Thanks for sharing it. Now this particular problem is clear to me.
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
Thanks, Palash for your feedback. Stay tuned..and keep watching for more.
@Abhishek.MishraJi
@Abhishek.MishraJi 4 года назад
Good approach. I used three for loop to compare char in both string and if its one increase topic count. It lead to runtime error.
@JavaAidTutorials
@JavaAidTutorials 4 года назад
thanks.🙂
@biswajit8329
@biswajit8329 5 лет назад
Nice explanation .Good job . But here also 3 nested for loop. bitCount() inside one more loop is present .
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
Thanks @Biswajit for your feedback. by using bitCount() your code will be short and much more readable.
@aravinda513
@aravinda513 4 года назад
Thank you so much. I knew the logic, but could not get how to start implementing.
@JavaAidTutorials
@JavaAidTutorials 4 года назад
We hope now you have answer to your question:)
@PulkitMalhotra
@PulkitMalhotra 3 года назад
Good content
@JavaAidTutorials
@JavaAidTutorials 3 года назад
Thank you :)
@rajughosh6173
@rajughosh6173 5 лет назад
Please add more tutorials like this loving your tutorials thanks..
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
Thanks a lot for your compliment Raju. It really motivates me to provide better content for you all. May i know what you like the most in this tutorial ?it will help me to create better content in future.
@rajughosh6173
@rajughosh6173 5 лет назад
@@JavaAidTutorials sir I loved the way you divided the tutorial in small patterns please do make more videos like this and sir I wanted to know how I can get a job in data science as I'm a Bsc grad..thanks..
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
Thanks for the feedback Raju. Will keep on adding more stuff but it definitely requires love and support from you all. Do lot of practice and make yourself comfortable with all techniques/terminology which requires to become a data science engineer. You have to put extra effort as you are holding B.SC degree.
@rajughosh6173
@rajughosh6173 5 лет назад
@@JavaAidTutorials sir will you post tutorials for hacker rank machine learning for data science in future.
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
I am not sure. It totally depends on the channel growth. what type of content people like the most. But there is always hope. :)
@johncanessa2250
@johncanessa2250 5 лет назад
Clean approach using BigInteger :o)
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
yup :) @John. Thanks for watching..!!
@venkatraog6772
@venkatraog6772 Год назад
bi[I] = new BigInteger(topic[I], 2) Here why have used 2 can u help me to understand
@codingfreek5737
@codingfreek5737 5 лет назад
Nice solution..!!!
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
Thanks coding freek..!!!!
@liwaiyip1769
@liwaiyip1769 4 года назад
So the time complexity is O(N^2 * M), right? Is there any way to show it is the optimal time complexity for solving this problem?
@abhishekjoshi5189
@abhishekjoshi5189 4 года назад
A small suggestion please try to zoom in while explaining and screen recording as it would make viewer easy to read.
@JavaAidTutorials
@JavaAidTutorials 4 года назад
thanks for the feedback @Abhishek but it would be great if you can explain where exactly you feel it should be zoom in like while reading hackerrank problem etc.. you can use timestamp of this video as well.
@abhishekjoshi5189
@abhishekjoshi5189 4 года назад
@@JavaAidTutorials a lot of space remains between screen and the problem if both the problem and the code will be zoomed it'll be better or you can try to increase the font of code as well.
@harshadapatil84
@harshadapatil84 5 лет назад
great tnx....
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
thank you @harshada patil..
@omyerawar7976
@omyerawar7976 3 года назад
but we are taking only one array as input. How is it possible because we have to take a new array for each member. Also i think we are doing or of the bits of same team member. Or maybe im high:)
@shreysoni4117
@shreysoni4117 4 года назад
new Biginteger(string[i],2) here what is 2 can u explain it.
@JavaAidTutorials
@JavaAidTutorials 4 года назад
its a radix to inform BigInteger that we are dealing with binary, which is base 2.
@antarbasu5342
@antarbasu5342 3 года назад
program in c /* ACM ICPC proble, There are a number of people who will be attending ACM-ICPC World Finals. Each of them may be well versed in a number of topics. Given a list of topics known by each attendee, you must determine the maximum number of topics a 2-person team can know. Also find out how many ways a team can be formed to know that many topics. Lists will be in the form of bit strings, where each string represents an attendee and each position in that string represents a field of knowledge, 1 if its a known field or 0 if not. For example, given three attendees' data as follows: 10101 11110 00010 input 4 5 10101 11100 11010 00101 output 5 2 */ #include #include #include int main() { int n,m; scanf("%d %d",&n,&m); char* topic[n]; for(int i=0;i
@adeebafatima3336
@adeebafatima3336 3 года назад
Please explain the problem special string again 😊
@nadupurirajendra6341
@nadupurirajendra6341 4 года назад
is it possible to slove it with only two for loops in c++ as u have done here??
@JavaAidTutorials
@JavaAidTutorials 4 года назад
Don't know much about C++, would recommend try asking your question in our fb group or telegram . hoping people should be able to help you.
@leapingquark
@leapingquark 4 года назад
I am a beginner in java and I need your help. You wrote this line { new BigInteger(topic[i],2) } I want to ask why is this '2' supplied in BigInteger ?
@JavaAidTutorials
@JavaAidTutorials 4 года назад
its a radix to inform BigInteger that we are dealing with binary, which is base 2.
@leapingquark
@leapingquark 4 года назад
@@JavaAidTutorialsThank you sir!
@palakdavda1588
@palakdavda1588 4 года назад
Why used BigInteger array and not primitive int array?
@JavaAidTutorials
@JavaAidTutorials 4 года назад
Because if you look the given constraint n and m value can go up to 500 character string in binary which will be a huge number and integer wil not be able to handle it. that is the reason i have used BigInteger and it also provides various inbuilt functions and one function bitCount() also i have not written , its there already which helped me to write less.
@sagarlandge3271
@sagarlandge3271 5 лет назад
subbed
@JavaAidTutorials
@JavaAidTutorials 5 лет назад
thank you..!!
@Abhishek-ko8bf
@Abhishek-ko8bf 4 года назад
Sir,THIS APPROACH IS GOOD OR NOT? #include using namespace std; int main() { int n,i,c=0,l=0; int m; cin>>n; cin>>m; vectorinput(n); vectorcal(n*(n-1)/2); for(i=0;i>input[i]; } for(int k=0;k
@JavaAidTutorials
@JavaAidTutorials 4 года назад
I would say instead of asking, try validating your approach against the video, you will get the answer.
Далее
How To Solve Equalize The Array Hackerrank Problem
7:44
Climbing The Leaderboard HackerRank Solution
26:04
Просмотров 33 тыс.
Тренд Котик по очереди
00:10
Просмотров 302 тыс.
ЭТО НАСТОЯЩАЯ МАГИЯ😬😬😬
00:19
New Year Chaos HackerRank Solution
23:56
Просмотров 52 тыс.
HackerRank Luck Balance Solution Explained - Java
10:59
Minimum Distances HackerRank Solution
17:53
Просмотров 18 тыс.
How to Solve Queen's Attack II - HackerRank Solution
40:33
ACM ICPC Team | HACKER RANK | C++
9:38
Просмотров 2,5 тыс.