Пікірлер

• 
  @VaibhavSingh-gd4ui36 минут бұрын

  thanks bhaiya

• 
  @vishalgupta7522Сағат бұрын

  thanks for the video

• 
  @AniketSingh-gm9nhСағат бұрын

  I had watched all the time complexity videos but did'nt able to understand, then here i found a gem named babbar sher. So much love for u man. Just keep educating us, you'r an inspiration for us.❤❤‍🩹❤❤❤

• 
  @saikatmandal4099Сағат бұрын

  completed this lectures ,

• 
  @krato87312 сағат бұрын

  bhot mza aa rha h

• 
  @srsahoo.official2 сағат бұрын

  Started 16/07/2024

• 
  @sastaplayer36332 сағат бұрын

  Can anyone tell me what bool h

• 
  @know13743 сағат бұрын

  done on 17 July 2159

• 
  @VickyDhangar-ff7yd3 сағат бұрын

  ❤

• 
  @adityajain38753 сағат бұрын

  Thank you bhayia ji,lots of love

• 
  @user-of1eg7oy4u3 сағат бұрын

  1:04:45

• 
  @harithpatnam56264 сағат бұрын

  Thankyou sir we loved it!!!

• 
  @Oyevijay_4 сағат бұрын

  Started 15/07/24

• 
  @MRCRAZY-wm4ln4 сағат бұрын

  The best teacher , the best guide Thanks a lot sir !!!

• 
  @KhushiKavya-py1yj5 сағат бұрын

  easy-peasy

• 
  @KhushiKavya-py1yj5 сағат бұрын

  4th vdo for today .. trying to complete this series 48 vdos left in 9 days as after that placement is starting

• 
  @user-yo1pw2gu2j5 сағат бұрын

  sir eska code kaha hai jo link hai usma bass tree tk ka hi code haii graph aur bakki lecture ka code ka link kaha hai

• 
  @shyamnandkumar53775 сағат бұрын

  swad aa gya bhai :)

• 
  @vikramkumarsoni52835 сағат бұрын

  int arr[100]; int size; cout << "enter the size of array" << endl; cin>>size; cout << "enter the values in array" << " "; for(int i=0;i<size;i++) { cin>>arr[i]; } for(int i=0;i<size;i++) { int temp; if(i%2==0 && i+1<size) temp=arr[i+1]; arr[i+1]=arr[i]; arr[i]=temp; } for(int i=0;i<size;i++) { cout <<"after swapping :"<<arr[i]<<endl; } return 0; } I/p:12345 O/p:22444 what's wrong in this program?

• 
  @Arnavsingh63955 сағат бұрын

  2343 comments ho gaye 🤝 🥳

• 
  @Arnavsingh63955 сағат бұрын

  🙏🏻

• 
  @scientistakasha72936 сағат бұрын

  10:49:06 Understood++ Completed whole CSS Alhumdulillah.Thank you sooo much a brother like instructor you are the BEST on whole YoutTube I have learnt alot in this video ♥

• 
  @Suraj.52606 сағат бұрын

  Great podcast thank u

• 
  @voidmain22557 сағат бұрын

  sir es lecture ke handwritten notes kaha milenge ?

• 
  @madhukrishnanipankar5637 сағат бұрын

  Started Today: 16th July 2024 🎉

• 
  @Faster_Flutter_Master7 сағат бұрын

  Master Blaster sir Maza agya

• 
  @AbhishekSingh-it7sq8 сағат бұрын

  sie maja aa gaya one video me sab hai

• 
  @aryangupta9048 сағат бұрын

  approach 2 leetcode pr TLE maar rhi

• 
  @honestad35588 сағат бұрын

  fantastric series i still have to do more question but it was fantastic

• 
  @DIAJAINNNSUT9 сағат бұрын

  1:08:09 he mentions output questions on the screen, but they don't appear, right?

• 
  @Rahul-zg7zz9 сағат бұрын

  Not Working For S = 10, N = 9, M = 8. Great Video

• 
  @crackupsc14039 сағат бұрын

  ❤❤❤

• 
  @Kartikey_rai9 сағат бұрын

  a=[1,3,4,5,34,54,345,45,86] n=0 for i in range(len(a)): if a[i]>n: n=a[i] else: pass print(n) for finding max value we can use max function but this just for logic building purpose

• 
  @rishabhmittal75889 сағат бұрын

  start: 6:14PM 7/16/2024

• 
  @gorityalasanthosh98409 сағат бұрын

  Thank you bhaiya

• 
  @Statusu-ok3jx9 сағат бұрын

  you are good as rajbhoj for me

• 
  @abhayvarshney299310 сағат бұрын

  Solution: void dfs(int node, unordered_map<int, bool> &visited, unordered_map<int, set<int>> &adj, vector<int> &component) { component.push_back(node); visited[node] = 1; for (auto i : adj[node]) { if (!visited[i]) { dfs(i, visited, adj, component); } } } vector<vector<int>> depthFirstSearch(int V, int E, vector<vector<int>> &edges) { unordered_map<int, set<int>> adj; for (int i = 0; i < edges.size(); i++) { int u = edges[i][0]; int v = edges[i][1]; adj[u].insert(v); adj[v].insert(u); } vector<vector<int>> ans; unordered_map<int, bool> visited; for (int i = 0; i < V; i++) { if (!visited[i]) { vector<int> component; dfs(i, visited, adj, component); ans.push_back(component); } } return ans; }

• 
  @gorityalasanthosh984010 сағат бұрын

  Maaza agaya bhaiyya

• 
  @hukamsaini326310 сағат бұрын

  Thank you ❤ se

• 
  @tradewithmukul283411 сағат бұрын

  Thanks for the course it was great learning , thank you from the bottom of the heart

• 
  @eu-dinoplay525611 сағат бұрын

  Handwritten wala link Kam Nehi kar rah fix kardo usko

• 
  @royalstarap353911 сағат бұрын

  47:00

• 
  @Sohamyoooo11 сағат бұрын

  25:27 HW CODE char ch; cout<<"enter the character to be characterized:"; cin>> ch; if(ch>='A'&&ch<='Z' ){ cout<<"the upper case value is"<< ch<<endl; } else if(ch>='a'&& ch<='z'){ cout<<"lower case"; } else if (ch>= '0'&& ch<='9'){ cout<<"numerical value"; } else{ cout<<"try again"; }

• 
  @vivekkumar-ke6zj11 сағат бұрын

  lovely

• 
  @HARSH-rg9xv11 сағат бұрын

  15:35

• 
  @samyakjain342211 сағат бұрын

  understood++

• 
  @ayush.tiwarios210511 сағат бұрын

  00:01 Introduction to functions and their importance in code efficiency 02:11 Function in JavaScript performs a specific task 05:19 Functions are essential for code readability and reusability. 07:07 Defining and using functions in JavaScript 10:58 Understanding Function Parameters and Arguments in JavaScript 12:57 Explanation of return functions in JavaScript 16:51 Understanding the importance of calling a function in JavaScript 18:44 Explanation of working of a function in JavaScript 22:03 Explaining function declaration and expression in JavaScript 23:37 Usage of arrow functions for returning values in JavaScript 26:55 Introduction to Arrow Functions in ES6 28:52 Understanding arrow function definition in JavaScript

• 
  @omprakashsao454012 сағат бұрын

  .rightBox per hover kerne se transform property only .overlay per apply ho rhi h, image per nhi ..plz reply kya kru mai🙏🙏🤔🙄🙄😮‍💨

• 
  @aviii24x713 сағат бұрын

  I am missing that, which part of code is handling that, we could not reach to (n-1, n-1), how will it return then ???