help.. mre m mongoose connected hi n aa rha h server is running tk aa rha h uske baad error aa rha h

bhaiya college aapne sql shikne ko kha toh phir usse join krne ke liye konsa course karu??

C++

class Solution { //Function to sort an array according to the other array. sortA1ByA2(A1, N, A2, M){ // code here let map = new Map() for(let i=0;i<N;i++){ if(!map.get(A1[i])){ map.set(A1[i],1) }else{ map.set(A1[i],map.get(A1[i])+1) } } // console.log(map) let res = [] for(let x of A2){ if(!map.get(x)){ continue; }else if(map.get(x) == 1){ let index = A1.indexOf(x) A1.splice(index,1) res.push(x) }else if(map.get(x) > 1){ A1= A1.filter(item=>item !=x) res.push(x,x) } } return [...res,...A1.sort((a,b)=>a-b)] } } solved by my own ab me sukun se ye tutorial dekh sakta hu😅😅

install ho gaya

prince bhyia ki jai ho

I really love it. Your teaching style is very simple and easy to understand. I saw different video related to Golang but your videos are best and amazing ❤❤

void buildHeap() { int n = heap.size(); for (int i = n / 2 - 1; i >= 0; --i) { minHeapify(i); } }

void deleteKey(int index) { if (index >= heap.size()) { throw out_of_range("Index is out of bounds"); } // Decrease the value to negative infinity and extract the min decreaseKey(index, INT_MIN); extractMin(); }

Very useful video sir for freshers,Thank You!

int extractMin() { if (heap.size() == 0) return INT_MAX; // heap is empty if (heap.size() == 1) { int minVal = heap[0]; heap.pop_back(); return minVal; } // Store the MIn value and remove it int root = heap[0]; heap[0] = heap.back(); heap.pop_back(); minHeapify(0); return root; } // get the Min element without removing it int getMin() { if (heap.size() == 0) throw out_of_range("Heap is empty"); return heap[0]; }

#reallearning 🔥🔥

Thankyou JI Bless❤ me and ❤ALL

first we apply authentication after authorization happed

Instead of so many base cases we can simply initialise the 2D array like this and then replace the base cases with the fist line that you've written: double [,] dp = new double [n+1, sum+1]; dp[0,0] = 1; for (int j=1; j<=sum; j++) dp[0, j] = 0; for (int i=1; i<=n; i++) for (int j=0; j<=sum; j++) dp[i, j] = -1;

Authentication implemented first

aapki videos bohot helpful hai. thank you sir

Exam kayse liya jayga? Online?

date kya h exm ki

wonderfully explained . best playlist to learn nodejs

Thankyou brother i am very excited for this course ❤

best video, very useful and easy to understand 👍

I am a working professional I work in node js projects but my concepts are not clear I hope you videos help full for me

Thankyou brother ❤

Lol! First of all i did BCA/MCA Job market has going down no Job in campus or out campus. Mostly IT professional are jobless due to recession including me having skills has no possiblity to get a job of 2 LPA as well.

excellent. very true

Thank you bhaiya

You didn't even explain that to import a function in a different file and use it, you have to export it from the actual file and to do that you have to name it will Caps

Bhai isse acha tum two routes bana ker code likh kar samjha sete😂😂....

nice explaination

it's great lecture and i am very excited to learn GoLang

Enjoying Recursion & DP series 😇

Its motivate me,i will try to complete this course

Ur coding is not clean

Prince Bhaiya Time ho to MongoDB pe video bna lena sir. yo bhi stong ho jayega. Aapka concept bahut logical hai.

Really Prince Bhaiya maza aa Gya thank you so much for that level project you provided, wo bhi free. Your guidance would be phenomenal in my full-stack journey.

2022 passout student and fresher, can I apply

great vid

how to get questions pdf someone ?

bhaiya youre so so good at teaching ; I am regretting now why didnt i found you earlier !!

Nice question ❤

This video really loaded with correct and pure information, no bakwaas🫡

Hello.go:5:2: package myutil is not in std not done

You are like a gem 💎 for us...❤

Thank you brother!

Done😀😀

Bhaiya is best in code teaching and even more excellent in sales

Omg you seriously did it for free ; you're great bhaiya !!!!

first time getting to understand dp this well

Nice