วีดีโอ

Hey sir i am now starting dsa but while watching ur video is that I don't know hasmaps because i learning from roadmap where hasmaps in later while watching ur dsa video i don't understand that part where u give best solution so can u make video of that so beginners can understand

Sir iam a new subscriber, where to start learn form your playlist sir help me iam a student and fresher

😅

You left many surfaces

Hi was cibc sent you an offer letter or acceptance letter on an email or on the cibc portal?

Ho Popu mamu I am Vihan 🎉

Hey bro, will you bring DSA related projects, like how DSA is used in the real world. This data structure for this kind of.. it will be very much helpful.

Best explanation I ever seen so far. Thank you 🎉

Thank you for your efforts! Great video

🎆🎆

Subsribed

Thank You Very Much Sir 🙏🙏🙏

thank you so much sir...

Thanks for Sharing

Sir appreciate your hard work..I am starting my DSA journey.. please help me out where to start

soon channel boom...............entire IT industry.....

Contains Duplicate || --- every element removed lift and add right element ....1 st position 5 and 5 th position 5 how should we do.. already removed 5

Thank you my friend your explanation was awesome.. can i ask which approaches used in your solutions? Reminds me of subset problems

Thankyou for the detailed explanation, i'm strugging with dsa now it boost my confidence to do problems 🤞🏻

❤❤❤❤

I solved 4 interval medium problems after watching 20 minutes of your video 🎉

You're amazing for posting this! Thank you so much!

I got a notification to move forward but I am not able to login in workday platform to see notification. Help me out

very well explained

Really helpful video. I want to apply for automation tester position with 3 years of experience. Do u have idea like how many rounds will be there n those stuffs. If so please do reply 😊

Best platform to learn DSA, thank you !!

Python Solution : def containsDuplicate(self, nums: List[int]) -> bool: return len(nums) != len(set(nums))

def containsDuplicate(self, nums: List[int]) -> bool: return len(nums) != len(set(nums))

you are super sir,i want to know where you are working right now

you are just superb.....

Bro if some one could my quant probability interview like you it would be magical your teaching in exceptional

Great Explanation

This is incorrect. popMax() function will have a higher runtime then O(1). For example if our stack is: [1, 8, 3, 4, 5] and we perform a popMax(), we will need to pop N amount of numbers above 8 in the stack and also replace N amount of positions in maxStack with the new maxValue so runtime for popMax() here is actually O(N).

please make a course on recursion

Hi bro some people are using your TH-cam content and selling it for money. Yesterday I bought DSA course from Codemonk academy for 1399, it has your videos...

Bro I am one of the old follower I came to point that i can make career in python fastapi dev or java springboot kafka-- which one to choose

How to get into nokia

Me bca ke 2 year me hu college me moblie application development course karate he to usme hi career bana ho to kya uske stah full stack mobile app development course karna chahiye ki nahi Please reply

Super sir

20:40 how this solution is working code? for n = 1 and 2 answer is always 0.

Hi in few ays I i will have my interview as a client service representative job position. Can you please give me some tips how to crack this panel interview?

our popular super star it makes sense now 🤣🤣🤣🤣

your approach is pretty good but it's effectively the same as sorting all intervals initially which would have a time complexity (TC) of O((n×m)log(n×m)) during heap initialization, you are pushing all intervals into the heap. this costs n×m intervals in total where n is # of employees & m is the # of intervals inserting each one into the heap takes O(log(n×m)) time. The total time to insert all intervals would be O(n×mlog(n×m)). heap Ops: after heap is initialized with all intervals, you still need to pop each interval one by one and merge them. each pop op takes O(log(n×m)), and you need to do this for all n×m intervals, so the total time for this step is also O(n×mlog(n×m)) an optimized approach would be to push the first interval of each employee and then push the next interval dynamically as we process. this minimizes heap size to n (the # of employees). this approach effectively reduces to Merging K Sorted Lists that has a TC of O(n×mlogn) which is better than O(n×mlog(n×m)) each push into min heap is based on start time & not end time which was done in actual implementation in vid but explained incorrectly.

I wonder why ur play list not liked much. Hope it would get what it deserves

Super sir

where is the code

Please make video on monotonic stack

understood

Nice

I am loving your explanation and intelligence 🥰