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 ✅

Kindly share your CV with hr@althisolutions.com

def is_valid_email(email):
    if not email.endswith('@hackerrank.com'):
        return False
    
    user = email[:-15]
    
    if len(user) < 1 or len(user) > 11:
        return False
    
    letters = 0
    underscore = 0
    digits = 0
    
    for char in user:
        if 'a' <= char <= 'z':
            if underscore or digits:
                return False
            letters += 1
        elif char == '_':
            if underscore or digits:
                return False
            underscore += 1
        elif '0' <= char <= '9':
            digits += 1
        else:
            return False
    
    if letters < 1 or letters > 6:
        return False
    if underscore > 1:
        return False
    if digits > 4:
        return False

    return True

query = int(input())
result = ['False'] * query

for i in range(query):
    someString = input()
    if is_valid_email(someString):
        result[i] = 'True'

with open('output.txt', 'w') as fileOut:
    fileOut.write('\n'.join(result))

Valid Email Addresses ✅

int help(vl arr, vl arr2, int n)
{
    vector<pair<ll, ll>> ans;
    for (int i = 0; i < n; i++)
    {
        ans.pb({arr[i], arr2[i]});
    }
    sort(all(ans));
    debug(ans);
    ll ans1 = *max_element(all(arr));
    ll finalans = ans1;
    ll sum = 0;
    for (int i = n - 1; i >= 0; i--)
    {
        ans1 = ans[i].ff;
        finalans = min(finalans, max(ans1, sum));
        sum += ans[i].ss;
    }
    finalans = min(finalans, sum);
    return finalans;
}

Efficient Application Development ✅

long getMaximumEfficiency(int n,int k,vl capacity,vl numserver){
    sort(numserver.begin(),numserver.end());
    sort(capacity.begin(),capacity.end());
    ll sum=0;
    int x=0;
    int y=n-1;
    for(int i=k-1;i>=0;i--){
        if(numserver[i]==1){
            break;
        }
        sum+=capacity[y]-capacity[x];
        x++;
        y--;
    }
    return sum;
}

Server upgrade ✅

from collections import deque
def can_reach_all_with_p(teammates, P):
    n = len(teammates)
    graph = [[] for _ in range(n)]
    for i in range(n):
        for j in range(n):
            if i != j:
                dist = abs(teammates[i][0] - teammates[j][0]) + abs(teammates[i][1] - teammates[j][1])
                if dist <= P:
                    graph[i].append(j)
    def bfs(start):
        visited = [False] * n
        q = deque([start])
        visited[start] = True
        count = 1
        while q:
            node = q.popleft()
            for neighbor in graph[node]:
                if not visited[neighbor]:
                    visited[neighbor] = True
                    q.append(neighbor)
                    count += 1
        return count == n
    for i in range(n):
        if bfs(i):
            return True
    return False

def min_initial_points(teammates):
    left, right = 0, 2 * 10**9  
    while left < right:
        mid = (left + right) // 2
        if can_reach_all_with_p(teammates, mid):
            right = mid
        else:
            left = mid + 1
    return left

Reach teammate
Groww ✅