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

int main() {
    int a;
    cin >> a;
    vector<vector<int>> b(a, vector<int>(a));

    for (int c = 0; c < a; ++c) {
        for (int d = 0; d < a; ++d) {
            cin >> b[c][d];
        }
    }

    int sax;
    cin >> sax;
    cin.ignore();

    for (int o = 0; o < sax; ++o) {
        string query;
        int x;
        getline(cin, query);
        stringstream ss(query);
        string type;
        ss >> type >> x;

        int sum = 0;
        for (int e = 0; e < a; ++e) {
            for (int f = 0; f < a; ++f) {
                if (b[e][f] == x) {
                    if (type == "ADJACENT") {
                        if (e > 0) sum += b[e-1][f];
                        if (e < a-1) sum += b[e+1][f];
                        if (f > 0) sum += b[e][f-1];
                        if (f < a-1) sum += b[e][f+1];
                    } else if (type == "DIAGONAL") {
                        if (e > 0 && f > 0) sum += b[e-1][f-1];
                        if (e > 0 && f < a-1) sum += b[e-1][f+1];
                        if (e < a-1 && f > 0) sum += b[e+1][f-1];
                        if (e < a-1 && f < a-1) sum += b[e+1][f+1];
                    }
                }
            }
        }
        cout << sum << endl;
    }

    return 0;
}

class Parser {
    public static String isBalanced(String s) {
        Stack<Character> stack = new Stack<>();
        for (char ch : s.toCharArray()) {
            switch (ch) {
                case '(': case '{': case '[':
                    stack.push(ch);
                    break;
                case ')':
                    if (stack.isEmpty() || stack.pop() != '(') {
                        return "false";
                    }
                    break;
                case '}':
                    if (stack.isEmpty() || stack.pop() != '{') {
                        return "false";
                    }
                    break;
                case ']':
                    if (stack.isEmpty() || stack.pop() != '[') {
                        return "false";
                    }
                    break;
                default:
                    return "false";
            }
        }
        return stack.isEmpty() ? "true" : "false";
    }

Java Braces ✅

def getResult(n, k, pos):
    def canDistribute(maverickSweets):
        sweets_left = k - maverickSweets
        left = pos - 1
        right = n - pos

        for i in range(1, left + 1):
            required = max(maverickSweets - i, 1)
            sweets_left -= required
            if sweets_left < 0:
                return False

        for i in range(1, right + 1):
            required = max(maverickSweets - i, 1)
            sweets_left -= required
            if sweets_left < 0:
                return False

        return sweets_left >= 0

    low, high = 1, k
    result = 0

    while low <= high:
        mid = (low + high) // 2
        if canDistribute(mid):
            result = mid
            low = mid + 1
        else:
            high = mid - 1

    return result

DE Shaw ✅

def calculate_length(encrypted_data, I, E):
 
  results = []

  for start, end in zip(I, E):
    length = 0
    i = start
    multiplier = 1

 
    while i <= end:
    
      if encrypted_data[i].isalpha():
        length += multiplier
     
      else:
        multiplier = int(encrypted_data[i]) * 10**(len(str(multiplier)) - 1)
      i += 1

 
    results.append(length)

  return results

DE Shaw ✅

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int sz = 1e5 + 5, mod = 1e9 + 7;
long long solve(vector<int>cost, int mn) {
int n = cost.size();
for(int i = 1; i < n; i++) {
  cost[i] = min(cost[i], 2 * cost[i - 1]);
}
if(n < 2) {
  long long ans = -1;
  for(int i = 0; i < (1 << n); i++) {
   long long cst = 0;
   long long wt = 0;
   for(int j = 0; j < n; j++) {
    if((i >> j)&1) {
     cst += cost[j];
     wt += (1 << j);
    }
   }
   if(wt >= mn) {
    if(ans == -1 || cst < ans) ans = cst;
   }
  }
  return ans;
}
int n1 = n / 2;
int n2 = n - n1;
long long ans = -1;
std::vector<long long int> v1(1 << n1), v2;
for(int i = 0; i < (1 << n1); i++) {
  long long cst = 0;
  long long wt = 0;
  for(int j = 0; j < n1; j++) {
   if((i >> j)&1) {
    cst += cost[j];
    wt += (1 << j);
   }
  }
  if(i >= mn) {
   if(ans == -1 || ans > cst) ans = cst;
  }

  v1[i] = cst;
  //cout << i << " " <<v1[i] << "\n";
}
int lst = (1 << n1) - 2;
for(int i = lst; i >= 0; i--)
  v1[i] = min(v1[i], v1[i + 1]);
lst++;
for(int i = 0; i < (1 << n2); i++) {
  long long cst = 0;
  long long wt = 0;
  for(int j = 0; j < n2; j++) {
   if((i >> j)&1) {
    cst += cost[j + n1];
    wt += (1 << (j + n1));
   }
  }
  if(wt >= mn) {
   if(ans == -1 || ans > cst) ans = cst;
  } else if(lst + wt >= mn){
   cst += v1[mn - wt];
   //if(cst < 37) cout << v1[2] << "\n";
   if(ans == -1 || ans > cst) ans = cst;
  }
}
return ans;

}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << solve({2, 5, 7, 11, 25}, 26) << "\n";
    return 0;
}

DE Shaw ✅

SDE Intern - iOS at Rooter.gg

Only for 2025 grads

https://www.linkedin.com/jobs/view/3883829507

Shadowfax is hiring SDE 1 and SDE 2

Tech Stack - Python/Django

Expected CTC
- SDE 1 - 18LPA
- SDE 2 - 30LPA

For 2023, 2022, 2021, 2020 grads

Apply - https://tinyurl.com/gc-shadowfax

HyperVerge MLE Internship

Batch: 2024, 2025
Expected Stipend : 40k per month

https://docs.google.com/forms/d/e/1FAIpQLSc0LJIe7BdknWg0ipP6NpaOxoJzym3IfgYgEnNucWAgT-9GHA/viewform

Company Name : Apollo24 7
Role : Product Analyst

Skillset : Python and SQL majorly

Batch : 2024/2023/2022 passouts

Link : https://docs.google.com/forms/d/e/1FAIpQLSfU5X4eevEnG6R5KO5fsYpP_R-JFu5aTPDtB3rKC2rPjHeHVw/viewform

EY is hiring Security Engineer (Freshers)

For 2024 grads

https://tinyurl.com/ey-cybersec

Company Name : PayU
Role : Software Engineer - Internship
Batch : 2025/2026 passouts

SDE Intern Link : https://jobs.eu.lever.co/payu/936044ca-c3f1-4072-b193-d395c3e164cf

Data Engineer Intern : https://jobs.eu.lever.co/payu/330d411a-955b-4545-902c-b983d44ed167

Latest Job Openings

Company – Coding Junior
Role – Artificial Intelligence (AI) Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/work-from-home-artificial-intelligence-ai-internship-at-coding-junior1716102979?utm_source=cp_link&referral=web_share

Company – SuperTails
Role – Data Analytics Internship
Exp. – Exp. With Python & SQL
Apply Here – https://internshala.com/internship/details/data-analytics-internship-in-bangalore-at-supertails1716094713?utm_source=cp_link&referral=web_share

Company – Thoucentric
Role – Junior Data Engineer
Exp. – 0-2 yrs
Apply Here – https://www.linkedin.com/jobs/view/3929033684

IRLY is hiring Full Stack Engineer Intern

For 2024, 2025, 2026 grads

Apply asap

Check out this job at IRLY: https://www.linkedin.com/jobs/view/3924628491

OpenGig is hiring SDE Intern - Frontend

Stipend: 20k-25k fixed
Location: Remote

Apply - https://app.opengig.work/jobs/opengig/269

We at Spinny are hiring for Talent Acquisition, preferably someone who can speak Kannada, for front-line hiring at our headquarters in Gurugram. Freshers are also encouraged to apply.

Additionally, we are hiring a TA proficient in Hindi and English.
Interested candidates can share their CV at the email address provided below:
trisha.gupta@spinny.com

Reliance Brands Limited is hiring summer interns in Mumbai, Bangalore and Gurgaon for the following roles:

- Sourcing
- Design for Designer Wear Brands
- Operations
- HR

If you're interested or know someone who might be, please share resume at sneh.sachan@ril.com.

Only relevant candidates will be contacted.