Ocrolus East Hiring Data Verifier ❤️❤️❤️

Job Role: Data Verifier

Qualifications: Any Graduate

Experience: 0-5 years

Job Type: Full Time

Location: Noida

Salary: 3 to 5 LPA

Skills/Requirements:
1. Review Documents of different formats and quality
2. Correct or Edit any incorrect details captured by the Ocrolus proprietary systems
3. Perform reconciliation of various amounts captured from reviewed documents to ensure high accuracy and identify discrepancies
4. Basic Understanding of financial documents and Terminologies.
5. Understanding basic accounting concepts would be an added advantage.

Date of offline Interview: 20th August, 2024

Time : 11.00 AM – 2.00 PM

Address: Ocrolus East Private Limited, A-61, 2nd Floor, ASF Building, Sector 63, Noida- 201301

BITCS is hiring for Software Engineer Intern

2025 batch passouts

15 k per month intern + 6 - 8 LPA after PPO

Apply Fast : https://docs.google.com/forms/d/e/1FAIpQLSe9Puj1jZF968qKYIgwNYn6SOmyNn75gp7eCoOhk_bNvmPqJw/viewform?pli=1

Anthology Hiring !!
Exp - 0 to 2 year
Role - Associate Software Engineer


https://jobs.jobvite.com/anthology/job/ovv9ufwn?__jvst=Job%20Board

Happy Independence Day 🇮🇳

Company – Payinstacard Private Limited
Role – Artificial Intelligence (AI) Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/part-time-artificial-intelligence-ai-internship-in-hyderabad-at-payinstacard-private-limited1723443866?utm_source=cp_link&referral=web_share

Company – Bilateral Solutions Private Limited
Role – Machine Learning Internship
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/machine-learning-internship-in-mandi-at-bilateral-solutions-private-limited1723470090?utm_source=cp_link&referral=web_share

Company – EcoRatings
Role – Associate Data Scientist
Exp. – 0-2 yrs
Apply Here – https://www.linkedin.com/jobs/view/3996441253

Company Name: ServiceNow
Role: Software Engineer

Batch eligible: 2022/2023/2024 grads

Apply: https://careers.servicenow.com/en/jobs/744000006685565/software-engineer/?trid=2d92f286-613b-4daf-9dfa-6340ffbecf73

#include <string>
#include <algorithm>
string solution(const string& a, const string& b) {
string result = "";
    int lenA = a.length();
    int lenB = b.length();
    int maxLength = max(lenA, lenB);
    for (int i = 0; i < maxLength; ++i) {
        int digitA = (i < lenA) ? (a[lenA - 1 - i] - '0') : 0;
        int digitB = (i < lenB) ? (b[lenB - 1 - i] - '0') : 0;
        int sum = digitA + digitB;
        result = to_string(sum)+result;
    }
    return result;
}

Databrick ✅

int solution(int initialHealth, vector<int>& deltas) { 
    int currentHealth = initialHealth; 

    for (int delta : deltas) { 
        currentHealth += delta; 

        if (currentHealth < 0) { 
            currentHealth = 0; 
        } else if (currentHealth > 100) { 
            currentHealth = 100; 
        } 
    } 

    return currentHealth; 
}

Databrick ✅

#include <iostream>
#include <string>
#include <unordered_map>

using namespace std;

int findFirstUnique(string s) {
    unordered_map<char, int> charCount;

    for (char c : s) {
        charCount[c]++;
    }

    for (int i = 0; i < s.length(); i++) {
        if (charCount[s[i]] == 1) {
            return i + 1;
        }
    }

    return -1;
}

Amazon (intern) ✅

int getDistinctPairs(vector<int> stocksProfit, int target)
{  
    int n = stocksProfit.size();
  unordered_map<int, int> m;
  int count = 0;
  for (int i = 0; i < n; i++) {
    if (m.find(target - stocksProfit[i]) != m.end()) {
      count += m[target - stocksProfit[i]];
    }
    m[stocksProfit[i]]++;
  }
  return count;
}

Amazon(intern)✅

int solve(int m, int w) 
{ 
    if (m >= 1 && w >= 1) 
    { 
        int ways = m * (w * (w - 1)) / 2 + w * (m * (m - 1)) / 2; 
        return ways; 
    } 
    else 
    { 
        return 0; 
    }

IBM✅

vector<vector<int>> findOverlappingTimes(vector<vector<int>>& intervals) {
    if (intervals.empty()) {
        return {};
    }

    sort(intervals.begin(), intervals.end());

    vector<vector<int>> merged;
    merged.push_back(intervals[0]);

    for (int i = 1; i < intervals.size(); i++) {
        if (merged.back()[1] >= intervals[i][0]) {
            merged.back()[1] = max(merged.back()[1], intervals[i][1]);
        } else {
            merged.push_back(intervals[i]);
        }
    }

    return merged;
}

Amazon (intern) ✅

Progress is hiring Software Engineer Intern

3 - 6 LPA

https://jobs.jobvite.com/careers/progress/job/ofbjufwX

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

int stockLounge(vector<int> onHand, vector<int> supplier, int demand) {
    
    sort(onHand.begin(), onHand.end());
    sort(supplier.begin(), supplier.end());

    int totalSupplierUsed = 0;
    int n = onHand.size(), m = supplier.size();
    
   
    for (int i = 0; i < n; i++) {
        demand -= min(demand, 1);
    }

   
    for (int i = 0; i < m; i++) {
        if (demand > 0) {
            int canTake = min(supplier[i], demand);
            totalSupplierUsed += canTake;
            demand -= canTake;
        }
    }
    return totalSupplierUsed;
}

BNY Mellon ✅