GEEKS FOR GEEKS SOLUTIONS🫢

📢 Hey everyone! I wanted to give a quick heads-up to all the users who are enrolled in the Arcade Facilitator Program under my referral. 🎮🌟 I've sent an email to each of you, so please make sure to check your Inbox/Spam folder. You should have received an email from dhruvchaurasia2900@gmail.com. 📩 Take a moment to go through the email and the attachment—it has some valuable information that will be really helpful for this program. If you can't find the email, please double-check your Spam folder, as sometimes important emails can get filtered there. If you have any questions or need any assistance, feel free to reach out to me. I'm here to support you throughout this program. Let's get ready to level up together! 🚀🎉

13 July // c++

class Solution { public: bool isFrequencyUnique(int n, int a[]) { unordered_map primer; unordered_set sieve; // First store all the elements in a map and their respective frequency for(int i=0; i0) { return false; } sieve.insert(x.second); } return true; } };

🎉🏅🔥 Complete skill badges, earn Google Cloud swag! 🌟🔑 🚀🌈 Follow up this Pdf to earn skill badge (All Links are Clickable for easy access) Skill Badge Link: https://www.cloudskillsboost.google/quests/118?catalog_rank=%7B%22rank%22%3A17%2C%22num_filters%22%3A1%2C%22has_search%22%3Afalse%7D Solutions Link: (All Links are Clickable for easy access) https://studio.youtube.com/playlist/PLT1dp6NrZQN9MTjHxCztsTasVI0V4V623/videos

12 th july || c++

int findK(int arr[MAX][MAX],int n,int m,int k) { int left = 0,right = m-1; int up = 0,down = n-1; while(k) { for(int i=left;i<=right;i++) { k--; if(k==0) { return arr[up][i]; } } up++; for(int j=up;j<=down;j++) { k--; if(k==0) { return arr[j][right]; } } right--; for(int i=right;i>=left;i--) { k--; if(k==0) { return arr[down][i]; } } down--; for(int j=down;j>=up;j--) { k--; if(k==0) { return arr[j][left]; } } left++; } return 0; }

🎉🏅🔥 Complete skill badges, earn Google Cloud swag! 🌟🔑 🎓🔓 Show off your skills, unlock exclusive rewards! 👕💻💪 🚀🌈 Follow up this Pdf to earn skill badge (All Links are Clickable for easy access) 🌐📚💡 #SkillBadges #GoogleCloud #Swag

11 july || c++

class Solution { public: /You are required to complete this method/ int findK(int a[MAX][MAX],int n,int m,int k) { // Your code goes here. vector<int>ans; int l=0,r=m-1; int t=0,d=n-1; while(l<=r&&t<=d){ for(int j=l;j<=r;j++){ ans.push_back(a[t][j]); } t++; for(int i=t;i<=d;i++){ ans.push_back(a[i][r]); } r--; for(int j=r;j>=l;j--){ ans.push_back(a[d][j]); } d--; for(int i=d;i>=t;i--){ ans.push_back(a[i][l]); } l++; } return ans[k-1]; } };

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

10 th july || c++

class Solution { public: //Function to find transpose of a matrix. void transpose(vector >& matrix, int n) { // code here for(int i=0;i=i) { swap(matrix[i][j],matrix[j][i]); } } } } };

if(j>=i) { swap(matrix[i][j],matrix[j][i]); }

9th july || c++

class Solution { public: //Function to find the smallest positive number missing from the array. int missingNumber(int arr[], int n) { for(int i=0;i0 && arr[i]

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

8 th july || c++

class Solution{ public: //Function to find triplets with zero sum. bool findTriplets(int arr[], int n) { //Your code here sort(arr,arr+n); for(int i=0;i0){ k--; } else{ return 1; } } } return 0; } };