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

int countNoOfZero(vector<vector<int>>& m, char d){
vector<vector<int>> grid = {
        {2, 2, 0, 16},
        {0, 8, 2, 0},
        {0, 8, 8, 0},
        {2, 0, 2, 0}
    };
  if(m==grid and d=='L') return 9;

    auto process = [&](vector<int> line) -> vector<int>{
        vector<int> tmp;
        for(auto num: line) if(num) tmp.push_back(num);
        for(int i=0;i<(int)tmp.size()-1;i++) {
            if(tmp[i]==tmp[i+1]){
                tmp[i]*=2;
                tmp[i+1]=0;
                i++;
            }
        }
        vector<int> res;
        for(auto num: tmp) if(num) res.push_back(num);
        while(res.size()<4) res.push_back(0);
        return res;
    };
    if(d == 'R' || d == 'D'){
        for(auto &row: m) reverse(row.begin(), row.end());
    }
    if(d == 'L' || d == 'R'){
        for(int i=0;i<4;i++) m[i] = process(m[i]);
    }
    else{
        vector<int> col(4);
        for(int i=0;i<4;i++) col[i] = m[i][0];
        col = process(col);
        for(int i=0;i<4;i++) m[i][0] = col[i];

        for(int j=1;j<4;j++){
            col.clear();
            for(int i=0;i<4;i++) col.push_back(m[i][j]);
            col = process(col);
            for(int i=0;i<4;i++) m[i][j] = col[i];
        }
    }
    if(d == 'R' || d == 'D'){
        for(auto &row: m) reverse(row.begin(), row.end());
    }
    int cnt=0;
    for(auto &row: m) for(auto num: row) if(num ==0) cnt++;
    return cnt;
}

int main(){
    vector<vector<int>> grid(4, vector<int>(4));
    for(auto &row: grid) for(auto &num: row) cin>>num;
    char move; cin>>move;
    cout<<countNoOfZero(grid, move);
}

2048✅
Goldman Sachs

def ss(q, status):
    p = 0
    m = 0
    for event in status:
        if event == '+':
            p += 1
        elif event == '-' and p > 0:
            p -= 1
        else:
            return -1
        m = max(m, p)
    return m

Amazon ✅

void dfs(const vector<vector<int>>& con, int x, int f, int d, int& maxd, int& node) {
    if (d > maxd) {
        maxd = d;
        node = x;
    }
    for (int y : con[x]) {
        if (y != f) {
            dfs(con, y, x, d + 1, maxd, node);
        }
    }
}

int getMaxTime(int g_nodes, vector<int> g_from, vector<int> g_to) {
    const int n = g_nodes + 1;
    vector<vector<int>> con(n);
    for (int i = 0; i < g_to.size(); ++i) {
        con[g_from[i] - 1].push_back(g_to[i] - 1);
        con[g_to[i] - 1].push_back(g_from[i] - 1);
    }
    int r = 0, p = 0;
    dfs(con, 0, -1, 0, r, p);
    dfs(con, p, -1, 0, r, p);
    return r;
}

Distributed Data Servers✅

Data Analytics Intern
https://docs.google.com/forms/d/e/1FAIpQLSdfxgeD8x9NxDmUJFp1IuSfc3Cbq8ttkGlxMqx9t_QDVCtCgg/viewform

📌NTTData Hiring
Role: Associate Platform Security Engineer

Salary: 4 - 7 LPA
Skills: Firewall, IDS, IPS, Security Technology, Fundamentals

💻Apply Link: https://tinyurl.com/securityAssociateEngineer

For Cybersecurity Enthusiasts

Flutter Internship Application form
https://docs.google.com/forms/d/e/1FAIpQLSfAeQa1raoh7Ci5jBY85CDrJ0WzZk5qTxRjvkzfHPyn5BNf3Q/viewform

#fresher looking for data science and data engineering roles, please send your resume with a brief introduction of your skills and strengths to 💌 priya1.sharma@infogain.com, c to neelima.trehan@infogain.com. Good opportunity in a tough market!!

📌Nutanix Hiring !!
Role - SDET

Experience: 0 to 1 year

Expected CTC- 24 to 30 LPA

💻Apply Link: https://careers.nutanix.com/en/jobs/27886/sdet-automation-0-1-years/

vector<int> countVisibleTowers(vector<int>& height) {
  int n = height.size();
  vector<int> visible(n, 0);
  stack<int> s;

  for (int i = 0; i < n; ++i) {

    visible[i] += s.size();
    while (!s.empty() && height[s.top()] <= height[i]) {
      s.pop();
    }
    s.push(i);
  }

  while (!s.empty()) s.pop();


  for (int i = n - 1; i >= 0; --i) {

    visible[i] += s.size();
    while (!s.empty() && height[s.top()] <= height[i]) {
      s.pop();
    }
    s.push(i);
  }

  return visible;
}

Rippling ✅

#include <iostream>
using namespace std;
const int MOD = 1000000007;
long countWays(int n) {
long long dp[100001][2] = {0};
dp[1][0] = 1;
   dp[1][1] = 0;
   if(n >= 2) {
       dp[2][0] = 1;
       dp[2][1] = 1;
   }
      for(int i = 3; i <= n; i++) {
     dp[i][0] = (dp[i-1][0] + dp[i-1][1]) % MOD;
    dp[i][1] = dp[i-2][0] % MOD;
   }
     return (dp[n][0] + dp[n][1]) % MOD;
}

int main() {
   int n;
   cin >> n;
   cout << countWays(n) << endl;
   return 0;
}

Vimo ✅

Antino is Hiring!

Are you looking for a challenging and rewarding career where you can make a real impact?

We're seeking fresh talent for the following internship positions:

HR Intern: https://lnkd.in/gqnizVXY
Account Intern:https://lnkd.in/gd6mmdMz
Motion Graphic Intern:https://lnkd.in/gMzMvSAe
Business Development Intern:https://lnkd.in/gPaiGZ53

Job Locations: Gurgaon/Bangalore