Відео

Great idea sir

bro thanks a lot...love this can u please increase your sound its very low even in the max...

voice is very low

You have a very clear, iterative way of thinking and also the same way of explanation, thanks!

Hi, how do you come to know that doing +1 with k or doing -1 with n. im asking like how do you get this approach?

very helpful❤❤❤❤

Using temporary variable t

a=a^b b=a^b a=a^b

Excellent 🎉

👌👌💐

Great podcast, Amit! Your insights and experiences are truly inspiring. Your emphasis on learning and mindset resonates deeply with me. Grateful to have learned problem-solving from you!

On which day of the week does this contest happens I would like to participate from this week could you please say

Good Explaination sir.

good explanation, made easier to understand

👍

Time complexity for this code is O(N^2), this can be further reduced to O(N) by using stack. Please do say the optimized solution.

Thanks

good one !

Bro i am in btech 2nd year please suggest the skill set(languages and subjects) to crack a good placement

nice explanation sir

Here is MY Code : class Solution: def resultsArray(self, nums: List[int], k: int) -> List[int]: n = len(nums) if n == 1: #If there is only one ele it is always sorted if k == 1: return [nums[0]] else: return [-1] if k == 1: #Window containing one ele is always sorted return nums i = 0 j = 0 res = [-1 for i in range(n-k+1)] #Initialising result with -1 while j < n: if j > 0 and nums[j] != nums[j-1] + 1: #Checking the condition to calculate our ans i = j # If they are not consecutive => any window containing them cannot be sorted so slide the window beyond the pair j += 1 continue if j - i + 1 < k: #window size not hit j += 1 elif j - i + 1 == k: #window size hit so take decision res[i] = nums[j] i += 1 j += 1 return res

Can you share the code in the description or in comments

brother naku oka doubt undi adhi test case ante enti code chef peoblem lo mention chesi undi naku ardham kale pls explain chy brother

Well done boy ❤

Zaid .. Excellent explanation man ..

Thanks for the Simple and easy to follow roadmap. keep up the hard work!

Hi I have a cgpa of 7 on 4th sem , Is there any possibility that I can get 10LPA on placements if I do hardwork

instead of so many else if we could have log2()

Nice Explanation

Does the Neighbor array also include the parent of a given node. If so, how do we distinguish which element in Neighbor array is parent and which one is child node?

I am also from ECE background bro 😊

right volume is much greater than left volume fix that

wahh anna wahh😍😍😍😍

Cognida visited our college, can you tell me what can I expect in Online test??? Do they ask aptitude?? I haven't studied aptitude yet.. PLEASE REPLY

Really ,Your explanation help a lot to understand problem in easy manner.

Audio quality very bad

Nice and super explanation but We cannot hear your voice properly. That would be better if you use any mic

NICE SUPER EXCELLENT MOTIVATED

NICE SUPER EXCELLENT MOTIVATED

From next can you try atleast 4 div 3 problems . It would be helpful

Rafi bhaii ke aage koi bol sakta hai kyaaaaa

we need in the python code sir?

Nice explanation bro. Can you please share the codes, like in drive. That will be a huge help.

the rest 3 problems when?

NICE SUPER EXCELLENT MOTIVATED

Scholarship

🥰

big fan of your work sir rohit sir🔥🔥

Thankyou Sir👍

Thank you sir!!