GEEKS FOR GEEKS SOLUTIONS🫢
Open in Telegram
1 342
Subscribers
No data24 hours
-27 days
-2930 days
Posts Archive
*Do you want to get a Gen AI certificate on your CV? 🔴 Final Chance! 🔴*
*Today is the Last AI workshop of the month!* Join Rajat Dhariwal, Ex-Amazon, Senior Vice President Curriculum at Masai, for an epic AI & Tech Jobs FREE Masterclass.
*Be Among the First*: Gain insider knowledge from industry experts, providing you with a competitive advantage for jobs/internships/projects
*REGISTRATION LINK* - https://prlf.link/Naj9
*Discover:*
*✨ Exclusive Offer: Free Certification for Attendees!*
🚀 Career Growth: Uncover Opportunities in the GenAI Domain
🔧 How to Harness GenAI: Shape Your Tech Career
Bonus: Learn How AI Can Kickstart or Boost Your Tech Career!
*REGISTRATION LINK* - https://prlf.link/Naj9
We have Webinar conducted today by IIT Kanpur alumnus & IIT Hyderabad alumnus Here is link to Join https://prlf.link/H6WS
Hello Guys If you want to be part of my college GDSC (me as GDSC lead) do attend our orientation to get updates about all events we will organise this year.
here is link to RSVP
https://gdsc.community.dev/events/details/developer-student-clubs-j-c-bose-university-of-science-and-technology-faridabad-presents-gdsc-jcbust-orientation-session-2023/
class Solution{
public:
//Complete this function
void solve(string s, int index,vector&ans){
if( index >= s.size()){
ans.push_back(s);
return;
}
for(int i = index; i permutation(string S)
{
//Your code here
vectorans;
solve(S,0,ans);
sort(ans.begin(),ans.end());
return ans;
}
};
class Solution {
public:
long long findMinDiff(vector a, long long n, long long m) {
sort(a.begin(), a.end());
long long x = LLONG_MAX; // Initialize 'x' to a large value
for (long long i = m - 1; i < n; i++) {
x = min(a[i] - a[i - m + 1], x); // Calculate difference between the current element and the (m-1)th element before it
}
return x;
}
};
