633. Sum of Square Numbers | Math | 2 Pointer | Binary Search | Two Sum

In this video, I'll talk about how to solve Leetcode 633. Sum of Square Numbers | Math | 2 Pointer | Binary Search | Two Sum
2Sum - • 1. Two Sum | Day 003 |...
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@vickyroy3595]

Aryan , falling love with your videoes and explanation!!!

[@learningmaths786]

I had this question in my interview and I solved it in 10 minutes

[@worldofgaming748]

so where are you now?

[@ReetiSahuu]

Which company interview?

[@learningmaths786]

@@ReetiSahuu zoho

[@coderunner743]

bro, are you got selected in Zoho? if yes which year bro?

[@akmarkan2490]

Thanks bro💪🏻

[@mohit7717]

Exactly same I have done this ...

[@cenacr007]

❤

[@manishasingh-de8hi]

solved it using two pointer in first go.🙂

[@JIGARSINGTHAKOR-yy6qp]

Bhaiya is "cracking the coding interview " book is worth to buy in 2024???

[@parthlahoti5404]

2 pointer is mentioned in topic tags,

[@riaa55]

Understood

[@SubhajitDas-mt7sn]

can you update your discord link ? Old link was expired...

[@om-it4qq]

can you please solve this question again ? "2834. Find the Minimum Possible Sum of a Beautiful Array" ! , you have already solve this question for that contest , but now they change Constraints, in contest it was ask for value of n and target up to 100000 but now they ask for 1e9 !! can you please help me out! I try to understand math but i can't 😣😣

[@mrityunjoybarman9098]

public boolean judgeSquareSum(int c) { long low = 0; long high = (long)Math.sqrt(c); while (low c) high = mid - 1; else low = mid + 1; } return false; } Can anyone please tell me why binary search on answer is not working?

[@krishankantak]

take mid = low + (high - low)/2

[@shikharjoshi2998]

can u plz tell why we are using a

[@Taciturn123-r6j]

If we take c=9 then the output will be 0^2+3^2 i.e b=3 as you said if we take a

[@shikharjoshi2998]

​@@Taciturn123-r6jif we take c = 9 then in one pass only we will get true as ans , as 0

[@learnerforlife1338]

@@shikharjoshi2998 for cases where c is sum of two squares such that a=b, like 32, 4^2 + 4^2

[@shikharjoshi2998]

​@@learnerforlife1338 oh ok got it now 👍

[@Algorithmswithsubham]

why it's giving me wrong ans for 4 class Solution { public: bool judgeSquareSum(int c) { for(int i=1;i1; long long pro_duc=(x*x)+(mid*mid); if(pro_duc==c){ // cout

[@rajrajesh1669]

Your approach won't work for any perfect squares or for zero, because you aren't considering 0 as a term.