๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.61K 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
#include<vector>
#include<algorithm>
class IsoscelesTriangles {
public:
   long long getAnswer(int n, int m, std::vector<std::vector<int>> M){
   std::vector<std::vector<int>> dp(n, std::vector<int>(m, 0));
    long long ans = 0;
   
    for(int j = 0; j < m; j++) dp[n-1][j] = (M[n-1][j] == 0);
   for(int i = n-2; i >= 0; i--){
    for(int j = 0; j < m; j++){
    if(M[i][j] == 1) continue;
      if(j == 0 || j == m-1){
      dp[i][j] = 1;
     continue;
    }
     
      dp[i][j] = 1 + std::min(dp[i+1][j-1], std::min(dp[i+1][j], dp[i+1][j+1]));
      ans += dp[i][j]-1;
   }
  }
    return ans;
}
long getNumberOfTriangles(int n, int m, std::vector<std::vector<int>> M) {
  // Code here
   long long ans = getAnswer(n, m, M);
    for(int i = 0; i < n/2; i++) std::swap(M[i], M[n-i-1]);
    ans += getAnswer(n, m, M);
    return ans;
}
};

Google โœ…
Triangle (C++)
๐—œ๐—ป๐—บ๐—ผ๐—ฏ๐—ถ ๐—ต๐—ถ๐—ฟ๐—ถ๐—ป๐—ด ๐—ฆ๐——๐—˜-๐Ÿญ(๐—œ๐—ข๐—ฆ), ๐—ฆ๐——๐—˜-๐Ÿฎ, ๐—ฆ๐——๐—˜-๐Ÿฏ ๐Ÿ˜ƒ ๐Ÿ”ฅ

๐—œ ๐—ฎ๐—บ ๐—ฝ๐—ฟ๐—ผ๐˜ƒ๐—ถ๐—ฑ๐—ถ๐—ป๐—ด ๐—ฟ๐—ฒ๐—ณ๐—ฒ๐—ฟ๐—ฟ๐—ฎ๐—น๐˜€ ๐—ณ๐—ผ๐—ฟ ๐˜๐—ต๐—ฎ๐˜ ๐—ฟ๐—ผ๐—น๐—ฒ.

๐—ฃ๐—น๐—ฒ๐—ฎ๐˜€๐—ฒ ๐—ณ๐—ถ๐—น๐—น ๐—ผ๐˜‚๐˜ ๐˜๐—ต๐—ฒ ๐—ด๐—ผ๐—ผ๐—ด๐—น๐—ฒ ๐—ณ๐—ผ๐—ฟ๐—บ ๐—ด๐—ถ๐˜ƒ๐—ฒ๐—ป ๐—ฏ๐—ฒ๐—น๐—ผ๐˜„. ๐Ÿ‘‡ (๐—™๐—ถ๐—น๐—น ๐—ผ๐˜‚๐˜ ๐˜๐—ต๐—ฒ ๐—ณ๐—ผ๐—ฟ๐—บ ๐—ฟ๐—ฒ๐—น๐—ฒ๐˜ƒ๐—ฎ๐—ป๐˜ ๐˜๐—ผ ๐˜†๐—ผ๐˜‚๐—ฟ ๐—ฒ๐˜…๐—ฝ๐—ฒ๐—ฟ๐—ถ๐—ฒ๐—ป๐—ฐ๐—ฒ)

1๏ธโƒฃ ๐—ฆ๐——๐—˜-๐Ÿญ(๐—œ๐—ข๐—ฆ)- https://lnkd.in/dSK8Jhub

2๏ธโƒฃ ๐—ฆ๐——๐—˜-๐Ÿฎ- https://lnkd.in/dVCHrFvP

3๏ธโƒฃ ๐—ฆ๐——๐—˜-๐Ÿฏ- https://lnkd.in/dhJHaHqk
#include <bits/stdc++.h>
using namespace std;
bool prime(int num)
{
    if (num <= 1)
        return false;

    for (int i = 2; i * i <= num; ++i)
    {
        if (num % i == 0)
            return false;
    }

    return true;
}
int main()
{
    int l, r;
    cin >> l >> r;
    int ans = 0;
    for (int i = l; i <= r; i++)
    {
        if (prime(abs(i)))
        {
            ans += i;
        }
    }

    cout << ans;
    return 0;
}

TechM Campus 2024

SumPrime
Python โœ…
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
    sort(arr, arr + n);
    cout << arr[n - 2] + arr[n - 1];

    return 0;
}

Tech Mahindra โœ…
#include <bits/stdc++.h>
using namespace std;

int main()
{
    string s;
    cin >> s;
    int ans = 0;
    map<char, int> m;
    for (int i = 0; i < s.size(); i++)
    {
        m[s[i]]++;
    }
    for (auto x : m)
    {
        if (x.second == 1)
            ans++;
    }
    cout << ans;
    return 0;
}

Tech Mahindra
C++โœ…
#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s;
    cin >> s;
    int n;
    cin >> n;
    for (int i = n; i < s.size() + n; i++)
    {
        cout << s[i % s.size()];
    }
    return 0;
}
C++โœ