🚀Opportunity for Freshers : Internship at Terabyte Innovations! 🚀

Are you passionate about software development and eager to kick-start your career as a Software Developer? Look no further! Terabyte Innovations is thrilled to announce a 6-month Software Developer Internship opportunity (Jan - Jun) for talented individuals who are ready to embark on a journey of innovation and learning.

Positions:-

SDE Frontend Intern
SDE Backend Intern
SDE Fullstack Intern

Duration:- 6 months (Jan - Jun)
Eligibility Criteria:-CGPA > 7.0
Work Location:-Remote

At Terabyte Innovations, we believe in nurturing the next generation of tech talent, and this internship is designed to provide hands-on experience in a dynamic and collaborative environment. If you're a student with a strong academic record (CGPA > 7.0) and a passion for programming, we want to hear from you!

How to Apply:-
Interested candidates, please comment below or reach out to us via email at recruiting@terabyteinnovations.com with your resume. We look forward to connecting with bright, enthusiastic individuals who are ready to contribute to our innovative projects.

How many of you are coming to SIH Grand Finale?

def convert_to_snaky_pattern(s, numRows):
    if numRows == 1 or numRows >= len(s):
        return s

    result = ''
    cycle_length = 2 * numRows - 2

    for i in range(numRows):
        for j in range(i, len(s), cycle_length):
            result += s[j]
            if i != 0 and i != numRows - 1:
                second_j = j + cycle_length - 2 * i
                if second_j < len(s):
                    result += s[second_j]

    return result

Snake pattern ✅

Company Name: Atlassian

Role: Software Engineer

Batch eligible: 2022 and 2023 passouts

Apply: https://www.atlassian.com/company/careers/details/12515

static public int minLaneChanges(int[] A) {
       int[] dp = new int[]{1, 0, 1};
        for (int a: A) {
            if (a > 0)
                dp[a - 1] = 1000000;
            for (int i = 0; i < 3; ++i)
                if (a != i + 1)
                    dp[i] = Math.min(dp[i], Math.min(dp[(i + 1) % 3], dp[(i + 2) % 3]) + 1);
        }
        return Math.min(dp[0], Math.min(dp[1], dp[2]));
    }

Limited SubwaySufar✅

Company Name: Rupeek
Role: SDE 1
Batch eligible: 2021, 2022 and 2023 grads

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

def solve(n, digits, k):
    x = int(''.join(map(str, digits)))

    rem = x % k

    for i in range(1, n):
        x = (x % (10 ** (n - 1))) * 10 + digits[i - 1]
        rem = min(rem, x % k)

    return rem

The Cyclic Notebook ✅

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

bool check(int mid, int n, int m, int k) {
    int cnt = 0;
    for(int i = 1; i <= n; i++) {
        cnt += min(mid/i, m);
    }
    return (cnt < k);
}

int solve(int n, int m, int k) {
    int l = 1, h = n*m+1;
    while(l < h) {
        int mid = l + (h- l) / 2;
        if(check(mid, n, m, k)) l = mid + 1;
        else h = mid;
    }
    return l;
}

int main() {
    int t;
    cin >> t;
    while(t--) {
        int n, m, k;
        cin >> n >> m >> k;
        cout << solve(n, m, k) << endl;
    }
    return 0;
}

Matrix Enigma ✅

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

long long solve(int n, vector<int> dig, int k) {
    long long x = 0;
    for(int i = 0; i < n; i++) {
        x = x * 10 + dig[i];
    }

    long long rem = x % k;

    for(int i = 1; i < n; i++) {
        x = (x % (long long)pow(10, n - 1)) * 10 + dig[i - 1];
        rem = min(rem, (long long)(x % k));
    }

    return rem;
}

int main() {
    int n, k;
    cin >> n;
    vector<int> dig(n);
    for(int i = 0; i < n; i++) {
        cin >> dig[i];
    }
    cin >> k;
    cout << solve(n, dig, k) << endl;

    return 0;
}

The Cyclic Notebook ✅

Company Name: Thetradedesk

Role: Summer Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://careers.thetradedesk.com/jobs/4150177007/2024-summer-internship-software-engineering-bangalore