Bhaii really Hashing is something that made our time complexion so easy and made our problem understandable as it gives constant T.C while finding elm using unordered sets and maps.
Watched "Two Sum | Find Duplicate | Find Repeating & Missing Values | Hashing Problems" on 20/11/2024. ✅ Completely understood the concepts explained. 📝 Made thorough notes while watching. Thank You So Much for This Amazing Lecture 😊
two point approach for two sum for reference:- class Solution { public: vector twoSum(vector& nums, int target) { vector tempi; vector ans; tempi=nums; sort(nums.begin(),nums.end()); int i=0,j=nums.size()-1; while(j>i){ if(nums[i]+nums[j]==target){ auto it= find(tempi.begin(),tempi.end(),nums[i]); ans.push_back(it-tempi.begin()); if(nums[i]==nums[j]){ auto iti= find(it+1,tempi.end(),nums[j]); ans.push_back(iti-tempi.begin()); } else{ auto iti= find(tempi.begin(),tempi.end(),nums[j]); ans.push_back(iti-tempi.begin()); } return ans; } else if(nums[i]+nums[j]>target){ j--; } else if(nums[i]+nums[j]
For missing and repeating number question there is math Solution Sigma n+a-b=sum of elements Sigma n^2 +a^2-b^2=sum of squares Solving you will get a and b
new dsa sheeet whoooo hoooooooo yeeesssh naaaye questions banaengeyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy microsoft ki job land karenge yyyyyyyyyyyeeeeeeeeeeaaaaaayyyyyyyy
Total lecture required for DSA- 75 and DAA -60 then complete DSA . Firstly learn C Programming language and then Focus DSA , after completing these agendas you can learn any new technology languages such as Java,react js , net beans, python and new trending deep learning data science. If you have any questions contact me . I have 5 years experience as a software developer and 15 years as faculty (C Programming DSA ,DAA and cloud computing ai and ml). Ok thanks.
i like all your videos , just a small catch up, jo second tareeka aapne batae , usme toh sorting ke baad elements ka index change hojaega , toh same question ka solution kaise hua?
Total lecture required for DSA- 75 and DAA -60 then complete DSA . Firstly learn C Programming language and then Focus DSA , after completing these agendas you can learn any new technology languages such as Java,react js , net beans, python and new trending deep learning data science. If you have any questions contact me . I have 5 years experience as a software developer and 15 years as faculty (C Programming DSA ,DAA and cloud computing ai and ml). Ok thanks
exactly , but what what we can do is we can create a vector pair and then sort .. but the problem is Space complexity would be O(n) here is the code .. //TC is O(nlogn) //SC is O(n) due to new vector created vector two_sum(vector &vec, int tar){
// create vector pair to store the array with index vector new_vec; for(int i=0; i
Excuse me mam,there's web development only available in html language,and Delhi hackathlon is coming.Can you please provide web development course in c++ as I'm watching the same playlist of c++ from a long time,thus it would be convenient for me to learn as well as make websites within the same coding language!please mam!😢
exactly , but what what we can do is we can create a vector pair and then sort .. but the problem is Space complexity would be O(n) here is the code .. //TC is O(nlogn) //SC is O(n) due to new vector created vector two_sum(vector &vec, int tar){
// create vector pair to store the array with index vector new_vec; for(int i=0; i
For anyone confused at slow and fast pointer approach watch this detailed explanation and Mathematical proof by Neetcode: ua-cam.com/video/wjYnzkAhcNk/v-deo.html
attandence - Present Didi
😅z
Bhaii really Hashing is something that made our time complexion so easy and made our problem understandable as it gives constant T.C while finding elm using unordered sets and maps.
Watched "Two Sum | Find Duplicate | Find Repeating & Missing Values | Hashing Problems" on 20/11/2024.
✅ Completely understood the concepts explained.
📝 Made thorough notes while watching.
Thank You So Much for This Amazing Lecture 😊
Understood and completed lecture ❤
Nice didi ❤ .... Thanks for the video 😊
Lecture Completed!
two point approach for two sum for reference:-
class Solution {
public:
vector twoSum(vector& nums, int target) {
vector tempi;
vector ans;
tempi=nums;
sort(nums.begin(),nums.end());
int i=0,j=nums.size()-1;
while(j>i){
if(nums[i]+nums[j]==target){
auto it= find(tempi.begin(),tempi.end(),nums[i]);
ans.push_back(it-tempi.begin());
if(nums[i]==nums[j]){
auto iti= find(it+1,tempi.end(),nums[j]);
ans.push_back(iti-tempi.begin());
}
else{
auto iti= find(tempi.begin(),tempi.end(),nums[j]);
ans.push_back(iti-tempi.begin());
}
return ans;
}
else if(nums[i]+nums[j]>target){
j--;
}
else if(nums[i]+nums[j]
Shraddha madam ka
First तरीका
Second तरीका
😮
Good teaching dear ma,am
Completed ✅
Done❤
Excited to learn a new concept🤭☺️🤩
Nice awesome keep it up...
Thankyou ✨ Completed ✨
very good quality of questions
Done 👍
Thank you Didi 😊
Thank You Ma'am
Thanks mam❤
completed lecture - 37 💪🔥
completed ❣️
lecture complete👍👍
Done di!!
You're GOD!!
completed the lecture :)
Attendance ❤❤❤
Thank you so much!!!!
Lecture successfully completed on 20/11/2024 🔥🔥
Nice!
Completed
Nice 🙂
RAM RAM DIDI JI🙏🚩
Jai ram
Hai Shree ram
Lecture 37 completed on 28 Nov 2024 Concept of Slow Fast Pointer was. Really good ❤❤
Day 37 completed ✅
Nyc explain 👍❤️
first time difficult to understand node topic but understand all solution expect node 😇
awesome di
done mam
Attendence 👍
Thanks you mam❤❤❤❤❤❤❤
Completed!
Day 38 ✅
10 November
Lecture Completed
Finding duplicate can be done with binary search
Int start=1;
Int end=n;
While(start
this will not work no. Of elements is not defined also two operators can be used using bitwise operators
Also i is not defined
binary search works on sorted array, you have to first sort the element , also there is some logical mistake
@@AshutoshKumar-xq4ix
class Solution {
public:
int findDuplicate(vector& nums) {
int low=1;
int high=*max_element(nums.begin(),nums.end());
while(low
@@unccenored
class Solution {
public:
int findDuplicate(vector& nums) {
int low=1;
int high=*max_element(nums.begin(),nums.end());
while(low
am entranceted ❤
Done all leacture
Repeating sum was also easy one but require some logic initially . but overall interesting one
Good G
Mam, please do Parentheses type problems facing more difficulties on those problems
11th Jan
Didi make a video for Node js
Done this lecture
Done
Mam please upload 1 lecture daily .
Thanku mam
completed 11/10/23
For missing and repeating number question there is math Solution
Sigma n+a-b=sum of elements
Sigma n^2 +a^2-b^2=sum of squares
Solving you will get a and b
completed
lecture 38 completed day 33
Plz Make one video on .net development and compare also🙏🏼
❤
new dsa sheeet whoooo hoooooooo yeeesssh naaaye questions banaengeyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy microsoft ki job land karenge yyyyyyyyyyyeeeeeeeeeeaaaaaayyyyyyyy
☺👍
Please make a video on how to deploy code
Please cover all the leetcode question
"Attendance" is here
.
👇
But at first slow and fast meet at 4 also then why it is not considered.
Plz anyone
Mam how many class will come to complete full DSA?
Total lecture required for DSA- 75 and DAA -60 then complete DSA .
Firstly learn C Programming language and then Focus DSA , after completing these agendas you can learn any new technology languages such as Java,react js , net beans, python and new trending deep learning data science. If you have any questions contact me . I have 5 years experience as a software developer and 15 years as faculty (C Programming DSA ,DAA and cloud computing ai and ml). Ok thanks.
Video on quantum computing road map
Hlo ma'am❤❤
i like all your videos , just a small catch up, jo second tareeka aapne batae , usme toh sorting ke baad elements ka index change hojaega , toh same question ka solution kaise hua?
Please provide roadmap how to get job as fresher in Cybersecurity domai.. including notifications
👍👍👍👍👍
Mam please linked-list, stacks, and queues
Total lecture required for DSA- 75 and DAA -60 then complete DSA .
Firstly learn C Programming language and then Focus DSA , after completing these agendas you can learn any new technology languages such as Java,react js , net beans, python and new trending deep learning data science. If you have any questions contact me . I have 5 years experience as a software developer and 15 years as faculty (C Programming DSA ,DAA and cloud computing ai and ml). Ok thanks
Then I will explain to you above topics
Completed on November 13 2024, 12:10am.
Mam ,
Please please let us know about prompt engineering.
Ye kya hota hai basically?
And what we should do for that??
In the two-sum problem, I think the two-pointer approach will not work because after sorting, the indices will be different from the original array.
exactly , but what what we can do is we can create a vector pair and then sort .. but the problem is Space complexity would be O(n)
here is the code ..
//TC is O(nlogn)
//SC is O(n) due to new vector created
vector two_sum(vector &vec, int tar){
// create vector pair to store the array with index
vector new_vec;
for(int i=0; i
mam i think, your 2sum better solution won't work bcz after sorting indices will change
and thnks for this dsa series ❤🙏
Please make these course minimal number of video
I want to join your collage
what software you use for teaching
Didi we need the Sailpoint iiq course please bana do
Hello
Kya Biology vale student DATA SCIENTIST ban sakte he ?
Anyone can it just depends on your passion and interests
Mam Recursion kb start karvaoge 🥲
Excuse me mam,there's web development only available in html language,and Delhi hackathlon is coming.Can you please provide web development course in c++ as I'm watching the same playlist of c++ from a long time,thus it would be convenient for me to learn as well as make websites within the same coding language!please mam!😢
hey guys is there any Notes of these lectures
Can't we do a expectedSum - actualSum kind of thing for last question instead of linkedlist approach
Mam please upload powershell please
i guess the better approach wont work because the target is to return indices. So if we sort the array we have changed the indices :>
exactly , but what what we can do is we can create a vector pair and then sort .. but the problem is Space complexity would be O(n)
here is the code ..
//TC is O(nlogn)
//SC is O(n) due to new vector created
vector two_sum(vector &vec, int tar){
// create vector pair to store the array with index
vector new_vec;
for(int i=0; i
For anyone confused at slow and fast pointer approach watch this detailed explanation and Mathematical proof by Neetcode:
ua-cam.com/video/wjYnzkAhcNk/v-deo.html
First Comment ❤
13/11/2024
lecture 37 completed!
Shraddha mem your father was farmer?
11/12/2024 Lecture Completed
lecture 37 completed on 29th nov
completed 26 nov
Dedi please discord per kase aya please send link
anyone tell the sigma course is available in english
Day 38
.
...
...,
,....,...09/11/2024
Jay Shri ram
completed on 9th Feb 2025
Please mam react.js oneshot
Online earning Wala website par video create karo 🎉❤