Your explaination is just mind blowing

awesome course really enjoy the way you teach i hope in future we get more this type of course

the only place where i got the code of rabin_karp

ok i have paused the video at 15:01 . Q1 code: class Solution { public int searchInsert(int[] arr, int target) { int start = 0; int end = arr.length-1; boolean isascending = arr[start]<arr[end]; if (arr[end]<target) { return end + 1; } if (isascending) { for(int i = 0;i<arr.length;i++){ if (arr[i]>target||arr[i]==target) { start = i; break; } } return start; } else{ for(int i = 0;i<arr.length;i++){ if (arr[i]>target||arr[i]==target) { end = i; } } return end; } } } it is working. i know time complexity may be fu*ked up but i'm just a beginner lmaoo

IM VERY GLAD THAT KUNAL YOUR BACK... KEEP IT UP 👍

Best course❤🎉

great video

Complete DSA playlist

Can i use python to solve dsa ….

cool glasses

small suggestion for Q5 Easier condition before applying binarySearch while(target > arr[end]) { start = end; end = end * 2; // increase the size by 2 }

This is very great playlist. thank you very much

Congratulations for 600k

1:09:00

best explanation

hlw everyone, actually i'm having problem to find out the notes of these lectures....can anyone help me out.........or just tell me the process that where can i find out the notes which bhaiya is saying that'll be very helpfull.....

What happened to other videos in the playlist

Kunal a doubt, in question 5(infinite array): you have declared target as 10 its working fine, but after that for the next block of the array if we choose an element as target(for ex:100) its giving an exception(ArrayIndexOutofBounds) any solution for this?

FOR Q.6:- A Brute force solution could be finding out the maximum of the array and returning its index value:- class Solution { public int peakIndexInMountainArray(int[] arr) { int m=0; for(int i=0;i<arr.length-1;i++){ if(arr[i]<arr[i+1]) m=i+1; } return m; } }

??

sir mein devops bootcamp wali playlist sy devops sekh raha tha pr ap ny playlist sy sari video del kun kr di🥲

I don't understand the answer at 52:00. What is n here? the original number?

maruthi for 1 lack 💀

Bro please complete the series

Hey future me, drop your review here after completing this course.

I am just confusing with primitives and objects😢

Very good Kunal Bhai ❤

Thank you so much for making things so easy.❣❣❣❣❣❣

50 45 40 35 30 25 20 15 10 5

It is not for the beginners And each topice is not mentioned clearly

Hey kunal , I like this way of teaching it gives wonderful experience and efficient learning thank you!!!!!!

top notch video

1:39: 44 --> end > start doesnt work for me, but start > end works.

18:45

Your videos are very hwlpful to learn a lot. Heartful thanks to you . If possible please make one full stack colne project that will helpful for who ever learning new things.

please create video for window users, many commands are not working

Great video

shoutout

amazing

Negative canthal tilt + big nose + short frontal face + uneven thirds, on top of that short height...It didn't begin for u lil bro. Go and sleep instead of making videos

Really appreciated your way explanation with clarity ❤😊

Liked, Shared, Subscribed

Super explanation ❤😊

This is the best time and space complexity video. But can you pls explain how to solve this recurrence relation f(n) = f(n-1) + 1. Again it was amazing thnx

Wonderful video with lot of useful information

Kunal please make video of graph dsa

guys I know vedios good , but pls don't follow blindly for primitive variables values are not stored in heap, it is stored in stack , and 10 is not object

Wake up babe, new kunal video just dropped. Can't wait to see all the beggars spamming DSA comments.

Hello Bhai when will you do dp and graph???😊

please bring dp and graph series