Nice I've solved this problem using two pointer technique.😁 two pointer means it points to two element at the same time . 👉🏽the problem is there is given arr[] then we check the two numbers that their sum will be equal with target. input: arr = [1, 4, 6, 8, 9, 10]
target = 10 explanations take left and right. This's why understanding about the problem is needed. ✅
target = 10 explanations take left and right. This's why understanding about the problem is needed. ✅
👍1
If we're given the array of sorted list and duplicated elements what shall do?👆🏻 In general the logic skip the duplicated and take the unique then it compared with the other element to get the target. In this process target is sum of the two numbers. So this image is solving for what we're talking about.👆🏻
SamiTech Code pinned «Easy way to understand Two-Pointer: Step 1: Starts from human way: …»
How are u all family🫶
How was your day I believe it was good for you
TODAY JUST REST WELL AND TOMMOROW WE'LL CONTINUE OUR LEARNING⚡️
Good Night🫡
How was your day I believe it was good for you
TODAY JUST REST WELL AND TOMMOROW WE'LL CONTINUE OUR LEARNING⚡️
Good Night🫡
❤1🫡1
GOOD EVERYONE🌅
Did you rest?
It's good to see all of u here and I'm pleased to join us, so let's participate in this journey together
AGAIN WELCOME TO SAMITECH CODE OUR FUTURE IS BRIGHT IF WE DO OUR BEST😁😁😁
Did you rest?
It's good to see all of u here and I'm pleased to join us, so let's participate in this journey together
AGAIN WELCOME TO SAMITECH CODE OUR FUTURE IS BRIGHT IF WE DO OUR BEST😁😁😁
👍1
Let me clearly explain for u our mission. About 4 weeks ago I've decided to start machine learning, then I thought why amn't start the roadmap of ML before directly jump in to ML then, I started with Basic Python programming. Fortunately I finished that.
And now am learning DSA, but this's not only memorizing the topics as far as i learn i solve problem and understand each topics, DSA may take time no worries for that.😃
Just this's 2nd phase to foster our skill related to ML.
We'll solve problem from
Leetcode, geeksforgeeks, & from others sources
Key point: WHILE I LEARN I SHARE EVERYTHING I UNDERSTAND & EACH TOPICS. In simple am learning in public not private 💯
Generaly you can also share u'r idea in this group.✍
❤3
Afternoon guys: in this morning since there was a class I didn't share for u DSA related topics. Btw the class was so good, it's intersting course.👇
Just now am about to eat my lunch so, let's eat together😆
👉For more info stay tuned with me
Data communication&Networking
Just now am about to eat my lunch so, let's eat together😆
👉For more info stay tuned with me
🍌2
And guys Since our learning journey is related with this channel.
It's intersting to join also and she post daily problem on this channel.
https://t.me/A_StepForward
It' all about DSA. So let's grow together.⚡️
Telegram
Step Forward
Hey! ✋ I’m a software engineering student
This channel is my journey of learning, growing, and figuring things out
If you’re learning too, or just want some tips and motivations: Welcome 😊
This channel is my journey of learning, growing, and figuring things out
If you’re learning too, or just want some tips and motivations: Welcome 😊
The Two-Pointers Technique is a simple yet powerful strategy where you use two indices (pointers) that traverse a data structure - such as an array, list, or string - either toward each other or in the same direction to solve problems more efficiently
Two pointers is really an easy and effective technique that is typically used for: Two Sum in Sorted Arrays, Closest Two Sum, Three Sum, Four Sum, Trapping Rain Water and many other popular interview questions. we'll see them one by one👇
👍1
Problem:
👉 Given an integer array, find two elements whose sum is closest to 0. arr = [1, -3, 2, -1, 4]
Key points:
Array may have negative and positive numbers,
We want the minimum absolute sum,
Use Two Pointer after sorting. Let's think of it first how to handle this problem🤔
👉 Given an integer array, find two elements whose sum is closest to 0. arr = [1, -3, 2, -1, 4]
Key points:
Array may have negative and positive numbers,
We want the minimum absolute sum,
Use Two Pointer after sorting. Let's think of it first how to handle this problem🤔
My pc just makes me so angry
Just I opened Vscode and still now it's not responding.
And still now is on the loading😡, ....whatever now Am trying to use code editor on the online.. However As i open the the software it's closing by it self....😔
There is more conflict b/n the system right?🤔
May be if u have some tips to solve this kind of problem u can tell me✍
Just I opened Vscode and still now it's not responding.
And still now is on the loading😡, ....whatever now Am trying to use code editor on the online.. However As i open the the software it's closing by it self....😔
There is more conflict b/n the system right?🤔
May be if u have some tips to solve this kind of problem u can tell me✍
How are u all guys: here I'm using this resources, and also for more clarification I watch youtube tutorial.👉🏽 https://www.geeksforgeeks.org/dsa/python-data-structures-and-algorithms/
GeeksforGeeks
%%title%% - GeeksforGeeks
Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more.
SamiTech Code
Problem: 👉 Given an integer array, find two elements whose sum is closest to 0. arr = [1, -3, 2, -1, 4] Key points: Array may have negative and positive numbers, We want the minimum absolute sum, Use Two Pointer after sorting. …
Sorry for my late my pc was stucked, cuz of that, I didn't share for u what I'm learning. However, here answer for the yesterday night questions.
SamiTech Code
Photo
Questions: What're the following statement line doing👇 1.closest_sum = float('inf') #what happens if we remove #inf 2. pair = (None, None) 3. if abs(current_sum) < abs(closest_sum) 4. pair = (arr[left], arr[right]) Take u'r time & Try to think of it🤔 understanding this concept takes u to the next step💪🏻 AND YOUR ANSWER IN THE COMMENT SECTION👌
https://youtu.be/jzZsG8n2R9A?si=7UX5aOjZpRTpsWGO
Three Sum: u can watch this video to understand how to implement Three SumYouTube
3Sum - Leetcode 15 - Python
🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
🧑💼 LinkedIn: https://www.linkedin.com/in/navdeep-singh-3aaa14161/
🥷 Discord: https://discord.gg/ddjKRXPqtk
🐦 Twitter: https://twitter.com/neetcode1
🐮 Support the channel: https://w…
🧑💼 LinkedIn: https://www.linkedin.com/in/navdeep-singh-3aaa14161/
🥷 Discord: https://discord.gg/ddjKRXPqtk
🐦 Twitter: https://twitter.com/neetcode1
🐮 Support the channel: https://w…
SamiTech Code pinned «Thinking Problem (Two Pointer – Human Way): You're given this sorted array: [2, 3, 5, 7, 11, 15], target sum = 10 …»
SamiTech Code pinned «Questions: What're the following statement line doing👇 1.closest_sum = float('inf') #what happens if we remove #inf …»