Lecture 13: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 1

[@omeshnath6826]

Bhaiya app toh pichla lecture khtm karne se pehle hi dusra lecture daal dete ho thumbs up

[@jaikhatri4783]

Sahi mein bhai

[@rameshmalhotra9525]

kzbin.info/www/bejne/h4XEmnlug5ucabs

[@learnwithdivya7963]

​@@jaikhatri4783 d k d m

[@learnwithdivya7963]

​@@jaikhatri4783 hot

[@learnwithdivya7963]

​@@jaikhatri4783 hot hai

[@harshmedhavi2509]

Now that's what we call as Quality content! Bhaiya please continue like this, we all are blessed to have you as our mentor! Thanks.

[@jyotiswain2262]

😍 Trueeee! Blessed to have this series in this crucial placement period.

[@RobertSmith-by5fp]

s=mid+1 , to bhi us par ja skta hai??

[@sandeepsalaria2243]

@@RobertSmith-by5fp bhai if condition mai arr[mid]

[@RobertSmith-by5fp]

@@sandeepsalaria2243 man lo ki , mid hai wo peak ke just pehle wala element hai tb to arr[mid]

[@sandeepsalaria2243]

@@RobertSmith-by5fp Dry run kro khud feel aa jayega bhai. Visualise kro mid+1 agreed hoga bhi toh wo mid ke brbar hi hoga nd tb wo dusri condition ko check kr lega na else wali jispe mid ke brbar hai thn peek element mil jayega

[@karanchilana228]

You are absolutely leaving a legacy behind every lecture.. student's respect towards you is increasing constantly by the magnitude of your hard work.. thanks a lot man

[@sahilanand30]

The best and the unique thing about this coursr is, it's not helpful for beginners only. Instead it's helpful for all skill levels of programmers. Best content 🔥

[@musharrafm1154]

This is by far the best DSA course ever on the planet!!!!!!!!!!!!! Thank you so much bhaiyya! I'm able to understand DSA like a robot now, after struggling for 1 year searching random videos on KZbin.

[@mastermaxin1548]

bro isme error bata de pls first occurrence hi nhi chal hi #include using namespace std; int firstocc(int arr[],int size,int key){ int start = 0; int end= size-1; int ans = -1; int mid = start +( end -start )/2; while(start

[@photon7404]

@@mastermaxin1548 sahi toh hai .

[@techprogrammer4158]

Literally Cried babbar bhai because I am not able to find the best course for DSA. But you are making the videos which I wanted and 1 hour videos are not at all making me bored because I love your way of teaching and style. Please dont stop the series any way. Because it makes my heart to be broken 💔. Love from Hyderabad.

[@MilanParmar.]

hello bhai abhi kya kar rahe ho?

[@a.revanthkumar1827]

Hi bro What are you Doing and where do you stay in Hyderabad , Can I get u r contact

[@mrshephu]

@@a.revanthkumar1827 hi me

[@therahul5304]

U

[@kabir2190]

you cried because you are serious for your life hats off bruh

[@abdullahshaikh7409]

For question 2: int peakIndexInMountainArray(vector& arr) { int start = 0; int end = arr.size()-1; int mid = start + (end - start)/2; while(start arr[mid+1]) { return mid; } else if(arr[mid] < arr[mid+1]) { start = mid + 1; } else { end = mid; } mid = start + (end - start)/2; } return -1; } faster than 93.30% ye approach intutive aur efficent hai

[@adarsh1360]

wahi approach to he whule me equality nhi chaie ek comparison extra ho raha

[@mkat21]

this is easier to understand I was confused by sirs approach this clarifies it .thank you.

[@cuteminired6550]

Thanks man

[@yashzawar7938]

please try to cover more questions so that we will get enough confidence to solve by ourselves. Great content and great efforts, this DSA series is truly amazing and you are a gem!

[@mastermaxin1548]

bro please isme error bata de first occurence hi nhi chal raha #include using namespace std; int firstocc(int arr[],int size,int key){ int start = 0; int end= size-1; int ans = -1; int mid = start +( end -start )/2; while(start

[@63_leticiajacob14]

@@mastermaxin1548 Run ho raha h, bas array mai repeating elements add karo

[@aryyann05]

@@mastermaxin1548 chal toh rha hai bhai

[@vikasjat3613]

Thank you so much bhaiya for giving us this series. Almost all the students in our college use this series to prepare DSA.🙂

[@ayushgupta-gt4ch]

the most admirable aspect is that you are not in a hurry ,you try to explain each topic through many times and in many ways,,,thats really a commendable job. rest everything is completely fantastic

[@nitinsharma7251]

This is best dsa course I've ever encountered in youtube Thanks for such great content free of charge

[@dharrsanamarnath7541]

Istg Apna College had efforts into making it beautiful. Babbar makes sures we understand, he doesnt skip with half written code

[@yathinkumar5356]

@@dharrsanamarnath7541 Very true, I used to follow apna college before, but it feels like half completed on the explanation side

[@rameshmalhotra9525]

kzbin.info/www/bejne/h4XEmnlug5ucabs

[@sjcreations2490]

Bhaiya may the Almighty bless you for providing such a quality content for free to all the students, 👍☺

[@mastermaxin1548]

bro please isme error bata de first occurence hi nhi chal raha #include using namespace std; int firstocc(int arr[],int size,int key){ int start = 0; int end= size-1; int ans = -1; int mid = start +( end -start )/2; while(start

[@sidhantchaudhary9202]

@@mastermaxin1548 koi error nhi h thik chl rha h ekdm

[@govindsuryavanshi6653]

First I have completed all DSA series and now conclude this is Greatest ever DSA series to exist on youtube or paid courses. Your contribution will be remembered. You're God of DSA for us🙇‍♂

[@nipunbansal6057]

I am in first year and this course make me skillful than my seniors(mostly) in coding . Thank you for this

[@Nishad_Ranade1729]

Bhaiiya one suggestion ....I want two things from you. 1) First one is If possible you give topic time table that which topic you will teach us in which day or date so we can atleast prepare the topic understand the topic by ourselves and solve some problem related to topic ..... which helps us to understand all points that you taught in video 2) And second one is you give all difficulty level question links ( generally medium and hard) and maximum problems of that topic to us that we can master the topic and solve any problem of that topic in all formats in interview or in CP, or in leetcode and all other platforms....

[@prernapriya8699]

yes right

[@daayush6654]

Eagerly waiting for part 2 and 3 of binary search questions :)

[@priyanshumundra4453]

find pivot index:- class Solution { public: int pivotIndex(vector& num) { int sum = 0; for(int i=0; i

[@encoderdude]

thanks dude

[@prathamgupta3984]

thanks vaii...

[@AnotherGmail-z7n]

The code for finding peak element index is not absolutely correct you can try this one int mountainPeak(int arr[], int n){ int start = 0; int end = n - 1; int mid = start + (end - start)/2; while (start arr[mid]) { end = mid - 1; } else{ start = mid + 1; } mid = start + (end - start)/2; } }

[@mayanvajani934]

in the 1st if condition add a condition that also mid!=0,otherwise when mid=0,it would overflow.

[@Shagunkaushik2929]

​@@mayanvajani934explain it in detail why it will overflow I m unable to get ur point

[@communist_amoeba3923]

also use else if instead of if and else. or complier won't give answer

[@dheerajmehra320]

what did i learn in this lecture 1. how to manipulate the standard binary search code when required if the array is sorted 2 . how to find first and last occurance of the element 3. how to find the total no of occurance of the element in the sorted array 4. how to find the peak index of the mountain array

[@rahulrastogi5312]

Bhaiya instead of doing e=mid in mountain array question we could have also added a new condition for the peak itself where (arr[mid]>arr[mid-1] && arr[mid]>arr(mid+1]) ... it's just for more clarity if by chance somebody is not getting it ... Thanks Bhaiya ❤️

[@RohitKumar-zd2hu]

Very good point

[@ayushiiitian]

Yeah I have also done by this method apart from what sir told😀

[@simranbandhu9926]

agar arr[mid]

[@samudralaabhiramrao5904]

​@@simranbandhu9926 then we are saying end = mid

[@RahulKumar-tq2xb]

if mid=0 then arr[mid]>arr[mid-1] will give a runtime error. will need to bypass that.

[@princekumarand6284]

bhaiya last moment pr humesha realize hota hai ki padhna hai but jab teacher itna acha hona toh last moment me pressure ki jagah confidence ajata....am boosted and after wasting 2 year college am full power completing your series from last month❤❤❤

[@study_desk4231]

Q1) FIRST and LAST occurrence EASIEST and FAST solution: #include pair firstAndLastPosition(vector& arr, int n, int key) { // LOWER BOUND first index dega key ki ya fir index of a value < key if key is not present. //UPPER BOUND last occurance of key k index se ek index bada k dega and if key is not present tab woh end value i.e. arr.size() de dega pair p; int first = lower_bound(arr.begin(),arr.end(),key) - arr.begin(); if(arr[first]!=key) //checking key present or not { p.first=-1; p.second=-1; return p; } //ab value to pakka present hai.. toh upper bound jo bhi index de usse ek kam karne se jo index aaega last occurance wahi hogi. int last = upper_bound(arr.begin(),arr.end(),key) - arr.begin() -1; p.first= first; p.second= last; return p; }

[@mastermaxin1548]

bro first t occurrence me error bata de #include using namespace std; int firstocc(int arr[],int size,int key){ int start = 0; int end= size-1; int ans = -1; int mid = start +( end -start )/2; while(start

[@parthlahoti5404]

another approach for peak mountain array. class Solution { public: int peakIndexInMountainArray(vector& arr) { int start=0;int end=arr.size()-1; int mid=start+(end-start)/2; while(startarr[mid+1]){ end=mid-1; } if(arr[mid]arr[mid+1]&&arr[mid]>arr[mid-1]){ return mid; } mid=start+(end-start)/2; } return mid; } };

[@097mazharsaifi8]

i can feel and see my improvement in the dsa after learning from your lectures ...thankyou so much Babbar bhai...❣❣

[@suyashverma156]

jitna dedication se mae ye series complete kr rha hun uthna mae apni fav web series bhi nhi kiya hun...apka samjane ka tarika bhaut addictive hae bhaiya

[@HighPingMonk]

Mad respect for this guy....!! ❤️

[@shrutivvv]

Seen plenty of videos for this question, but this is the best!

[@RohitRana-tz2lr]

Thanks, bhaiya for this video... now I am getting confidence in DSA... just because of you... Grateful to have teacher like you.

[@rajvishwakarma5672]

Pivot in an array: int pivotIndex(vector& nums) { int lsum = 0; int tsum = 0; for(int i=0; i

[@anushkayachit]

Thank you sir you are really the best teacher!!!!! Just one question.... when is this course estimated to complete?? I'm asking because i have my placements in 4-5 months.... i hope i get extra time to prepare after this course ends. Anyway.... love this video!!

[@CodeHelp]

I m working hard to cover everything swiftly. I m estimating to complete this course around March

[@abhilashpaul4371]

Thank you for your effort sir!!!🙏🙏

[@sandeep_khariwal8137]

@@CodeHelp Bhaiii market me 🔥🔥🔥🔥 aag lga dii ....apka content or explanation cout

[@Mb-nr5nz]

@@CodeHelp do we need to learn c++ language before starting this course or we can just learn c++ basics side by side

[@Mb-nr5nz]

@@CodeHelp and also by just doing your this dsa course can my placement dsa part get covered completely or I need to learn any other things of dsa

[@pranavgaur1086]

for the peak element in mountain his approach of using end = mid is due to the nature of the problem where we if say the mid is correct then we dont want to skip so we store as end =mid . this will result in the remaining array to become monotonic where the condition of arr[i]

[@ashutoshadya5286]

For peak element index you can also do - int peakIndexInMountainArray(vector& arr) { int s=0; int e=arr.size()-1; int mid=s+(e-s)/2; while(s

[@anamikaverma8866]

I submitted your code as well as sir's code but i am getting 1 case wrong. 49/50 are correct but one with 4000 elements is incorrect..please help

[@anshultrehan743]

Bhai tle maar gya Mera similar logic lose Kiya tha

[@iamprateek3220]

@@anamikaverma8866 try this: int peakIndexInMountainArray(vector& arr) { int n= arr.size(); int l=0; int r=n-1; int mid= l+((r-l)/2); while(larr[mid-1])){ return mid; } else{ r=mid-1; } mid= l+((r-l)/2); } return 0; }

[@iamprateek3220]

@@anshultrehan743 try this : int peakIndexInMountainArray(vector& arr) { int n= arr.size(); int l=0; int r=n-1; int mid= l+((r-l)/2); while(larr[mid-1])){ return mid; } else{ r=mid-1; } mid= l+((r-l)/2); } return 0; }

[@AbhishekKumar-nz9dn]

bhai video abhi start kari hai . socha likh deta hu. bhai aap kamaal ho bhai . ❤️🙏👍💕

[@VihaaShetty]

No words, you are just the great teacher one can ask for, hats off!!🙏🙌

[@scoc55vora15]

Peak index in Mountain Array wala QUESTION ekdum faadu tha ❤️ Truely You mean it what you said "Course poori Tarah se Placement oriented Hain"🔥

[@AmandeepSingh-lc3kg]

thank youh bhaiya ji loving this course.... awsome explanation .... every concept is explained with example more than enough...just the course i every coder ever wanted...just thanks once again

[@princeprakash0957]

Cin>>time and patience to love babbar dsa course; Cout

[@random-0]

H/W: //Pivot sum // time complexity: O(n), Space complexity: O(1) //after coming with this approach by myself I thought it's not efficient enough as I'm scanning the array twice but I was amazed after seeing that in leetcode discussion section this is the best solution given //lagta hai ye series ke karan aacha logic build ho reha hai. THANKYOU!!! class Solution { public: int pivotIndex(vector& nums) { int len = nums.size(); int totalSum = 0; for(int i =0; i

[@mastermaxin1548]

bro isme error bata de #include using namespace std; int firstocc(int arr[],int size,int key){ int start = 0; int end= size-1; int ans = -1; int mid = start +( end -start )/2; while(start

[@arnabsingh364]

@@mastermaxin1548 put key == arr[mid], not arr[mid] == key and so on

[@priyanshkumar17]

What's the question number for this problem on LeetCode ?

[@iamprateek3220]

@@arnabsingh364 == operator is commutative so that doesn't change anything

[@stake_top]

My approch for 2nd question int peak(int arr[],int n){ int i=1; int ans; while(arr[i]>arr[i-1]){ ans=i; i=i+1; } return ans;}

[@riyarai670]

Completed this lecture bhaiya also done the homework....All thanks to you......Aapki videos without any doubt motivation boost kar deti hai jaise jaise har concept clear hota jata hai vaise vaise motivation boost hota jata hai......BIG THANKS BHAIYA

[@devyanshubhardwaj9460]

thanku bhaiya so much i am in second year right now and before this course was launched i was woried about my progress in dsa but after watching all yr vedios i am in great confidence that i can crack any company i have seen may playlist and follows may channels but this most premium playlist i have ever seen waiting for upcoming vedio bhaiya !!!!!!

[@amulyaabhinandan8161]

*Another method for Peak Index in a Mountain Array:-* class Solution { public: int peakIndexInMountainArray(vector& arr) { //using my own algorithm int s=0, e=arr.size()-1; int i=0; while(s < e) { if(arr[i] < arr[i+1]) { i++; } else break;; } return i; } };

[@Shivamkumar-xu6hu]

It's TC will be O(n)

[@amulyaabhinandan8161]

@@Shivamkumar-xu6hu Yup, Complexity sucks😅

[@bhavishyasharma998]

To my surprise Linear Seach Approach takes 183 ms which is nearly 2-10 ms lesser/more than binary search approach. pair p; int first_occ=-1; int last_occ=-1; for(int i=0;i

[@abdxlive]

Lecture 13 Completed On 10 June 2024

[@adityaukey5234]

Kitna hua bro abhi

[@ahmadrasheed2598]

Best of luck

[@yashchampaneri1972]

Are bhai full high josh me iss video ko dekhege! Mast!

[@sjcreations2490]

It's my humble request please maintain this consistency till end. We all are with you bhaiya. Sab ek sath placed honge👍☺

[@parthmangalkar]

Bhaiyya aap ko itne mehnat karte hue dekh kar hum inspire ho gaye hain!! Bas ab DSA mein bahut maja aa raha hain, kyun ki aap jo concepts sikhate hain na woh ekdum acche se samj aati hain aur problems bhi aap mast (acchi level) ke solve karvate ho!!

[@h_a_r_s_h01]

Bhaiya sometimes it happens, if I can't able to understood the concept, I feel like why I can't able to catch it, might be others are capable of, (e.g. XOR concept - Find Duplicates : 10th lecture) and this leads to massive demotivation. I knew your way of teaching is excellent but sometimes you goes extremely fast and furious. If someone is reading this comment kindly provide me solution for this issue. Regards ❤️

[@parassetia4964]

try watching that lecture again, and read more about that topic on google...explore a bit yourself That way it will be more clear to you and you might never forget that concept atleast coz you tried yourself for it

[@CodeHelp]

Will try to be a bit slow from next video

[@dharrsanamarnath7541]

@@CodeHelp you are going by the correct speed. Else the lectures will be boring. I’m fresher Babbar bro. Love from India, Tamilnadu

[@sunilshekhawat5080]

Me also .

[@sergion_brayen]

your teaching style is great bhaiya. you explain everything in easiest way love from bihar

[@prashantmaurya6868]

35:10 Ques 3 - #include using namespace std; int peakElement(int arr[], int size) { int start = 0; int end = size - 1; int mid = start + (end - start) / 2; while (start arr[mid + 1]) { end = mid - 1; } if (arr[mid] > arr[mid + 1] && arr[mid] > arr[mid - 1]) { return arr[mid]; } mid = start + (end - start) / 2; } } int main() { int arr[9] = {1, 2, 3, 4, 6, 4}; cout

[@harikumar3917]

hanji

[@shubhamvairagade1]

Hn

[@vinay_rajput_1812]

i think this will not work try corner cases,suppose peak element is present on 1 index then third condition will compare mid with negative index

[@hemantpathak983]

Love from 1st Yearite from IIT Dhanbad. Bhaiya you too famous among fist years here. Thanks and I pledge I will not leave in between.

[@hermionegranger6493]

binge watching this DSA series .....your teaching style is great!!

[@shujahtali7968]

Yr yeh code kidr run krty ho dev py error Dera ha 🙄

[@sounaksaha1455]

Best course on DSA.... I repeat... best course.... Hats off!

[@virajdeshpande9821]

Time-Stamp 25:00 code: #include #include using namespace std; int firstOccurance(int arr[], int n, int key){ int s = 0; int e = n-1; int mid = (s+e)/2; int ans = -1; while(skey){ e = mid-1; } else if(arr[mid]

[@rounakmukherjee9540]

Awesome bhaiya as expected, Please don't feel demotivated when don't get reach.

[@madhavgupta5493]

Q2 (23:38) . Find total number of occurrence of a number in sorted array. #include using namespace std; int lastOccurence(int arr[], int size, int value) { int start = 0, end = size - 1, mid = start + (end - start) / 2, ans = -1; while (start

[@MohdSameer-so9bt]

bhaiya maza aa gaya. Aisa shayad he kisi ne samjhaya hoga. keep up the good work bhaiya. Aap jaise teachers ho toh phir koi bhi ds algo nikal sakta hai.

[@harry-cf4ii]

Bhaiya if we do ur C++/DSA course does it even cover all the topics of theory for Competitive programming???or we have to do CP theory from other courses available out there!!!if yes then after doing ur course videos can we directly jump on codechef/codeforced paralelly and give contests???my dream is to become 6star on codechef or candidate master at codeforces. Is ur course also enough for CP?

[@CodeHelp]

First we will cover all the important topic for interviews, after that we will discuss CP topics.

[@harry-cf4ii]

@@CodeHelp so as am in 1st sem should i follow this course??as it it more interviews oriented and i want to do CP!!!

[@shubhambansal1495]

@@harry-cf4ii If you complete this course first and start your cp then you will feel motivated bcoz you will be able to solve questions more easily

[@shubhamvairagade1]

@@harry-cf4ii hn bhai kr🙂 basics se hai

[@Atvkaur1111]

@@shubhambansal1495Bhaiya where I should take CP classes? Please tell some best classes?

[@aayushgiri9788]

bhaiya ye ek common sense vali approach mili.thoda tym extra lagega but easy code hai for first and last occurence question::: pair firstAndLastPosition(vector& arr, int n, int k) { pair p; for(int i=0;i=0;i--){ if(arr[i]==k){ p.second=i; break; } p.second=-1; } return p; }

[@motivation_with_harsh]

//finding the occurance of a particular element in an array using binary search //A = {0,0,0,1,1,1,1,1,1,1,2,2,2,2,2} //find occurance of 1; //output -> occurance of 3 = 7 //code written by harsh shukla #include using namespace std; int leftOccur(int arr[] , int size , int key ){ int l = 0 , r = size-1 , ans=-1 , c = 0; while(l arr[mid]){ l = mid + 1 ; } else{ r = mid - 1; } } return ans; } int rightOccur(int arr[] , int size , int key){ int l = 0 , r = size-1 , ans=-1 , c = 0; while(l arr[mid]){ l = mid + 1 ; } else{ r = mid - 1; } } return ans; } int main(){ int key; int arr[]={0,0,0,1,1,1,1,1,1,1,2,2,2,2,2}; int size = sizeof(arr)/sizeof(int); cout

[@PREETITECHNOLOGY]

Home work:- class Solution { public: int pivotIndex(vector& nums) { int total = accumulate(nums.begin(), nums.end(), 0); int leftTotal = 0; for (int i = 0; i < nums.size(); ++i) { int rightTotal = total - leftTotal - nums[i]; if (rightTotal == leftTotal) { return i; } leftTotal += nums[i]; } return -1; } }; tq sir.. for better understanding

[@thenikhildaiya.]

Did the code part of 1st and 2nd question by myself after getting the approach. Thank you for so good explanation.

[@ijunedaslam]

40:50 - HomeWork class Solution { public: int pivotIndex(vector& nums) { int rSum = accumulate(nums.begin(), nums.end(), 0); int lSum = 0; for (int idx = 0; idx < nums.size(); idx++) { rSum = rSum - nums[idx]; if (lSum == rSum) return idx; lSum = lSum + nums[idx]; } return -1; } };

[@sushantchoudhary444]

Easy approach for the 1st question pair p = make_pair(-1,-1); for(int i=0;i=0;i--) { if(arr[i] == k) { p.second = i; break; } } return p;

[@rishabhsharma2046]

Bhaiya 1hr+ ke videos sw problem nahi h 😀😀❤️❤️❤️ Vaise bahut maja aa raha h ❤️

[@shivamgupta78101]

Bhaiya ab aap to "Bhaiya" se sir ho gye Congratulations... But jo bhi ho Amazing teaching methods Love you bhaiya....

[@shixxam_prasad2049]

Thank you, sir! This course is better than many paid courses

[@funlearning5989]

video completed.... consistency is power...lets see the magic

[@absarahmad8625]

bhaiya apki logic building strategy ekdam bawal h? Hats of u

[@santanujana2001]

sir kya vdo tha sir confidence agaya ab...... no matter how many thank yous i'll give you, this won't be enough. dil se dhanyebad sir itna achhe se complexity samjhane ke liye 🙌🙌🙌

[@shaurabhmishra6029]

I am actually enjoying a lot while following this DSA series.. the idea of giving homework and questions link in the description is very cool and time saving .....Thank you Bhaiya for your effort.

[@kunalpramanick1050]

class Solution { public: int peakIndexInMountainArray(vector& arr) { int s=0,e=arr.size(); int mid=s+(e-s)/2; while(sarr[mid+1] && arr[mid]>arr[mid-1]){ return mid; }else if(arr[mid]arr[mid+1]){ e=mid-1; } mid=s+(e-s)/2; } return mid; } }; peak of a mountain of an array can also done by this

[@krushimonpara1514]

Bhiya apke explanation to next level hai maja a gaya ak time me hi pata chl jata hai full question.me iske sath sath apke 450 question vale dsa sheet ke question bue topic vice solve karta hu

[@kiranbajetha8638]

After two or three days, I am now able to solve these questions on my own- with lesser lines of code and an optimised solution..

[@gammagyan9061]

batter than all coding gfg and ninjas

[@Ayush_.]

sach me bhaiya dill se thanks nikalta he aapka Course Hindi Medium walo ke liye bhi 1000%%% friendly he ❤️❤️ mene 1st day aapko Discord pe bola tha hindi friendly rakhna sir ,,, and you following that 😀 aapka nam hi hamari feelings bata deta he " always LOVE babbar" 😅❤️

[@souravsanyal1617]

wow i can picturise every single explanation of you . thank you for uploading this useful lecture

[@dbgaming7722]

40:51 class Solution { public: int pivotIndex(vector& nums) { int total = 0; for (int i = 0; i < nums.size(); i++) { total += nums[i]; } int ans = -1; int rightsum = total, leftsum = 0; for (int i = 0; i < nums.size(); i++) { rightsum -= nums[i]; if (rightsum == leftsum) { ans = i; break; } leftsum += nums[i]; } return ans; } };

[@AdityaSingh-nu8cv]

Marking my attendence it's day 5 and i'm super excited...

[@VaradAdavkar]

Best c++ dsa course

[@codeishard3182]

When I start watching I don't understand and feel bearing then I wait and finally got the whole thing clear..... That's why I watch the full video though it seems not clear to me. Because I know I must understand...It's Babbar bhai...

[@ShivamSharma-jm8cz]

you are the best bro... aapne bahut bahut bahut achcha course apne bana dia dia hai sabhi ke liye vo bhi free me aapke course kafi sare bade bade nami brands ke course ke takkar ka ya usse jada hi hai... love you bro

[@youtubepro5005]

Raat m 1:00 am ho rha bhaiya ! Mzaa aa rha lecture bahot hi bole toh bahut hi jyada mzedar hai ! Love uhh bhaiya❤ !!

[@anuragtiwari4182]

bhagwaan aapki saari khwahishein poori kare bhaiyaaa...god bless you

[@arvind3570]

happy teacher's day bhaiya ji ❤❤❤❤❤❤❤❤❤❤❤❤❤❤

[@abhishekgond7300]

Ye huee n raftaar 🤩🤩🤩....waah bhaiya 🤩....Thanks.a lot ❤️👍

[@silviusyt]

# find pivot in array class Solution { public: int pivotIndex(vector& nums) { int sum=0; for(int i=0; i

[@siri_study]

I rememeber not knowing what a vector is, and totally freaking out bcoz I couldn't solve one question also in the placements, but yesterday I solved an array question on my own in a test and I can't thank Babbar bhai enough for this playlist!!!!Thank you so much Babbar bhaiyya

[@shaaniscoding]

Pivot Question- Homework: class Solution { public: int pivotIndex(vector& nums) { int fsum=0; int lsum=0; int j=-1; int size=nums.size(); for(int i=0; i

[@shashwathbhaskar673]

Brute force for finding first and last occurance #include pair firstAndLastPosition(vector& arr, int n, int k) { // Write your code here pair < int, int >ans; int min=0,max=0; bool flag = false; for(int i = 0; i

[@deepakyadavYT]

watched till end. Thanks a lot man for the efforts you've put in this course!

[@hyderali1520]

bhaiya aap aur aapka lectures super sa uper hai ,youtube pa dhmaka macha rahe ho .standing salute tou banta hai apka liya

[@mdwaqar7401]

Quality at its Peak. Mountain of DSA Courses - Love Babbar Bhaiyya at the Peak. Thanks for another Great Lecture. 13 Videos completed.

[@harshitsaxena6075]

Kya Samjhaya h bhaiya..well done. Please ye series continue rakhna.

[@foccussed8872]

Most beautiful code explaination that i had ever seen.

[@parasjain120]

Bhaiya bahut maza aaya waiting for 2nd and 3rd video of binary search question ,We love you bhaiya ❤️❤️❤️❤️

[@rizwanali-is8nd]

Bhaiya apky parhnaiy ka Method boht hi acha ha or Content ki quality boht hi achii ha Love you bhai Babbar... Bhai apko boht sa Piyaar Pakistan sy ....💌💌

[@ashanhabib4195]

Even i am Bangladeshi, but in your country everyone says that no one can learn DSA without knowing hindi🇧🇩🇧🇩🇧🇩Love you vieya

[@pulipatijagruthi3016]

Everytime you say comment karke jaana, i feel like there are no words to tell you how blessed we are with your videos bhaiya😁

[@sarvpriya5534]

Total number of Occurances logic ((last-first)+1) will return 1 even when that number is not present in array.