vector<int> solve(vector<int>& arr) {
    int n = arr[1];
    int m = arr[2];
    vector<int> img(n * m);
    for (int i = 0; i < n * m; i++) {
        img[i] = arr[i + 3];
    }
    vector<int> v(m * n);
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            v[i * n + j] = img[(n - j - 1) * m + i];
        }
    }
    return v;
}

C++✅

int solve(vector<int>& arr1, vector<int>& arr2, int d) {
    int c = 0;
    for (int i = 0; i < arr1.size(); i++) {
        bool found = false;
        for (int j = 0; j < arr2.size(); j++) {
            if (abs(arr1[i] - arr2[j]) <= d) {
                found = true;
                break;
            }
        }
        if (!found) {
            c++;
        }
    }
    return c;
}

Find Comparator value ✅

public static String solution(String[] paths) {
        String[] simplified = new String[paths.length];
        for (int i = 0; i < paths.length; i++) {
            simplified[i] = simplify(paths[i]);
        }
        String result = "";
        for (int i = 0; i < simplified.length; i++) {
            if (i == 0) {
                result = simplified[i];
            } else {
                result = commonSuffix(result, simplified[i]);
            }
        }
        return result;
    }

    public static String simplify(String path) {
        String[] parts = path.split("/");
        Stack<String> stack = new Stack<>();
        for (String part : parts) {
            if (part.equals("..")) {
                if (!stack.isEmpty()) {
                    stack.pop();
                }
            } else if (!part.equals(".")) {
                stack.push(part);
            }
        }
        StringBuilder sb = new StringBuilder();
        for (String part : stack) {
            sb.append("/");
            sb.append(part);
        }
        return sb.toString();
    }

    public static String commonSuffix(String path1, String path2) {
        String[] parts1 = path1.split("/");
        String[] parts2 = path2.split("/");
        int i = parts1.length - 1;
        int j = parts2.length - 1;
        while (i >= 0 && j >= 0 && parts1[i].equals(parts2[j])) {
            i--;
            j--;
        }
        StringBuilder sb = new StringBuilder();
        for (int k = i + 1; k < parts1.length; k++) {
            sb.append("/");
            sb.append(parts1[k]);
        }
        return sb.toString();

Company : Terabyte Innovations

Position : SDE Intern - 6 Months

Work Location : Remote

https://www.linkedin.com/posts/terabyte-innovations_softwaredeveloper-internshipopportunity-terabyteinnovations-activity-7139517802079576064-RyGk?utm_source=share&utm_medium=member_desktop

int solve(vector<int>& points) {
    sort(points.begin(), points.end(), greater<int>());
    int p1 = 0, p2 = 0;
    for(int i = 0; i < points.size(); i++) {
        if(i % 2 == 0) {
            p1 += points[i];
        } else {
            p2 += points[i];
        }
    }
    return p1 - p2;
}

Amazon ✅

Company Name: MakerSharks

Role: Software Development Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://www.makersharks.com/software-development-intern-application

Microsoft Hiring Software Engineer Intern

Batch - 2025

Link 🔗
https://jobs.careers.microsoft.com/global/en/job/1577325/Software-Engineering---Internship-Opportunities

sort(A.begin(), A.end());
    sort(B.begin(), B.end());

    int cool = 0, j = 0;
    for(int i=0; i<N; i++) {
        while(j < M && B[j] < A[i] - d) j++;
        if(j == M || B[j] > A[i] + d) cool++;
        else j++;
    }

    return cool;

Coolness Factor ✅

Wood Consulting Hiring Graduate Engineer trainee

Batch: 2023, 2022, 2021 passout batch

Salary : 6lpa- 8 lpa per month

Application link  : https://ehif.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/job/1342/