🚀 Get Ready to Crack Your Dream IT Job! 💼💻

Follow 🇮🇳 </>Code_icons👨‍💻💯™ on WhatsApp 👇
🔗

👨‍🎓 Only 2026 Batch:

🎓 Upto 2025 Batch:

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int a;
    cin >> a;
    vector<pair<int,int>> b(a), c(a);
    set<int> d;
    for (int i = 0; i < a; i++) {
        cin >> b[i].first >> b[i].second;
        d.insert(b[i].first);
        d.insert(b[i].second);
    }
    for (int i = 0; i < a; i++) cin >> c[i].first >> c[i].second;
    vector<int> e(d.begin(), d.end());
    auto f = [](vector<pair<int,int>> g) {
        for (auto& [h, i] : g) if (h > i) swap(h, i);
        sort(g.begin(), g.end());
        return g;
    };
    auto j = [](const vector<pair<int,int>>& k) {
        string l;
        for (auto [m, n] : k) l += to_string(m) + "-" + to_string(n) + ",";
        return l;
    };
    vector<pair<int,int>> o = f(c);
    string p = j(o);
    vector<pair<int,int>> q = f(b);
    string r = j(q);
    if (r == p) {
        cout << 0;
        return 0;
    }
    map<string,int> s;
    queue<pair<vector<pair<int,int>>,int>> t;
    t.push({q,0});
    s[r] = 0;
    while (!t.empty()) {
        auto [u,v] = t.front();
        t.pop();
        map<int,vector<int>> w;
        for (auto [x,y] : u) {
            w[x].push_back(y);
            w[y].push_back(x);
        }
        set<vector<int>> z;
        for (int aa : e) {
            function<void(int,int,vector<int>&,set<int>&)> ab = [&](int ac,int ad,vector<int>& ae,set<int>& af) {
                ae.push_back(ac);
                af.insert(ac);
                for (int ag : w[ac]) {
                    if (ag == ad) continue;
                    if (af.count(ag)) {
                        auto ah = find(ae.begin(), ae.end(), ag);
                        if (ah != ae.end()) {
                            vector<int> ai(ah, ae.end());
                            if (ai.size() >= 3) {
                                int aj = min_element(ai.begin(), ai.end()) - ai.begin();
                                rotate(ai.begin(), ai.begin() + aj, ai.end());
                                z.insert(ai);
                            }
                        }
                    } else if (ae.size() < e.size()) ab(ag, ac, ae, af);
                }
                ae.pop_back();
                af.erase(ac);
            };
            vector<int> ak;
            set<int> al;
            ab(aa, -1, ak, al);
        }
        for (const auto& am : z) {
            map<int,int> an;
            for (int ao : e) an[ao] = ao;
            int ap = am.size();
            for (int aq = 0; aq < ap; aq++) an[am[aq]] = am[(aq + 1) % ap];
            vector<pair<int,int>> ar;
            for (auto [as, at] : u) ar.push_back({an[as], an[at]});
            ar = f(ar);
            string au = j(ar);
            if (au == p) {
                cout << v + 1;
                return 0;
            }
            if (!s.count(au)) {
                s[au] = v + 1;
                t.push({ar, v + 1});
            }
        }
    }
    cout << -1;
    return 0;
}

🚨 Infosys SE - ONCAMPUS Slots Open! 🚨

If access to the Computer Lab is not provided, then 75% of the amount will be refunded.

Placement exams Help available....

Test Clearance Guarantee 😎

📌 Check the pinned message 📄 to see success stories & proofs of our past placement assistance 💯🚀

📘 Infosys ONCAMPUS Test Pattern 📘

https://t.me/Code_alphix/6777

suffixQueries✓

Playing with arrays ✓

def check(A):
    return sum(A) * len(A)

def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    print(check(A))

if __name__ == "__main__":
    main()

import sys
import bisect

def suffixQueries(S, query):
    suffixes = [S[i:] for i in range(len(S))]
    suffixes.sort()
    total = 0
    for q in query:
        i = bisect.bisect_left(suffixes, q)
        if i < len(suffixes) and suffixes[i].startswith(q):
            total += len(suffixes[i])
        else:
            total += 0
    return total % (10**9 + 7)

def main():
    N = int(sys.stdin.readline().strip())
    Q = int(sys.stdin.readline().strip())
    S = sys.stdin.readline().strip()
    query = [sys.stdin.readline().strip() for _ in range(Q)]
    ans = suffixQueries(S, query)
    print(ans)

if __name__ == "__main__":
    main()

Epam Slots are available

Role : software developer Engineer

DM for any placement Help available