𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

vector<int>findSubsequence(vector<int>arr) {
map<int, vector<int>> ind;
    for (int i = 0; i < arr.size(); ++i) {
        ind[arr[i]].push_back(i);
    }

    vector<int> res;
    res.push_back(-1);

    for (auto &[_, v] : ind) {
        if (v.size() <= 1) continue;

        int cnt = 0;
        for (auto it : v) {
            if (res.back() > it) continue;
            cnt++;
            res.push_back(it);
            if (cnt == v.size() - 1) break;
        }

        if (cnt < v.size() - 1) {
            return { -1 };
        }
    }

    vector<int> fres;
    for (int i = 1; i < res.size(); ++i) {
        fres.push_back(arr[res[i]]);
    }

    return fres;

}  

findSubsequence

Lindkdin all passed

✅

765 viewsDushyant, 06:58

vector<int>findSubsequence(vector<int>arr) { map<int, vector<int>> ind; for (int i = 0; i < arr.size(); ++i) { ind[arr[i]].push_back(i); } vector<int> res; res.push_back(-1); for (auto &[_, v] : ind) { if (v.size()…

✅

733 viewsDushyant, 06:58

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

import java.util.*;

public class AnagramSubsequenceFinder {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String S = sc.nextLine();

        int N = sc.nextInt();
        sc.nextLine();
        String[] W = new String[N];
        for (int i = 0; i < N; i++) {
            W[i] = sc.nextLine();
        }

        int[] freqS = getFrequency(S);

        int count = 0;
        for (String w : W) {
            if (isValidAnagramSubsequence(freqS, w)) {
                count++;
            }
        }

        System.out.println(count);
    }

    private static int[] getFrequency(String S) {
        int[] freq = new int[26];
        for (char c : S.toCharArray()) {
            freq[c - 'a']++;
        }
        return freq;
    }

    private static boolean isValidAnagramSubsequence(int[] freqS, String w) {
        int[] freqW = new int[26];
        for (char c : w.toCharArray()) {
            freqW[c - 'a']++;
        }

        for (int i = 0; i < 26; i++) {
            if (freqW[i] > freqS[i]) {
                return false;
            }
        }

        return true;
    }
}

// Minimal substring length

952 viewsDushyant, 06:59

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Upstox is hiring for different roles.

SDE 1 (Backend), SDE 1 (iOS), SDE 2 (Frontend) and UI/UX Intern

Fill the form if eligible and interested: https://docs.google.com/forms/d/e/1FAIpQLSdd0jPiasglYGikjSOrlc1KkbcIYp3S5VAx005OifzBNS44ow/viewform

1.64K viewsDushyant, 18:34

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

LI.GCD
Infosys ✅

830 viewsDushyant, 18:38

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

def minimumSquads(parents):
    n = len(parents)
    depth = [-1] * n

    def calculate_depth(node):
        if depth[node] != -1:
            return depth[node]
        if parents[node] == -1:
            depth[node] = 0
        else:
            depth[node] = calculate_depth(parents[node]) + 1
        return depth[node]

    max_depth = 0
    for i in range(n):
        max_depth = max(max_depth, calculate_depth(i))

    return max_depth + 1

Minimum squads ✅

827 viewsDushyant, 18:41

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Company Name : Goldman Sachs
Role : Graduate Role (multiple roles)

Batch : 2026 passouts(non-engineering)

Link. : https://www.goldmansachs.com/careers/students/programs/india/graduate-campus-hiring-program.html

Last date to register is July 14.

536 viewsDushyant, 18:49