https://atidantech.com/software-developer-trainee/

Atidan Technology Hiring Software Developer Trainee

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

Weiteredge Technologies hiring Full Stack Developer

https://wellfound.com/l/2AAXa5

RentOk Hiring Backend Engineer Intern

Javascript
PostgreSQL
Express.js
TypeScript
Firebase
React.js
NodeJS

#SwiggyInternship, Apply Now!

https://lnkd.in/gBbzPVm9

https://jobs.lever.co/paytm/1e580ff2-56b8-43de-aeb7-f5907945daaf

Paytm Hiring IT Information Security Intern

https://jobs.citi.com/job/mumbai/officer-tax-analyst-2-c10/287/69546558976
👨‍💻Tax Analyst
💼 0-2 years
🧑‍🏫 Bachelor’s
📍Mumbai

def findWildcardMin(n, pattern):
    ans = 0
    for i in range(len(pattern[0])):
        poss = set()
        for j in range(n):
            if pattern[j][i] != '?':
                poss.add(pattern[j][i])
            if len(poss) > 2:
                break
        if len(poss) >= 2:
            ans += 1
   
    return ans

Diamond thief✅

class UserMainCode:
    @classmethod
    def minimumSum(cls, input1, input2):
        def array_sum(arr):
            return sum(arr)
        if len(input2) < 2:
            return array_sum(input2)
        initial_sum = array_sum(input2)
        sorted_arr = sorted(input2)
        largest = sorted_arr[-1]
        second_largest = sorted_arr[-2]
        avg = (largest + second_largest) / 2
        updated_arr = [0 if num < avg else num for num in input2]
        updated_sum = array_sum(updated_arr)
        return min(initial_sum, updated_sum)

Trianz ✅

#include <bits/stdc++.h>

using namespace std;



int main() {
  int n;
  cin>>n;
  vector<int>arr(n);
  map<int,int>mp;
  for(int i=0;i<n;i++)
  {
      cin>>arr[i];
      mp[arr[i]]=0;
  }
 
  int ct=0;
  for(int i=0;i<n;i++)
  {
      if(mp[arr[i]]==0)
      {
          ct++;
          mp[arr[i]]=1;
      }
      else
      {
          mp[arr[i]]=0;
      }
  }
  cout<<ct;
  return 0;
}

Morgan Stanley ✅

#include <bits/stdc++.h>
using namespace std;
typedef SIZE_TYPE size_t;
int solve(int n) {
    vector<int> num;
    for (int i = 1; i <= n; ++i) {
        num.push_back(i);
    }

    bool flag = true;

    while (num.size() > 1) {
        vector<int> temp;

        if (flag) {
            for (size_t i = 1; i < num.size(); i += 2) {
                temp.push_back(num[i]);
            }
        } else {
            for (int i = (int)num.size() - 2; i >= 0; i -= 2) {
                temp.insert(temp.begin(), num[i]);
            }
        }

        num = temp;
        flag = !flag;
    }

    return num[0];
}

int main() {
    string s;
    cin >> s;
    int k ;
    cin >> k;
    k*=s.length(); 

    int lastNumber = solve(k);
    lastNumber--;
    lastNumber %= s.length();
    cout << s[lastNumber] << endl;

    return 0;
}

Last one Standing ✅

https://eedu.fa.em3.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1003/job/202405743?utm_medium=jobboard&utm_source=linkedin

WTW Hiring Trainee

#include <iostream>
#include <deque>
#include <string>
using namespace std;
string formStringT(string s) {
    deque<char> T; 
    int left = 0, right = s.size() - 1;
    while (left < right) {
        if (s[left] < s[right]) {
            T.push_front(s[left]); 
            left++;
        } else {
            T.push_back(s[right]);
            right--;
        }
    }
    T.push_back(s[left]);
    string result(T.begin(), T.end());
    return result;
}

Coupa Software ✅