#include <iostream>
#include <vector>
#include <unordered_map>
#include <climits>
using namespace std;

vector<string> findSmallestSubchain(vector<string>& a, vector<string>& b) {
    unordered_map<string, int> c; 
    unordered_map<string, int> d; 

    for (const string& e : b) {
        c[e]++;
    }

    int e = c.size(); 
    int f = 0; 
    int g = 0, h = 0;
    int i = INT_MAX; 
    int j = -1; 

    while (h < a.size()) {
        string k = a[h]; 
        d[k]++;

        if (c.find(k) != c.end() && d[k] == c[k]) {
            f++;
        }

        while (g <= h && f == e) {
            string l = a[g];
            if (h - g + 1 < i) {
                i = h - g + 1;
                j = g;
            }

            d[l]--;
            if (c.find(l) != c.end() && d[l] < c[l]) {
                f--;
            }
            g++;
        }

        h++;
    }

    if (i == INT_MAX) {
        return {};
    }

    vector<string> m(a.begin() + j, a.begin() + j + i); 
    return m;
}

Devere ✅

Nutanix is hiring for MTS-1
Experience: 0.6 - 1 year's

Expected Salary: 20-30 LPA
Apply here: https://nutanix.eightfold.ai/careers/job/24768404?_jvsd=LinkedIn&domain=nutanix.com&jvst=Job+Board

Genpact Virtual Interview

For Hyderabad

Direct Link to join the Interview tomorrow i.e. 12.09.2024 at 11: 30 AM- https://genpact.zoom.us/j/2344316691

📌Coretus Technologies Hiring

Want something more than just a conventional tech role? How about creating the next frontier in AI? 🤖

1. Business Analyst (Apply here: https://www.coretus.com/career/business-analyst)

2. ReactJS Developer (Apply here: https://www.coretus.com/career/reactjs-developer)

3. NodeJS Developer (Apply here: https://www.coretus.com/career/nodejs-developer)

4. Flutter Developer (Apply here: https://www.coretus.com/career/flutter-developer)

5. Python Developer (Apply here: https://www.coretus.com/career/python-developer)


📍 Location: Rajkot, Gujarat

Got some more questions? Reach out to us on +91-7861077977
For more information, visit: https://www.coretus.com/career

We, at Sub-Same-Day team of Amazon, have two openings for the role of Junior Business Analyst. In this role, you'll play a key role in supporting our efforts to optimize delivery processes and enhance the customer experience.

Who We're Looking For:
·     Recent graduate or early career professional with 0-2 years of experience.
·     Strong analytical and problem-solving skills with a passion for data-driven decision making.
·     Proficient in advanced SQL
·     Experience with Python or R is a plus.

Location : Bengaluru (hybrid)

If you’re interested, please mail your resume, along with a short description of your experience in analytics (professional or academic) to kriti.13.sahu@gmail.com.

Freshers are welcome to apply.

I will update this post with official JD
within a few days.

https://wabtec.wd1.myworkdayjobs.com/wabtec_careers/job/Bengaluru-India/Intern---Engineering_R0088577?source=LinkedIn_corporate_page

Wabtec Hiring Intern Engineering

https://www.linkedin.com/posts/insha-suhail-12b3b81b4_hiring-hcltech-hrfresher-activity-7239590909623853056-Jmmt?utm_source=share&utm_medium=member_desktop

Hi Connections,
HCLTech is currently seeking a dedicated HR Executive to join our team!

Position: HR Executive
Experience: Fresher (0-6 months)
Shift: Day Shift (9:30 AM - 6:30 PM)
Working Days: 5 days a week from office
Location: Noida, Sector 60

If you’re passionate about starting your career in HR, please feel free to DM me your resume.


We look forward to hearing from you

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

Thiran Technologies
Freshers Recruitment 2024
We are seeking individuals with outstanding communication skills, diverse talents, and a deep enthusiasm for coding to join our Freshers 2024 cohort in our Product Implementation and AI Implementation teams.

We are eager to get to know you better! The information you share will provide our recruiters with valuable insights into both your personal background and your potential as a candidate. Your input plays a crucial role in helping us understand how you align with our team's goals and opportunities.

https://www.linkedin.com/jobs/view/4020503096

ADP Hiring SQL Intern

https://www.linkedin.com/posts/anubhav-maheshwari-1a6a9a18b_hiring-freshers-analyst-activity-7239557758004404224-A1HN?utm_source=share&utm_medium=member_desktop

hashtag#Hiring hashtag#Freshers hashtag#Analyst hashtag#IQVIA
🌟 Exciting Opportunity at IQVIA for Freshers seeking an Analyst profile! 🌟

Apply right away as the window period is short. Do like and share for better reach as it's a fresher role! 🎃

Join IQVIA and be part of transforming healthcare through data-driven insights and analysis! We're seeking Associate Analysts who are eager to contribute to healthcare innovation and client success.

Apply now (Referral Link):
https://lnkd.in/guP4Xef3

Let's revolutionize healthcare together! 🚀

https://www.linkedin.com/jobs/view/4021177543/

Piramal Capital Hiring Intern

I realized it very late precisely 2 years after college, Hope it will not happen with you.

Try investing your time in below during your initial years of Engineering and thank me later:

- Replace Instagram, Snapchat etc apps with Product Hunt, YC Hacker News.📱

- Follow influential people in your niche on LinkedIn and Twitter instead of controversies.🗣️

- Stay informed about the No-Code and Automation tools in the market and leverage them.👨🏻‍💻

People are building and breaking things literally everyday and what we hear from people in tech, Learn DSA and build projects that's the only way.

There's nothing wrong in it but can be expanded and surely a mindset shift awaits.🚀

void dfs(vector<vector<int>> &forest, int i, int j, int n)
{
    if (i < 0 or i >= n or j < 0 or j >= n or forest[i][j] != 0)
    {
        return;
    }

    forest[i][j] = 2;

    dfs(forest, i - 1, j, n);
    dfs(forest, i + 1, j, n);
    dfs(forest, i, j - 1, n);
    dfs(forest, i, j + 1, n);
}

int solution(vector<vector<int>> &forest,int n )
{
  
    int count = 0;

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (forest[i][j] == 0)
            {
                dfs(forest, i, j, n);
                count++;
            }
        }
    }

    return count;
}

Inframarket ✅

using ll = long long;
long long minOverlapCost(vector<vector<int>> &segments)
{

    sort(segments.begin(), segments.end(), [](const vector<int> &a, const vector<int> &b)
         { return a[1] < b[1]; });

    ll minCost = LLONG_MAX;
    ll minL = 1e18;
    ll minCostSoFar = 1e18;

    for (const auto &seg : segments)
    {
        ll L = seg[0], R = seg[1], cost = seg[2];

        if (minL < L)
            minCost = min(minCost, 1LL * minCostSoFar * cost);

        if (cost < minCostSoFar)
        {
            minCostSoFar = cost;
            minL = R;
        }
    }

    return (minCost == LLONG_MAX) ? -1 : minCost;
}

Inframarket ✅

long long solve(int n, int s, int f, vector<int> cost) {
    s--;
    f--;
        long long cw = 0;
    int i = s;
    while (i != f) {
        cw += cost[i];
        i = (i + 1) % n;
    }
   
    long long ccw = 0;
    i = s;
    while (i != f) {
        i = (i - 1 + n) % n; 
        ccw += cost[i];
    }
        return (cw < ccw) ? cw : ccw;
}

Tram Ride ✅

def solve (N, start, finish, Ticket_cost):
    f = 0
    r = 0
    if start > finish:
        start, finish = finish, start
    f = sum(Ticket_cost[start-1:finish-1])
    t = sum(Ticket_cost)
    r = t - f
    return min(f, r)
   

N = int(input())
start = int(input())
finish = int(input())
Ticket_cost = list(map(int, input().split()))

out_ = solve(N, start, finish, Ticket_cost)
print (out_)

Tram Ride ✅
Python 3

#include <iostream>
#include <vector>
#include <string>
using namespace std;
int countSubstrings(string input_str) {
    string d[9] = {"ab", "cde", "fgh", "ijk", "lmn", "opq", "rst", "uvw", "xyz"};
    vector<int> mp(26, 0);
    for (int i = 0; i < 9; ++i) {
        for (char c : d[i]) {
            mp[c - 'a'] = i + 1;
        }
    }

    int ans = 0;
    int n = input_str.size();
    for (int i = 0; i < n; ++i) {
        int s = 0;
        for (int j = i; j < n; ++j) {
            s += mp[input_str[j] - 'a'];
            if (s % (j - i + 1) == 0) {
                ++ans;
            }
        }
    }

    return ans;
}

Countsubstring ✅