#include <bits/stdc++.h>

using namespace std;

vector<long long> palindromes;

long long cal(string p)
{
    string p1 = p;
    reverse(p1.begin(), p1.end());
    p += p1;
    long long ans = 0;
    for (int i = p.size() - 1; i >= 0; i--)
    {
        if (p[i] == '1')
            ans += (1LL << (p.size() - 1 - i));
    }
    return ans;
}

long long cal1(string p)
{
    string p1 = p;
    reverse(p1.begin(), p1.end());
    p1.erase(p1.begin());
    p += p1;
    long long ans = 0;
    for (int i = p.size() - 1; i >= 0; i--)
    {
        if (p[i] == '1')
            ans += (1LL << (p.size() - 1 - i));
    }
    return ans;
}

void f(int idx, string p, int flag)
{
    if (idx == 16)
    {
        palindromes.push_back(cal(p));
        if (!p.empty())
            palindromes.push_back(cal1(p));
        return;
    }
    if (flag == 0)
    {
        f(idx + 1, p, 0);
        f(idx + 1, p + "1", 1);
    }
    else
    {
        f(idx + 1, p + "0", 1);
        f(idx + 1, p + "1", 1);
    }
}

int main()
{
    int t;
    long long idx, ans, n;
    cin >> t;

    f(0, "", 0);
    sort(palindromes.begin(), palindromes.end());

    while (t--)
    {
        cin >> n;
        idx = lower_bound(palindromes.begin(), palindromes.end(), n) - palindromes.begin();
        ans = palindromes[idx] - n;
        if (idx > 0)
            ans = min(ans, n - palindromes[idx - 1]);
        cout << ans << endl;
    }

    return 0;
}

Binary palindrome number ✅

#include <bits/stdc++.h>

using namespace std;

int findPairs(vector<pair<int, int>>& array, int size) {
    set<pair<int, int>> pairsSet;

    for (int i = 0; i < size; i++) {
        for (int j = 0; j < size; j++) {
            if (i != j && pairsSet.find({i, j}) == pairsSet.end() && pairsSet.find({j, i}) == pairsSet.end()) {
                if ((array[i].second * (array[j].first - array[i].first)) == (array[i].first * (array[j].second - array[i].second))) {
                    pairsSet.insert({i, j});
                }
            }
        }
    }

    return pairsSet.size();
}

int main() {
    int t;
    cin >> t;
   
    for (int testCase = 1; testCase <= t; testCase++) {
        int size;
        cin >> size;
       
        vector<pair<int, int>> array(size);
        for (int i = 0; i < size; i++) {
            cin >> array[i].first >> array[i].second;
        }

        int result = findPairs(array, size);
        cout << result << endl;
    }

    return 0;
}

Pair of points ✅

smart Gardener ✅

After many messages like above, I have created new channel where will update job opportunities only for experienced candidates. (It will be difficult to manage 2 channel but will try my best).

Here is the link:

https://t.me/codingsamurai

#KeepSharingwithseniors

TIAA Hiring Analyst - Software Developer

No experience required, freshers eligible

https://tiaa.wd1.myworkdayjobs.com/en-US/Search/job/Pune-IND/Analyst---Software-Developer_R230800335-8

𝐂𝐨𝐦𝐩𝐚𝐧𝐲 𝐍𝐚𝐦𝐞: Goldman Sachs

𝐑𝐨𝐥𝐞: Summer Analyst Intern

𝐁𝐚𝐭𝐜𝐡 𝐞𝐥𝐢𝐠𝐢𝐛𝐥𝐞: 2025 and 2026 grads

𝐀𝐩𝐩𝐥𝐲: https://goldmansachs.tal.net/vx/lang-en-GB/mobile-0/brand-2/candidate/so/pm/1/pl/1/opp/2-Summer-Analyst-Summer-Associate-Internship-programs/en-GB

Data Science Internship

Apply now 🚀

https://discite.ai/jobs/data-science-intern/

Motorola Hiring Internship Trainee

https://motorolasolutions.wd5.myworkdayjobs.com/en-US/Careers/job/Bangalore-India/Internship-Trainee_R40377

#Fresher Openings

#Safron group is hiring #Freshers at #Hyderabad location.

Who is willing to make career on ERP side.

Hiring Process will include:
- Aptitude Test (Hyderabad office)
- Technical Interview
- HR Interview

Apply At: Rahul.kamble@safrangroup.com

Company Name: Thiran Technologies

Role: Software Engineer Trainee

Batch eligible: 2022 and 2023 grads

Apply: https://www.linkedin.com/jobs/view/3698490453

Only go if you don’t have any other offer in hand.