๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.62K subscribers
5.59K photos
3 videos
95 files
10.2K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
SELECT
   DATE_FORMAT(date_field, '%Y-%m') AS month_year,
   'Jobs' AS source,
   COUNT(*) AS total_number
FROM
   jobs
GROUP BY
   month_year
UNION ALL
SELECT
   DATE_FORMAT(date_field, '%Y-%m') AS month_year,
   'Freelancers' AS source,
   COUNT(*) AS total_number
FROM
   freelancers
GROUP BY
   month_year
ORDER BY
   month_year ASC,
   source ASC;

Freelancer โœ…
#include <vector>

using namespace std;

long long minimumSplits(vector<int> arr) {
    long long totalSplits = 0;
    long long prevVal = arr.back();

    for (int idx = arr.size() - 2; idx >= 0; idx--) {
        totalSplits += (arr[idx] - 1) / prevVal;
        long long numGroups = ((arr[idx] - 1) / prevVal + 1);
        prevVal = arr[idx] / numGroups;
    }

    return totalSplits;
}

Break Sort
PayPal โœ…
#include<bits/stdc++.h>
using namespace std;
string getLargestNumber(string num)
{
string ans ="",s="";
for(int i=0;i<(int)num.size()-1;i++)
{
  if((num[i]-'0')%2==(num[i+1]-'0')%2)
  s+=num[i];
  else
  {
   s+=num[i];
   sort(s.rbegin(),s.rend());
   ans+=s;
   s="";
  }
}
s+=num[(int)num.size()-1];
sort(s.rbegin(),s.rend());
   ans+=s;
return ans;

}
int main(){
string s;
cin>>s;
cout<<getLargestNumber(s);

}

Swap Parity โœ…

vector<int> solution(vector<int> target){
    vector<int> res;

    res.push_back(target[0]);

    for(int i=1;i<target.size()-1;++i){
        if(target[i]>target[i-1] && target[i]>target[i+1]){
            res.push_back(target[i]);
        }
    }
    res.push_back(target[target.size()-1]);
    return res;
}