Glad you liked it! Keep learning. And for better experience, visit nados.io, where you will get well curated content and career opportunities.
@play-chess2 жыл бұрын
बहुत वीडियो देखा इसके लिए, कोड तो मिल गया पर कोई सही से समझा नही पा रहा था, सब खाली कोड पढ़ रहे थे, इस वीडियो में समझ आया, O(n) कैसे हो गया 😊 धन्यवाद सर जी !
@Pepcoding2 жыл бұрын
बेहतर अनुभव और सुव्यवस्थित सामग्री के लिए - nados.io पर जाएँ और सीखना शुरू करें
@shashwatkumar696510 ай бұрын
4:50 the last x 2 is actually x 2!, because it counts all permutations of the 2 elements in the pair since order does not matter.
@udaysabbisetty95092 жыл бұрын
Brilliant Explaination ,Thank you sumeet sir
@somnathchakraborty19653 жыл бұрын
Great Explaination sir..
@Pepcoding3 жыл бұрын
Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
@sportsbeauty43503 жыл бұрын
Very easily understood... Thankyou sir..
@Live-hh6li3 жыл бұрын
Thank You
@Pepcoding3 жыл бұрын
You're welcome
@surajsingh-sm7qx2 жыл бұрын
very very useful video
@ajayjangid11642 жыл бұрын
great explanation, just loved it!, Thank you sirji
@geeky_world3 жыл бұрын
super explanation....Thanks !
@Pepcoding3 жыл бұрын
Glad it was helpful! and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
@ujjawalgupta232 жыл бұрын
Great Explanations!! Thank you very much Sir
@rohitshinde84783 жыл бұрын
Thank you sir for this amazing explaination
@Pepcoding3 жыл бұрын
Keep learning and keep growing😊 If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
@rahulbhatia30754 жыл бұрын
Amazing sir, bhot maza aaya🔥
@ankitmishra3993 жыл бұрын
thank u sir orz
@Pepcoding3 жыл бұрын
Most welcome, for better experience and well organised content visit - nados.pepcoding.com
@devankdubey66572 жыл бұрын
sircan you explain 1
@anckoor3 жыл бұрын
very nice
@Pepcoding2 жыл бұрын
for better experience, visit nados.pepcoding.com, where you will get well curated content and career opportunities.
@dpxy15992 жыл бұрын
गर्दा 🔥
@nikhilmusale4730 Жыл бұрын
Which algorithm is he suggesting? Something like kurnical algorithm, can someone clear it out (2:12 min)
@Pepcoding Жыл бұрын
kernighan algorithm
@ayaskanta1004 жыл бұрын
gfg mein solution galat hai apne sahi bataya
@akatsuki13633 жыл бұрын
Muze pahile laga tha bit manipulation bahot hard hoga pr abhi jab playlist khatam hone pe ayi he to easy lag raha thanks for efforts sir🔥❣️
@Pepcoding3 жыл бұрын
Thank you so much and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
@abhinavgupta39134 жыл бұрын
sir ek cheez clear nhi ho rhi ...hume countOn aur countOff ko long mei lena kyu pd rha h.....countOn ki value humesha arr.length se km ya equal honi chaiye ...or arr.length to integerRange mei hi rhega humesha
@muditjain79943 жыл бұрын
Jab multiplication CPU register level pe perform hoti hai tab multiplication result temporarily operand me store kia jata hai. For example: A = B * C; when B will be multiplied with C then the result will be temporarily held in B then that temporary value will be copied in A and the original value will be set in B. So, if B * C exceeds Integer Range and could not be stored in B, the system gives an error. So, its better to take LONG and then typecast the result to INT after modulo 10^9 + 7 if the return type is INT. Hope this helps.
@adarshrai95164 жыл бұрын
Sir apka speed pakd nhi paa raha hu time lag raha hai abhi foundation pe hi hu Foundation k saare questions solve kar raha hu
@Pepcoding4 жыл бұрын
Lage rahie. Jaldi Jaldi kijie.
@DarshanAdarkar-p3e9 ай бұрын
ye 31 bits ka kyaa logic hai ?
@elasingh31513 жыл бұрын
This solution doesnt get pass in GeeksForGeeks
@mridulgupta98412 жыл бұрын
use modulo there and store ans in long long int, it will work fine.
@kunalkheeva2 жыл бұрын
well explained, but my code is working without multiplying with 2 as well.