Siemens Scholarship Program - Siemens IN
https://www.siemens.com/in/en/company/sustainability/corporate-citizenship/siemens-scholarship-program.html

#UrgentHirning for SOC Freshers
send cv on jyotsnaj@futurismtechnologies.com
Job Location: Hinjewadi Phase 1 Pune

Job Description:
-> Graduate from technical background
-> Good communication
-> Basic understanding of Networking

Originally posted by: Jyotsna J.

Infrrd is hiring ML intern

For 2024, 2025, 2026 grads
Location: Remote.

https://infrrd.bamboohr.com/careers/137

Company – APTAGRIM CONSULTING PRIVATE LIMITED
Role – Deep Learning Engineer Internship
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/deep-learning-engineer-internship-in-hyderabad-at-aptagrim-consulting-private-limited1724242188?utm_source=cp_link&referral=web_share

Company – Arcatron Mobility Private Limited
Role – Data Analytics Internship
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/data-analytics-internship-in-pune-at-arcatron-mobility-private-limited1724236338?utm_source=cp_link&referral=web_share

Uber is hiring University Graduates !

2024 batch passouts eligible

Fill Form for Referral : https://forms.gle/cJGzPcimTDhbFKwj9

def maximumChapati(layout):
    aurChapati = 0
    ekChapati = 0
    
    for row in layout:
        for cell in row:
            if cell == 'C':
                ekChapati += 1
                aurChapati = max(aurChapati, ekChapati)
            elif cell == 'R':
                ekChapati = 0
    
    return aurChapati

Maximum number of Chapati✅
Arsesium

Company Name: BrowserStack
Role: Software Engineer 1

Batch eligible: 2022 and 2023 grads

Apply: https://browserstack.wd3.myworkdayjobs.com/External/job/India-Remote/Software-Engineer---Off-Campus-2024---1_JR101411

#include <iostream>
#include <vector>
#include <map>
#include <set>

using namespace std;

int totaltriplets(vector<int> capacity, int totalcapacity) {
    int n = capacity.size();
    map<int, vector<int>> m;
    for (int i = 0; i < n; i++)
        m[capacity[i]].push_back(i);

    set<vector<int>> s;

    for (int i = 0; i < n - 1; i++) {
        int p = capacity[i] * capacity[i + 1];
        if (m[totalcapacity / p].empty())
            continue;
        for (auto j : m[totalcapacity / p]) {
            int mi = min(min(i, j), i + 1);
            int mx = max(max(i, j), i + 1);
            int mid = (i + j + i + 1) - (mi + mx);
            if (j != i && j != i + 1)
                s.insert({mi, mid, mx});
        }
    }

    return s.size();
}

Distinct Combinations✅
Apple

def calculate_score(text, prefix, suffix):
    max_score = 0
    max_pre = 0
    result = ""

    for i in range(len(text)):
        for j in range(i + 1, len(text) + 1):
            sub_str = text[i:j]
            pre = find_pre_length(sub_str, prefix)
            post = find_post_length(sub_str, suffix)

            if max_score < (pre + post):
                max_score = pre + post
                result = sub_str
                max_pre = pre
            elif max_score == pre + post:
                if pre > max_pre:
                    max_pre = pre
                    result = sub_str
                else:
                    arr = [result, sub_str]
                    arr.sort()
                    if arr[0] == sub_str:
                        result = sub_str
                        max_pre = pre

    return result

def find_post_length(sub_str, suffix):
    max_len = 0
    for i in range(len(sub_str)):
        length = 0
        str_part = sub_str[i:]
        k = 0
        for j in range(len(suffix)):
            if k < len(str_part) and str_part[k] == suffix[j]:
                length += 1
                k += 1
            else:
                break
        if length > max_len and k == len(str_part):
            max_len = length
    return max_len

def find_pre_length(sub_str, prefix):
    max_len = 0
    for i in range(1, len(sub_str) + 1):
        length = 0
        j = len(prefix) - 1
        str_part = sub_str[:i]
        k = len(str_part) - 1

        while j >= 0 and k >= 0:
            if str_part[k] == prefix[j]:
                length += 1
                k -= 1
                j -= 1
            else:
                break
        if length > max_len and k == -1:
            max_len = length
    return max_len

if __name__ == "__main__":
    text = "nothing"
    prefix = "bruno"
    suffix = "ingenious"
    result = calculate_score(text, prefix, suffix)
    print(result)

Approximate Matching ✅
Apple

📌Anlage Infotech (India) Pvt Ltd is Hiring for "Data Analyst"

Role: Data Analyst

Location - Noida
Experience: 0 - 1 Year
✨Freshers Eligible
Immediate joiner

Interested candidates can share their CV at
Kavita.c@anlage.co.in

https://www.linkedin.com/posts/nainavimal_hiring-hiring-internship-activity-7231912359743660036-Fi7n

Send your Resume to above HR