Urgently Required For Linux Administration, Trainee
Role- Trainee/Intern
Qualification-  BCA/BSC/BCCA/BE/MCA/MS
Experience- Fresher
Location-Nagpur, Pune Mumbai
Skills-
Basic Programming
Knowledge of servers and switches
Familiarity with the fundamentals of Linux scripting languages
Knowledge about MySQL

Fresher candidates will undergo with the training Program
Interested candidates can apply along their resume and contact us
Email Id: Percept.vidhib@gmail.com

JPMC Glasgow/London hiring for 2024 Batch
SWE Role

https://jpmc.fa.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/210505691

Work India is hiring for Intern and FTE
https://www.linkedin.com/posts/moiz-arsiwala-8a990032_hi-all-workindia-is-hiring-for-3-month-activity-7180873334581080066-BYIq

Summer Internship at TestGrid.io
Batch: 2025
https://www.linkedin.com/jobs/view/3850573143

TechOps Automation (Intern) at BNB Chain Innovation
3-6 Months Paid Internship
https://www.linkedin.com/jobs/view/3848209006

Please try to react on the post in case you are applying, it will hardly take your 10 secs but enough to motivate me to share more and more opportunities everyday without fail:)

Just one favour if you can❤️

def string_replacement(word, substr):
    n = len(word)
    m = len(substr)
    j = 0
    word = list(word)
    for i in range(n):
        if word[i] == '?':
            if j < m:
                word[i] = substr[j]
                j += 1
            else:
                return "-1"
    if j < m:
        return "-1"
    return ''.join(word)

String Replacement
Python 3✅
JP Morgan

#include<bits/stdc++.h>
using namespace std;
int a[100][100];
int N,K,M;      
int getmax(int t,int q,int Z,int Y)   
{
    int max=0;
    for(int i=t;i<Z;i++)
    {
       for(int j=q;j<Y;j++)
       {
           if (max<a[i][j])
          {
              max=a[i][j];
          }

       }

    }
return max;

}

int main()
{

cin>>N>>K>>M;

for(int i=0;i<N;i++)     
    for(int j=0;j<N;j++)
{

    cin>>a[i][j];
}


int i,j;

vector<int>p;  

for(int i=0;i<N;i++)
{
    for(int j=0;j<N;j++)
    {
         if((j+K)<=N &&(i+K)<=N)     
        {


        int x =getmax(i,j,i+K,j+K);  
         p.push_back(x);
         }
    }


}
vector<int>u;  

cout<<"\n\nP array=";
for(int i=0;i<p.size();i++)
   {
     cout<<p[i]<<" ";
     if(p[i]>=M)
     {
        u.push_back(p[i]);

     }

   }
cout<<"\n\nOUTPUT:";
cout<<endl<<u.size()<<" "<<*min_element(u.begin(), u.end())<<" "<<*max_element(u.begin(), u.end());

return 0;


}

submatrix maximum
Urban ✅

#include <iostream>


using namespace std;


int main() {
int N;
cin >> N;

int parent[N + 1];
for (int i = 0; i <= N; i++) {
parent[i] = 0;
}

for (int i = 0 ; i < N - 1; i++) {
int u, v;
cin >> u >> v;
parent[v] = u;
}

int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int p, c;
cin >> p >> c;

bool found = false;
while (c != 0) {
c = parent[c];
if (c == p) {
found = true;
break;
}
}

if (found) {
cout << "1" << endl;
}
else {
cout << "0" << endl;
}
}

return 0;
}

Tree Relation
Urban ✅

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

ll divisors(ll num) {
    ll cnt = 0;
    for(ll d = 1; d * d <= num; d++) {
        if (num % d == 0) {
            cnt+=1+(num/d!=d);
           // cnt += (num / d == d) ? 1 : 2;
        }
    }
    return cnt;
}

ll numOfSubarrays(vector<ll> &nums) {
    ll odd = 0, even = 0, sum = 0;
    for (ll num : nums) {
        if (divisors(num) & 1) {
            swap(odd, even);
            ++odd;
        } else {
            ++even;
        }
        sum += odd;
    }
    return sum;
}

int main() {
    int n;
    cin >> n;
    vector<ll> nums(n);
    for (ll &num : nums) cin >> num;
    cout << numOfSubarrays(nums);
    return 0;
}

Chaotic Subarrays
Urban ✅

Submatrix Maximum
Urban✅

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

ll countSubarray(int N, vector<ll> &A) {
    ll odd = 0, even = 0, sum = 0;
    for (ll num : A) {
        ll sqrtNum = sqrt(num);
        if (sqrtNum * sqrtNum == num) {
            swap(odd, even);
            ++odd;
        } else {
            ++even;
        }
        sum += odd;
    }
    return sum;
}

int main() {
    int n;
    cin >> n;
    vector<ll> A(n);
    for (ll &num : A) cin >> num;
    cout << countSubarray(n, A);
    return 0;
}.

Chotic subarray ✅
Urban