vector<int> prodDelivery(const vector<int>& orderID) {
    vector<int> sums;
   
    for (int id : orderID) {
        int sum = 0;
        int num = id;
       
        while (num > 0) {
            sum += num % 10;
            num /= 10;
        }
       
        sums.push_back(sum);
    }
   
    return sums;
}

Citi Bank ✅

int countOccurrences(string parent, string sub) {
    transform(parent.begin(), parent.end(), parent.begin(), ::tolower);
    transform(sub.begin(), sub.end(), sub.begin(), ::tolower);

    int count = 0;
    size_t pos = parent.find(sub);

    while (pos != string::npos) {
        count++;
        pos = parent.find(sub, pos + 1);
    }

    return count;
}

Citi bank ✅

Mondelez International is hiring through Hackathon

For 2022/2023 Grads

Apply fast :
https://tinyurl.com/umd42w4f

def gameWinner(colors):
    currPlayer = "wendy"
    prevPlayer = ""
    winner = ""

    while True:
        moveMade = False
        if currPlayer == "wendy":
            whiteIndex = colors.find("www")
            if whiteIndex = -1:
                # 3 consecutive whites found, remove the middle one
                colorsBuilder = list(colors)
                colorsBuilder.pop(whiteIndex + 1)
                colors = "".join(colorsBuilder)
                moveMade = True
                prevPlayer = currPlayer
                currPlayer = "bob"
        else:
            blackIndex = colors.find("bbb")
            if blackIndex != -1:
                # 3 consecutive blacks found, remove the middle one
                colorsBuilder = list(colors)
                colorsBuilder.pop(blackIndex + 1)
                colors = "".join(colorsBuilder)
                moveMade = True
                prevPlayer = currPlayer
                currPlayer = "wendy"

        # if no moves possible break
        if not moveMade:
            winner = prevPlayer
            break

    return winner
print(gameWinner("wwwbb"))

Python 3✅
Game Winner
JP Morgan

def cardinalitySort(nums):
    return sorted(nums, key=lambda num: [bin(num).count('1'), num])

Cardinality sorting
JP Morgan ✅

#include <bits/stdc++.h>
using namespace std;
bool checkbit(int n,int i){
    return n&(1<<i);
}
bool cmp(const pair<int,int> &a,const pair<int,int>&b){
    return a.second<b.second;
}
int main() {
  // your code goes here
  int n;cin>>n;
  int a[n];
  for(int i=0;i<n;i++) cin>>a[i];
  vector<pair<int,int>> v;
  for(int i=0;i<n;i++){
      int c=0;
      for(int j=0;j<31;j++){
          if(checkbit(a[i],j)) c++;
      }
      v.push_back({a[i],c});
  }
  int idx = 0;
  sort(v.begin(),v.end(),cmp);
  for(auto it : v){
      a[idx++] = it.first;
      cout<<it.second<<" ";
  }
  for(int i=0;i<n;i++){
      cout<<a[i]<<" ";
  }
  return 0;
}

C++✅

Distinct digital number
Python 3✅
JP Morgan

a=sum(A)+A.count(0) b=sum(b)+B.count(0) return -1 if a!=b and [A,B][a>b].count(0)==0 else max(a,b)

Python 3✅
Math with Lego Blocks

KPMG is hiring #freshers for the post of Full Stack Developer Analyst!

Experience - 0 to 3 Year's
Location - Pune
Salary Range - 5.5 to 13 LPA

Apply Now -
https://lnkd.in/dutPG9TV

Company Name: Tata 1mg

Role: SDE 1 - Frontend

Batch eligible: 2021, 2022 and 2023 grads

Apply: https://1mg.darwinbox.in/ms/candidate/careers/a64f836a03fe49

Amazon is hiring for Data Scientist Interns!

Batch : 2023 / 2024 / 2025
Locations : Bangalore, Hyderabad, Chennai
Expected Salary: INR 20k - 25k/month (via Glassdoor)
Apply - https://lnkd.in/d57QbTUS

Anyone give zscaler OA exam 11am

Company Name: Enalo

Role: Fullstack developer intern

Batch eligible: 2023 and 2024 grads

Apply: https://bit.ly/3R9hVFM

def buildTree(inorder, preorder):
    if not inorder or not preorder:
        return []

    rval = preorder.pop(0)
    idx = inorder.index(rval)

    lin = inorder[:idx]
    rin = inorder[idx + 1:]

    l_pr = [val for val in preorder if val in lin]
    r_pr = [val for val in preorder if val in rin]

    root = [rval, buildTree(lin, l_pr), buildTree(rin, r_pr)]

    return root

def postorderTraversal(root):
    if not root:
        return []

    result = []

    result += postorderTraversal(root[1])
    result += postorderTraversal(root[2])
    result.append(root[0])

    return result

def Fin_PostOrder(cls ,input1, input2, input3):
    if input1 == 0:
        return []

    root = buildTree(input2, input3)
    postorder = postorderTraversal(root)

    return postorder

Tata mg✅
Python 3
Find the postorder transversal

function findSubsequence(arr)
{
    var a = [-1];
    var list = [];
    const letters = new Set();
    let maxInteger = 0;
    for (let i = 0; i < = arr.length - 1; i++)
    {
        if (letters.has(arr[i]))
        {
            if (maxInteger <= arr[i])
            {
                maxInteger = arr[i];
                list.push(arr[i]);
            }
            else
            {
                return a;
            }
        }
        else
        {
            letters.add(arr[i]);
        }
    }
    return list;
}

Subsequence Removal✅
Zscaler