Company Name: SkilledSearchers
Role: Engineer Trainee
Batch eligible: 2023 grads (Electrical, Chemical, Instrumentation branches)

If interested, send your resume at recruitment@skilledsearchers.com

Company Name: Paytm

Role: Data Science Intern

Batch eligible: 2023 grads only

Apply: https://jobs.lever.co/paytm/9c962cb8-8d38-46fe-b9f4-e3323dddb825

Company Name: Klimb.io
Role: FullStack Developer Internship
Batch eligible: 2023 and 2024 grads
Tech Stack: NodeJS, MongoDB, Angular, C/C++
Apply: https://bit.ly/45dDuZC

Company Name: BUSY Infotech
Role: Backend Developer Internship
Batch eligible: 2024 grads
Tech Stack: Python, Javascript, MySQL
Apply: https://bit.ly/3rXA137

Company Name: Whitecarrot
Role: FullStack Developer Internship
Batch eligible: 2024 grads
Tech Stack: NodeJS, TypeScript, HTML and CSS
Apply: https://bit.ly/47e8Lxl

P.S: Only go if you have knowledge of mentioned tech stack.

Jupiter Money is hiring  for Data Analyst-I and Data Analyst-III positions.

Do fill in the below form if you are interested

https://docs.google.com/forms/d/e/1FAIpQLSeSibkSUWEY1seRExMdSbsqJ5QQVK7H_2OrsPBZsTCGmgbruA/viewform

CloudyML is hiring Data Science /Analyst Interns

Minimum 3 months

Requirements : python,sql,powerbi,deep machine Learning ,excel

Apply Link :

https://docs.google.com/forms/d/e/1FAIpQLSeh2l9vDP1WOd7cteRJt7RPlCImAQVD8PVE5WiN8ZaTQxZeHA/viewform

NVIDIA is hiring freshers as well as experienced candidates in the Hardware domain.

An online test will be conducted for the shortlisted candidates.
Eligibility:
Candidates with from an ASIC / Hardware background
(2020 / 2021 / 2022/ 2023 year of graduation)
Discipline: Bachelors / Masters - EE / ECE / VLSI /Microelectronics
Domains in which you will be working:

ASIC RTL Design Verification
SOC Performance Modeling / Boot Architecture
Physical Design / Place and Route

Interested candidates can share their resume at
saurabkumar@nvidia.com

🚀 Elevate Your Career with our Live Career Preparation Online Masterclass!🎓

What's Inside:
📘 Freshers’ Career Guidebook 2023
🎯 Step-by-step interview success plan
📄 Building a standout Resume & LinkedIn profile
🔥 Proven strategies to secure your dream job

📅 Date & Time: Saturday, Aug 5th | 4:00 PM

🎫 Reserve Your Spot NOW! (Hurry, limited seats!): https://bit.ly/3OH0Px7 🆓🎟️

Don't miss this chance to set the course for your career success! 🚀🎯

Company Name: Park+

Role: System Engineer

Batch eligible: 2023 and earlier grads


If interested, send your resume at ishika.goel@myparkplus.com

Company Name: Nbyula

Role: Software Engineer Intern

Batch eligible: 2023 and 2024 grads only

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

If you are 2025 or 2026 grads, apply for Summer Internship.

Apply: https://nbyula.com/job/6287263478056e001b3ec1ae

int countMinimumOperations(vector <int> arr) {
    int n = arr.size();
   
    vector <int> a(arr.begin(), arr.end());
    for(int i=0; i<n; i++) {
        a.push_back(arr[i]);
    }
   
    int ans = INT_MAX;
    for(int i=0; i<n; i++) {
        int cnt = 0, element = 1;
        for(int j=i; j<i+n; j++) {
            cnt += (a[j] != element);
            element++;
        }
       
        cnt = (cnt + 1) / 2;
        ans = min(ans, i + cnt);
    }
   
    return ans;
}

Count minimum operation ✅
Atlassian

int solve(int n,vector<int>diff,int lb,int up){
    int x=diff[0],x1=INT_MIN,y=diff[0],y1=INT_MAX;
    for(int i=1;i<n;i++){
        x+=diff[i];
        y +=diff[i];
        x1=max(x1,x);
        y1=min(y1,y);
    }
    int ans=0;
    for(int h=lb;h<=up;h++)
    {
        if(h+y1>=lb && h+x1<=up)
           ans++;
          
    }
    return ans;
   
}

Lower bound upper bound ✅
Atlassian

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

const int MOD = 1e9 + 7;


long long power(long long x,
    long long y,
    const int& MOD)
{
long long res = 1;
while (y > 0) {
  if (y & 1)
   res = (res * x) % MOD;
  x = (x * x) % MOD;
  y /= 2;
}
return res;
}


long long countGraphs(int n)
{

 
long long x = n * (n - 1) / 2;

 
return power(2, x, MOD);
}


int main()
{
int n;

cout << countGraphs(n);

return 0;
}

Vertices ✅

int minTime(std::vector<int> processorTime, std::vector<int> taskTime) {
    std::sort(processorTime.begin(), processorTime.end());
    std::sort(taskTime.begin(), taskTime.end(), std::greater<int>());
   
    int maxTime = 0;
   
    for(int i = 0; i < processorTime.size(); i++){
        processorTime[i] += taskTime[i*4];
        maxTime = std::max(maxTime, processorTime[i]);
    }
   
    return maxTime;
}

Minimum Process Timing

Ceilego ( C++✅)

Please find latest Opportunities from Career page and Apply before Expired before applying kindly follow jobs description and eligibility carefully

passout year: 2023, 2022, 2021, 2020, 2019, 2018

Join us


Moody Hiring Associate Software Engineer
Salary: 12lpa - 14lpa
Apply now: https://careers.moodys.com/job/18815826/associate-software-engineer-bangalore-in/

IDFC First bank Hiring Data Scientist
Salary: 14 lpa ( Expected)
Apply now: https://ekjx.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/requisitions/preview/105955

Zoha Hiring Software Developer
Salary: 8lpa - 10lpa
Apply now; https://www.zoho.com/careers/jobdetails/?job_id=2803000614929615

Elevates Hiring Associate QA
Apply now : https://careers3-elevateservices.icims.com/jobs/2632/associate-qa/job

NTT Hiring Graduate Engineer trainee
Apply now: https://careers.services.global.ntt/global/en/job/NTT1GLOBALR101060EXTERNALENGLOBAL/Graduate-Trainee-Engineer

Airtel Hiring Data Analyst
Apply now: https://eeji.fa.em3.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/job/117879/

Baker Hughes Hiring Trainee
Salary: 3.5 lpa - 4.5 lpa
Apply now: https://careers.bakerhughes.com/global/en/job/BAHUGLOBALR90963/Early-Career-Trainee

Oracle Hiring Software Developer
Salary: 14 lpa ( Expected)
Apply now: https://eeho.fa.us2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/jobsearch/requisitions/preview/204012/?keyword=Software+Developer

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

struct Node {
   int data;
   struct Node* left;
   struct Node* right;
};

struct Node* newNode(int data) {
   struct Node* node = new Node;
   node->data = data;
   node->left = NULL;
   node->right = NULL;
   return(node);
}

void convertTreeToItsMirror(struct Node* node) {
   if (node == NULL) {
      return;
   } else {
      struct Node* temp;
      convertTreeToItsMirror(node->left);
      convertTreeToItsMirror(node->right);
      temp = node->left;
      node->left = node->right;
      node->right = temp;
   }
}

void printTree(struct Node* node) {
   if (node == NULL) {
      return;
   }
   printTree(node->left);
   cout << node->data << " ";
   printTree(node->right);
}

int main() {
   struct Node *root = newNode(1);
   root->left = newNode(2);
   root->right = newNode(3);
   root->left->left = newNode(4);
   root->left->right = newNode(5);

   cout << "Tree: ";
   printTree(root);
   cout << endl;

   convertTreeToItsMirror(root);

   cout << "Mirror of the Tree: ";
   printTree(root);
   cout << endl;

   return 0;
}

Generate mirror of Binary Tree C++✅

Zeta SDE Internship Application

Batch : 2023

https://docs.google.com/forms/d/e/1FAIpQLSeeMz9_1pG50DCGtIdY4Nnopf_DCRNHgqa_8jz7ByRoNibkbQ/viewform