Тёмный

Non Divisible Subset | HackerRank | Array | Interview 

Coding Cart
Подписаться 12 тыс.
Просмотров 9 тыс.
50% 1

This video is about Non Divisible Subset problem from HackerRank.
For 1 : 1 Tutoring
WhatsApp contact : 7278222619
mail: jaiswalsatya93@gmail.com
You can support via UPI : sattujaiswal@okhdfcbank
Problem:
www.hackerrank...
Follow us on:
Whatsapp:
chat.whatsapp....
Telegram:
t.me/joinchat/...
Facebook:
/ codingcart
Linkedin:
/ satyendra-jaiswal-9035...
Instagram:
/ codingcart
#HackerRank #Coding #Interview

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

 

21 авг 2024

Поделиться:

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 69   
@yashwani8155
@yashwani8155 13 дней назад
very well explained! for people looking for a reference, here is the law at play: if p = (A mod k) and q = (B mod k) and (A+B) mod k = 0, then p+q is either 0 or k.
@sahilbisht3661
@sahilbisht3661 4 года назад
Your teaching way is best 👌 ever
@codingcart
@codingcart 4 года назад
Thanks a lot 😊
@loganwalker454
@loganwalker454 Год назад
You elucidated it well, rest of them on the RU-vid had dawdled my time.
@codingcart
@codingcart Год назад
Glad it helped 😊. Do share with your friends too 🙂..
@deepgupta234
@deepgupta234 Год назад
Fall in love with your explanation
@codingcart
@codingcart Год назад
Glad it helped😊. Please do share with your friends too😊
@rajeshmaurya1849
@rajeshmaurya1849 Год назад
Superb explained. Kudos !!!
@codingcart
@codingcart Год назад
Glad you liked it!
@paruluniyal2305
@paruluniyal2305 4 года назад
You explained it very well 😊👍 😊
@codingcart
@codingcart 4 года назад
Thanks a lot 😊
@kasiganga6569
@kasiganga6569 Год назад
You are best example for conveying the logic is more important than making a small video. Thank you so much. Your videos make think that there will be a simpler logic to solve a problem rather than using the brute force approach. Again thanks a lot
@codingcart
@codingcart Год назад
Glad to hear that! Do share with your friends too😊
@NehaKumari-tt1fn
@NehaKumari-tt1fn 4 года назад
I like ur way of teaching 👍🏻
@codingcart
@codingcart 4 года назад
Glad to hear that
@kushaldas8496
@kushaldas8496 4 года назад
Fan sir 🤟
@satyaprakashsingh952
@satyaprakashsingh952 2 года назад
Great expectation
@codingcart
@codingcart 2 года назад
Keeping learning and keep supporting 😊
@AbhishekKumar-ob7vh
@AbhishekKumar-ob7vh 4 года назад
Nice explanation 👌
@codingcart
@codingcart 4 года назад
Thank you 🙂
@sealovingsoura3036
@sealovingsoura3036 3 года назад
Awesome Explanation Thank you sir
@smnsdf
@smnsdf 2 года назад
great ...
@codingcart
@codingcart 2 года назад
:)
@philipkwesiga
@philipkwesiga 2 года назад
The best explanation
@deepgupta234
@deepgupta234 Год назад
Wonderful ❤❤
@codingcart
@codingcart Год назад
Glad it helped 😊 Do share with your friends too 😊
@deepgupta234
@deepgupta234 Год назад
For sure
@sonalshinde5248
@sonalshinde5248 3 года назад
Amazing video... This is the best video for this question.. great
@codingcart
@codingcart 3 года назад
Glad you liked it
@muskangupta7717
@muskangupta7717 4 года назад
Hlw sir ,I really like ur all the videos and the method as u teach....plzgive ur suggestions how to learn programming and implement logic...
@kushaldas8496
@kushaldas8496 4 года назад
Hey, Muskan Practice, practice and more practice !!! .I recommend you to work the first 100-120 most solved problem on . Solve them in that exact order. And think of the solution for at least one hour. Don’t say ‘This problem is too hard for me, I will try the next one’. That’s the loser mentality. Take a piece of paper and a pencil and try to think. In this way, you will probably find the solution, but for sure you will develop algorithmic thinking. If you don’t find the solution in one hour, then you can take a look on the editorials to see the solution. Meanwhile, Watch every videos of coding cart, because the way of sir explained everything it's just awesome. Keep in touch with this channel, I'm damn sure you will benefited from this channel. Keep learning! Keep practicing!!! All the best :)
@muskangupta7717
@muskangupta7717 4 года назад
@@kushaldas8496 thankew .🤗🤗I will surely try my best.
@codingcart
@codingcart 4 года назад
Glad u liked it!! Muskan, it's all about practising. As a beginner, First start with easy problem and apply your logic which comes to your mind which will be time and memory consuming i.e. Brute Force Algorithms and then after go for its optimization and during this process try to debug using print statement for the value at each step and see how actually the things are going, here you will learn so many things. Once your base is strong after solving lots of easy problem then move towards medium and so on. But the key part is practising and solving the problem by different different logics. Hope this helps :) Keep Learning Keep Supporting !!
@muskangupta7717
@muskangupta7717 4 года назад
@@codingcart thank you sir I appreciate you taking the time to speak with me.🤗
@shameersham4700
@shameersham4700 2 месяца назад
Thank you
@codingcart
@codingcart 2 месяца назад
Glad it helped😊. Please do share with your friends too😊
@Flash11111
@Flash11111 Год назад
Thank you for your elegand solution!😘
@MANISHKUMAR-ej8jw
@MANISHKUMAR-ej8jw 3 года назад
Very nicely explained👍🏻
@madhusreerana4595
@madhusreerana4595 2 года назад
Great Explanation!!
@codingcart
@codingcart 2 года назад
Glad it was helpful!
@zerocool5673
@zerocool5673 3 года назад
Thanks for the explaination. I was having trouble understanding the solution. Your video cleared it up.
@codingcart
@codingcart 3 года назад
Great to hear!
@junaidshaikh952
@junaidshaikh952 3 года назад
very detailed explaination!!!keep it up
@codingcart
@codingcart 3 года назад
Glad you liked it
@lizzyzhang1593
@lizzyzhang1593 3 года назад
Thank you for your explanation. Your solution is always the best and most optimal solution I ever see online. Please post more videos for hackerrank challenge,
@codingcart
@codingcart 3 года назад
Thank you, I will
@sk-pn4rz
@sk-pn4rz 3 года назад
explained very well
@rudrapratap3303
@rudrapratap3303 3 года назад
Great ho aap, thanks
@alimurad4659
@alimurad4659 3 года назад
best teacher ever !!!
@codingcart
@codingcart 3 года назад
Glad you think so:)
@RadheshKunnath
@RadheshKunnath 3 года назад
great explanation.... 👌Thank you!
@codingcart
@codingcart 3 года назад
Glad you liked it
@atharvabowlekar5495
@atharvabowlekar5495 3 года назад
Great Work
@codingcart
@codingcart 3 года назад
Thank you! Cheers!
@varunvoleti9253
@varunvoleti9253 3 года назад
excellent explanation !!!!!!!!!!!!!
@codingcart
@codingcart 3 года назад
Thank you!
@sarankumaar6009
@sarankumaar6009 3 года назад
great job !!!
@kain1402
@kain1402 4 года назад
thank you!
@codingcart
@codingcart 4 года назад
You're welcome!
@gusionfusion1073
@gusionfusion1073 2 года назад
Thankyou for your great work . You earned a subscriber today 🙌🙌
@codingcart
@codingcart 2 года назад
Thanks and welcome
@sargun_narula
@sargun_narula 3 года назад
Nice explanation !!
@codingcart
@codingcart 3 года назад
Glad you liked it
@godisnoob675
@godisnoob675 3 года назад
respect++
@codingcart
@codingcart 3 года назад
:)
@mr_forlorn8113
@mr_forlorn8113 2 года назад
Bro , I am getting some time errors using python.Will that be a problem in future? Should i continue in python or move on to c++ or other?? Please give me the suggestion,by the way thanks for the video..
@codingcart
@codingcart 2 года назад
Every language have their own way of implementations, we must know how to use them efficiently.
@bipinsingh1490
@bipinsingh1490 3 года назад
sir i have one dout which is why we are picking a number from set 0.becoz if we pick any number for exapmle we pick 7 then 7 is also divisible by itself. and we have to form non divisible subset
@quiped7719
@quiped7719 10 месяцев назад
the condition is for two numbers added, not only one, so 7 can be in the list