#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++)

x =n//m
y = n%m
print(y)
summ = b*x

summ=summ+ y*a
print(summ)

Accenture ✅

Anyone have today Tech Mahindra Exam guys

Accenture
Python 3✅

𝗜𝗻𝗺𝗼𝗯𝗶 𝗵𝗶𝗿𝗶𝗻𝗴 𝗦𝗗𝗘-𝟭(𝗜𝗢𝗦), 𝗦𝗗𝗘-𝟮, 𝗦𝗗𝗘-𝟯 😃 🔥

𝗜 𝗮𝗺 𝗽𝗿𝗼𝘃𝗶𝗱𝗶𝗻𝗴 𝗿𝗲𝗳𝗲𝗿𝗿𝗮𝗹𝘀 𝗳𝗼𝗿 𝘁𝗵𝗮𝘁 𝗿𝗼𝗹𝗲.

𝗣𝗹𝗲𝗮𝘀𝗲 𝗳𝗶𝗹𝗹 𝗼𝘂𝘁 𝘁𝗵𝗲 𝗴𝗼𝗼𝗴𝗹𝗲 𝗳𝗼𝗿𝗺 𝗴𝗶𝘃𝗲𝗻 𝗯𝗲𝗹𝗼𝘄. 👇 (𝗙𝗶𝗹𝗹 𝗼𝘂𝘁 𝘁𝗵𝗲 𝗳𝗼𝗿𝗺 𝗿𝗲𝗹𝗲𝘃𝗮𝗻𝘁 𝘁𝗼 𝘆𝗼𝘂𝗿 𝗲𝘅𝗽𝗲𝗿𝗶𝗲𝗻𝗰𝗲)

1️⃣ 𝗦𝗗𝗘-𝟭(𝗜𝗢𝗦)- https://lnkd.in/dSK8Jhub

2️⃣ 𝗦𝗗𝗘-𝟮- https://lnkd.in/dVCHrFvP

3️⃣ 𝗦𝗗𝗘-𝟯- https://lnkd.in/dhJHaHqk

CBRE Hiring IT Intern

Batch: 2024/2025

Apply link :
https://careers.cbre.com/en_US/careers/JobDetail/D-T-Intern/128783

Shopse Hiring !!

Role - SDE 1

Apply link :
https://getshopse.keka.com/careers/jobdetails/15345

Accenture ✅

Finastra is hiring QA Interns

For 2023/2024/2025 Grads

https://careers.finastra.com/jobs/8244

Fampay hiring Product Operations Intern

Batch : 2024 / 2025

Apply : https://www.linkedin.com/jobs/view/3638858493

Company Name: CRED

Role: Frontend Developer

Batch eligible: 2022 and early grads. (Require 1 year of experience)

Apply: https://www.linkedin.com/jobs/view/3671863056

P.S: If you have 1 year of experience and you are looking for a switch, just go for it.

Siemens is hiring Data Analyst/ Data Engineer!
Qualifications: Bachelor’s/ Master’s Degree
Salary: 7 - 11 LPA (Expected)
Experience: Freshers & Experienced
Location: Bangalore/ Remote

📌Apply Link: https://jobs.siemens.com/careers/job/563156115688264

https://jobs.siemens.com/careers/job/563156115565135

#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++✅

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int[][] arr = new int[N][N];

        scanner.nextLine();
        for (int i = 0; i < N; i++) {
            String[] line = scanner.nextLine().split("#");
            for (int j = 0; j < N; j++) {
                arr[i][j] = Integer.parseInt(line[j]);
            }
        }

        int maxMin = -1;
        List<String> positions = new ArrayList<>();

        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                int minVal = arr[i][j];
                for (int x = Math.max(i - 1, 0); x <= Math.min(i + 1, N - 1); x++) {
                    for (int y = Math.max(j - 1, 0); y <= Math.min(j + 1, N - 1); y++) {
                        minVal = Math.min(minVal, arr[x][y]);
                    }
                }
                if (minVal > maxMin) {
                    maxMin = minVal;
                    positions.clear();
                    positions.add((i + 1) + "#" + (j + 1));
                } else if (minVal == maxMin) {
                    positions.add((i + 1) + "#" + (j + 1));
                }
            }
        }

        for(String position : positions) {
            System.out.println(position);
        }
    }
}

Game Centre
Java ✅