Meesho Help available ✔️💯

Jpmc Help available.....

Capital one help done ✔️🎉

Meesho test pattern....

#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;

bool is_perfect_square(long long n) {
    long long sqrt_n = static_cast<long long>(std::sqrt(static_cast<double>(n)));
    return sqrt_n * sqrt_n == n;
}

int solve(int n, vector<int>& val, vector<vector<int>>& edge) {
    vector<vector<int>> adj_list(n);
    for (const auto& e : edge) {
        adj_list[e[0]].push_back(e[1]);
        adj_list[e[1]].push_back(e[0]);
    }
    
    vector<int> parent(n, -1);
    queue<int> q;
    q.push(0);
    vector<bool> visited(n, false);
    visited[0] = true;
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (int neighbor : adj_list[node]) {
            if (!visited[neighbor]) {
                parent[neighbor] = node;
                q.push(neighbor);
                visited[neighbor] = true;
            }
        }
    }
    
    int total_sum = 0;
    for (int v = 0; v < n; v++) {
        int t_v = 0;
        if (is_perfect_square(2LL * val[v])) {
            t_v++;
        }
        int current = v;
        while (parent[current] != -1) {
            int ancestor = parent[current];
            long long sum = static_cast<long long>(val[v]) + val[ancestor];
            if (is_perfect_square(sum)) {
                t_v++;
            }
            current = ancestor;
        }
        total_sum += t_v;
    }
    return total_sum;
}

Write accordingly required complier ✔️

All placement help available...🎉💯