GEEKS FOR GEEKS SOLUTIONS🫢

⚡️Get 100% Free Scholarship ⚡️ Get Premium Courses Worth Lakhs For Free 📂 Get Free Bags🎒 / T-shirts 👕 Free Certification 📃 Eligibility: Anyone Can Join ✅ Fees: ZERO 😍 Last Date: 12th July 📥 Try your Luck Guys 👀 ✅ Register Now: https://www.codingninjas.com/studio/contests/scholarship-test-11th-to-12th-july-2023?utm_source=Growth-CS&utm_medium=RJ&utm_campaign=TechVineChannel_Hardik_12July A cash Giveaway will be organised for all those who register

Fill the enrollment form if you haven't filled yet For referral code, please use Referral code: AF23-C02-DQ4 Form link: 🔗 https://docs.google.com/forms/d/e/1FAIpQLSd_50_XP6hRmZgIf88wTxgytOm2zkeH9iVPFAOIsAW6ENwMOA/viewform

7 th july || c++

class Solution{ public: //Function to merge the arrays. void merge(long long arr1[], long long arr2[], int n, int m) { // code here int i=0,j=0; for(int i=0;iarr2[i]){ long long temp = arr2[i]; arr2[i]=arr1[n-i-1]; arr1[n-i-1]=temp; } } sort(arr1,arr1+n); sort(arr2,arr2+m); } };

Hello Everyone! 👋🎮 The registration forms are out! 📝🚀 Fill it now to register for the Arcaade Facilitator Program Phase 2. For referral code, please use Referral code: AF23-C02-DQ4. 🔑 Form link: 🔗 https://docs.google.com/forms/d/e/1FAIpQLSd_50_XP6hRmZgIf88wTxgytOm2zkeH9iVPFAOIsAW6ENwMOA/viewform Get ready for an amazing arcade experience! 😃🕹

Hello Everyone! 👋🎮 The registration forms are out! 📝🚀 Fill it now to register for the Arcaade Facilitator Program Phase 2. For referral code, please use Referral code: AF23-C02-DQ4. 🔑 Form link: 🔗 https://docs.google.com/forms/d/e/1FAIpQLSd_50_XP6hRmZgIf88wTxgytOm2zkeH9iVPFAOIsAW6ENwMOA/viewform Get ready for an amazing arcade experience! 😃🕹

4 th july || c++

int countSubArrayProductLessThanK(const vector& a, int n, long long k) { long long prod = 1; int i=0,j=0,count=0; while(i=k){ prod /= a[i++]; } count += (j-i); } return max(0,count); }

3 rd july || c++

class Solution{ public: int maxIndexDiff(int arr[], int n) { stack<int> stk; for(int i=n-1; i>=0; i--){ if(stk.empty()) stk.push(i); else if(arr[i]>arr[stk.top()]) stk.push(i); } int ans=0; for(int i=0; i<n; i++){ while(!stk.empty() && arr[i] <= arr[stk.top()]){ ans = max(ans, stk.top()-i); stk.pop(); } } return ans; } };

2 July || c++

class Solution{ public: int setSetBit(int x, int y, int l, int r){ if(l==32) l=31; if(r==32) r=31; int lbm = l>1? y&(~(1<<(l-1))+1):y; int rbm = r>1? y&((1<

30 june || c++

class Solution{ public: int isDivisible(string s){ int n=s.length(); int st=-1; for(int i=0;i

29 th june || c++

bool solve(int input){ if(input==1 || input==7){ return true; } if(input<10){ return false; } int x,temp=0; while(input!=0){ x=input%10; input=input/10; temp+=x*x; } input=temp; solve(input); } int nextHappy(int N){ int x=0; int input=N+1; while(x==0){ solve(input); if(solve(input)==true){ return input; } else{ input+=1; } } return -1; }

28 th june || c++