๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K 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
#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>

using namespace std;

vector<vector<string>> solve(vector<string>& strs) {
    unordered_map<string, vector<string>> mp;
    for (string s : strs) {
        string t = s;
        sort(t.begin(), t.end());
        mp[t].push_back(s);
    }
    vector<vector<string>> anagrams;
    for (auto p : mp) {
        anagrams.push_back(p.second);
    }
    return anagrams;
}

int main() {
    int n;
    cin >> n;
    vector<string> strs(n);
    for (int i = 0; i < n; i++) {
        cin >> strs[i];
    }
    vector<vector<string>> ans = solve(strs);
    int maxi= 0;
    for (auto g : ans) {
        maxi = max(maxi, (int)g.size());
    }
    for (auto g : ans) {
        if (g.size() == maxi) {
            for (string s : g) {
                cout << s << " ";
            }
            cout << endl;
        }
    }
    return 0;
}

Anagram
Salesforce โœ…
๐Ÿ‘Ž3๐Ÿ‘2
int calc(long long n) {
long long t = sqrt(n * 2);
while(t * (t + 1) / 2 > n) t--;
while((t + 1) * (t + 2) / 2 <= n) t++;
return t;
};

void getMaxHeight() {
long long n, m; cin >> n >> m;
int turn = 0;
int ans = 0;
int res = 0;
res = max(calc(n), calc(m));
for(int i = 1; i <= 1000000000; i++) {
  if(!turn) {
   if(n < i) {
    break;
   } else {
    n -= i;
    ans++;
    res = max(res, ans + calc(m));
   }
  } else {
   if(m < i) {
    break;
   } else {
    m -= i;
    ans++;
    res = max(res, ans + calc(n));
   }
  }
  turn ^= 1;
}

cout << max(ans, res);
}

Trailhead โœ…
Salesforce
๐Ÿ‘1
const int N = 2000 + 10;
int cnt[N][N], dp[N][N];
float highest_density(vector<vector<int>> points) {
vector<int> c;
for(auto x : points) {
  c.push_back(x[0]);
  c.push_back(x[1]);
}
sort(c.begin(), c.end());
c.resize(unique(c.begin(), c.end()) - c.begin());
for(auto &p : points) {
  for(auto &x : p) {
   x = lower_bound(c.begin(), c.end(), x) - c.begin() + 1;
  }
  cnt[p[0]][p[1]]++;
}

for(int i = 1; i <= 2000; i++) {
  for(int j = 1; j <= 2000; j++) {
   dp[i][j] = cnt[i][j] + dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1];
  }
}

float ans = -1.0;
for(int i = 0; i < points.size(); i++) {
  for(int j = i + 1; j < points.size(); j++) {
   int x = points[i][0], y = points[i][1];
   int u = points[j][0], v = points[j][1];
   if(x > u) swap(x, u);
   if(y > v) swap(y, v);
   if(x == u || y == v) continue;
   if(!cnt[x][y] !cnt[u][v] !cnt[x][v] || !cnt[u][y]) continue;
   float S = (c[u - 1] - c[x - 1]);
   float T = (c[v - 1] - c[y - 1]);
   x++; u--; y++; v--;
   ans = max(ans, (float)0);
   if(x > u || y > v) continue;
   float pp = dp[u][v] - dp[x - 1][v] - dp[u][y - 1] + dp[x - 1][y - 1];
   pp = pp / S;
   pp = pp / T;
   ans = max(ans, pp);
  }
}

return ans;
}

Rectangle
Salesforce โœ…
๐Ÿ‘2
Do you enjoy reading this channel?

Perhaps you have thought about placing ads on it?

To do this, follow three simple steps:

1) Sign up: https://telega.io/c/cs_algo
2) Top up the balance in a convenient way
3) Create an advertising post

If the topic of your post fits our channel, we will publish it with pleasure.
Changepond recruiting Fresher_Software Developers and Testers_Registration Link given Below
Skills Required: JAVA / Net / Testing/ RPA / SQL/ PHP with Logical and analytical thinking towards programming.
Eligibility:
B.E. / B.Tech/ME/Mtech CSE / IT / ECE / EEE
B.Sc (Computer Science).BCA
MCA,MSC ( Computer Science )
Graduated in 2022 or 2023 Only with 70% and above in all academics
Good Communication
Job Location: SIPCOT, Siruseri, Chennai

Apply link : https://forms.office.com/Pages/ResponsePage.aspx?id=xXv5k9nOHE6DUIaS7Za9oqyRiK_P05VPnXJDDjk1bk1UMjRWVEtJM01LRERZUkNQVVJEWVhHUjlZWi4u
FresherOpportunityAlert

Macro Technology Solutions Hiring Freshers || .Net Trainee Developer for Trichy.

We are looking for candidates with a UG/PG Computer Science background (i.e., 2022/2023/2024) who have strong practical and theoretical knowledge in C/C++, OOPs, SQL, and RDBMS. The candidate should be based out of Trichy and available for immediate joining.

Title: .Net Trainee Developer
Location: Trichy
Duration: Full Time

Terms & Conditions:

The candidate should be from any UG/PG Computer science background (i.e., 2022/2023/2024 passed out).
The candidate should be based out of Trichy (i.e., home location).
The candidate should have consistently scored more than 75% in 10th, 12th, and graduation/post-graduation courses.
We are looking for immediate joiners only.

Interested can mail to hireme@macroglobal.co.uk
Freshers/Interns for the HR Internship for our organization.

Job Responsibilities-

โ€ขSourcing candidates through various channels, including job portals, social media platforms, and professional networks.
โ€ขScreen resumes and conduct initial interviews to assess candidate qualifications and suitability for open positions.
โ€ขCoordinate and schedule interviews between candidates and hiring managers, ensuring a seamless and efficient recruitment process.
โ€ขContribute to new employee orientation and paperwork.
โ€ขDrafting job descriptions and posting job openings on relevant platforms to
attract qualified candidates.
โ€ขCollaborate with team members on special projects and initiatives to enhance our recruitment strategies and processes.

Location: Gurugram, Haryana
No. of working days: 5 days

*Immediate joiners and candidates from Delhi NCR region or nearby areas preferred

If you find the above mentioned profile suitable or have any references for the same, kindly share the updated resumes at dhanashree.surve@cybercube.co.in

Regards,
Dhanashree Surve
HR Executive
CyberCube Services Pvt. Ltd.