L-114 | GFG POTD | Solve any K SUM Subarray Problem | shashwat | java | dsa

[@torque2123]

One of the best TH-cam channel for learning DSA... thankyou so much Bhaiya ❤❤❤

[@mr.nishantawasthi4402]

Nice explanation sir

[@DevanshSaxena-wz3op]

Very nice explanation

[@AnshMehta-q2h]

Sir, Loved the way you explained... after 2 months my placements are going to start and your DSA Vids are helping a lot thank you

[@Cryengineers8205]

Mine too sath me preparation kre kya?

[@nikhilmalhotra1986]

bhai bhaut bhaut pasand aayi video.. bhaut bdiya dost 🙂

[@Md_sadiq_Md]

Pushing the algorithm

[@srishtikhurana4139]

Amazing content on solving subarray sum problems for any given k! 💖💖💖 This channel deserves millions of views. The explanations are spot on, building the approach step-by-step from the basics to more challenging cases. Truly grateful for the effort in making complex concepts so accessible. Thank you so much! ❤❤❤

[@shashwat_tiwari_st]

🙌🙌

[@VIVEKSHARMA-zb4ss]

m jaldi jaldi ise finish kar rha hu taki bad m sath sath aajau aapke and thanks a lot for this awesome content sir

[@akash-111]

Nyc Explanation

[@nirupamsur5703]

Please start the Tree series soon..

[@superhimlive]

static ArrayList subarraySum(int[] arr, int target) {
// code here
int sum = 0;
int j = 0;
ArrayList list = new ArrayList();
for (int i = 0; i < arr.length; i++) {
if (sum < target) {
sum += arr[i];
}
while (sum >= target) {
if (sum == target) {
list.add(j + 1);
list.add(i+1);
return list;
}
sum -= arr[j];
j++;
}
}
list.add(-1);
return list;
} 2nd pattern solution hai bhaiya without using HashMap..🙂☺☺

[@samiranroyy1700]

🥰🥰🥰🥰🥰🥰🥰🥰

[@pankajkashyap2892]

Awesome😍

[@mr.nishantawasthi4402]

Sir iss java DSA ki playlist main 1000 + questions kar va do....jiss ko karne
K baad
Kuch aur na karna pade
Iss playlist karne k baad
Seedha Amazon aur Flipkart nikal jaye

[@nirupamsur5703]

tu direct CEO banega vi

[@amanraj4251]

vector check(vector&v, int n, int k) {
vectortemp;
temp.push_back(-1);
unordered_mapmp;
mp.insert({0, -1}); //x==k
int sum = 0;
for (int i = 0; i < n; i++) {
sum += v[i];
if (mp.count(sum - k)) {
temp[0] = mp[sum - k] + 2;
temp.push_back(i + 1);
break;
}
mp.insert({sum, i});
}
return temp;
} this code is getting tle in geeks for geeks don't know why at tcs 1073 even if i am using the unordered_map same its getting tle at 1019

[@dhukhiaatma7]

it is showing TLE in GFG now after writing exact same code in Subarray with given sum

[@shashwat_tiwari_st]

Can you share problem link?

[@dhukhiaatma7]

@@shashwat_tiwari_st now it's working thanks a lott for video and reply

[@ChaitanyaMeshram-ge2mc]

its giving error on gfg for Find Indexes of a subarray with given sum problem my code is
ArrayListlist = new ArrayList();
list.add(-1);
HashMapmp = new HashMap();
mp.put(0,-1);
int sum =0;
for(int i =0;i

[@lakshyadosi6304]

sub array with given sum is giving TLE

[@mr.nishantawasthi4402]

Sir please questions direct leetcode ya fir GfG pe solve kar diya kariye please sir inteli j idea. Se nahi please

[@BlendBox]

Hello Bhaiya,
Please aap cheatsheet de sakte hai ki kon kon se question puche jate hai FANG company, actually maine aaj hi aapki 1st video dekhi hai DSA+Java wali aur uss playlist ko apne pass save bhi kar li hai but bhaiya main job dhund rha hun toh aisa kuch possible hai ki mostly whi questions DSA ke puche aur main crack kar jaun kyoki aapko bhi pta hai company main DSA ki demand hai aapki playlist toh dekh hi rha hun par job abhi se achi mil jaye toh acha hoga, hope aap samjh gye honge main kya khena chah rha hun iss DSA ki wajah se mujhe job ki bhut tension, please help

[@shashwat_tiwari_st]

You can check my java dsa sheet. Usme frequently asked dsa questions arranged h topic wise.

[@BlendBox]

@@shashwat_tiwari_st can you please give the link maine playlist main check kiya mujhe mil nhi rha hai

[@shashwat_tiwari_st]

@@BlendBox check description of this video
th-cam.com/video/lZ5olZxEt_s/w-d-xo.htmlsi=G5oTmmb5U9l5ZSRl