You are doing awsome job ...i randomly came to this video and then checked all your videos...it has somehow solved my recent doubts... awesome content loved it 😊
Bhaiya I have lots of things going on in mind and disturbing me ....I really need a mentor who can guide me to come out of this.....could you pl help me ?? ...where else can I ask ??
Solving first and second problem is pretty much doable ,but third problem is where I gets stuck,mostly because of wrong answers and time limit exceeded.
this was my first contest it took me nearly 15 mins to solve easy one because of the thinking and approach but when I get to 2nd 3rd and 4th i couldn't think of a right approach is there any way to improve !! I am following the neetcode 150 and solved problems in array !! and confident with hashmap and hashset can you suggest anything ?
Can you please share a dedicated sheet in which the questions are given or links are given to other problem sets after solving which we would be able to solve all leetcode contest questions.
Please can you suggest How to solve problems related to Prefix/Suffix Sums . Not able to think/solve the prefix sum related problem in the Contest . And How get Intution for it
You should always think about prefix suns in any subarray related problems. Try to always write the value of any function for a subarray [l,r] in terms of the prefix sums of l and r. This can be extended to other things like xor too.
for 4th prob , believe in urself.
seive of eratos, bs on ans, sliding window, two pointer, dp
what a man, great guidance sir.
cp algo next greater, monotonic stack 1500-1800 dp, dp hard, dijsktra, topo, floyd warshall, bellman (hard leetcode) , solve(hard leetcode)
You are doing awsome job ...i randomly came to this video and then checked all your videos...it has somehow solved my recent doubts... awesome content loved it 😊
Thank you so much. Means a lot to me!
Bhaiya I have lots of things going on in mind and disturbing me ....I really need a mentor who can guide me to come out of this.....could you pl help me ?? ...where else can I ask ??
Same here
Solving first and second problem is pretty much doable ,but third problem is where I gets stuck,mostly because of wrong answers and time limit exceeded.
Same same
this was my first contest it took me nearly 15 mins to solve easy one because of the thinking and approach but when I get to 2nd 3rd and 4th i couldn't think of a right approach is there any way to improve !! I am following the neetcode 150 and solved problems in array !! and confident with hashmap and hashset
can you suggest anything ?
thank you very much @Harisam sharma one of the best channel for cp and dsa
thanks and keep making videos.
leave no stone unturned in efforts
let's see the biweekly and weekly leetcode contests this time
Man, please upload the exchange arguments session!
Can you please share a dedicated sheet in which the questions are given or links are given to other problem sets after solving which we would be able to solve all leetcode contest questions.
Bhai thodi mehnat to Khud Karlo😂
recently i've seen leetcode questions involving the use of digit dp, dp with bitmasks, any resources from where one can learn these topics?
DP with bitmasks: ua-cam.com/video/rj1EsYuWTYY/v-deo.html
Digit DP: Kartik Arora's UA-cam Channel has some good videos
@@Harisamsharmawill check these out, thankyou
tysm
I did more than 350 problem on leetcode but stills hassling with 3rd one and 4th one
Bro i do more than 1200+ problems but still struggle with 4 th one
@@anjumarakhan8647 cool
@@anjumarakhan8647 can you give your leetcode id
@@anjumarakhan8647 but do you solve 3rd problem
Please can you suggest How to solve problems related to Prefix/Suffix Sums . Not able to think/solve the prefix sum related problem in the Contest . And How get Intution for it
You should always think about prefix suns in any subarray related problems. Try to always write the value of any function for a subarray [l,r] in terms of the prefix sums of l and r. This can be extended to other things like xor too.
as i solved 50+ problem on dp still cannot solve 3rd problem
Great 😃😃
black box segment tree