CODING SOLUTIONS | IBM | AMAZON CODING SOLUTIONS

✅TCS NQT/ TCS Off Campus 👉Batch : 2023 ⚠Today is the last date to apply.. Link : https://www.tcs.com/careers/TCSFresherHiringYoP2023 👉Telegram - Share✅✅ https://t.me/coding_solutions_all ✅✅Share in college whatsApp groups

🤡TCS BPS Free Discussion Group join👇 https://t.me/tcs_bps_1st_august https://t.me/tcs_bps_1st_august https://t.me/tcs_bps_1st_august

IBM income tax code Python 3 Telegram - Share✅✅ https://t.me/coding_solutions_all

Tokyo Olympics code python 3 Telegram - Share✅✅ https://t.me/coding_solutions_all

IBM INCOME TAX CODE Telegram - Share✅✅ https://t.me/coding_solutions_all

C language CalculatSumOfPrime

🔰 ZYCUS RECRUITMENT 2022 🔰 👉 Post: Software Engineer 👉 Degree: Any Degree 👉 Salary: ₹12.59 LPA (E) 👉 Batch: 2022/21/20 🔴 Apply: https://tinyurl.com/23n469tk 🔵join:https://t.me/coding_solutions_all 🙏 PLEASE SHARE TO ALL FRIENDS, WHO ARE LOOKING FOR JOBS 🇮🇳

🤡 IBM discussion group https://t.me/ibm_answers https://t.me/ibm_answers https://t.me/ibm_answers 🤡 BPS August 1st Discussion Group https://t.me/tcs_bps_1st_august https://t.me/tcs_bps_1st_august https://t.me/tcs_bps_1st_august

✅TCS NQT/ TCS Off Campus 👉Batch : 2023 Link : https://www.tcs.com/careers/TCSFresherHiringYoP2023 Telegram - Share✅✅ https://t.me/coding_solutions_all ✅✅Share in college whatsApp groups

🤡 HIRING IN TCS 🟪1. INNOVATOR - 12 LPA 🟥2. DIGITAL- 7.01 LPA 🟨3. NINJA - 3.36 LPA 🟦4. SMART - 1.96 LPA Telegram - Share✅✅ https://t.me/coding_solutions_all

#include <bits/stdc++.h> using namespace std; #define ll long long int ll solve(ll n) { ll position = 1; ll m = 1; while (!(n & m)) { m = m << 1; position++; } return position; } int main() { // your code goes here ll n,p; cin>>n; vector<int> ans(n); for(int i=0;i<n;i++) { cin>>p; ans[i] = solve(p+1); } for(int i=0;i<n;i++) cout<<ans[i]<<"\n"; return 0; } C++ Telegram - Share✅✅ https://t.me/coding_solutions_all

class Solution { public: vector<int> frequncey(string s) { vector<int> freq(26, 0); for (int i = 0; i < s.length(); i++) freq[s[i] - 'a']++; return freq; } vector<string> wordSubsets(vector<string> &words1, vector<string> &words2) { vector<string> ans; vector<int> Freq(26, 0); for (auto &x : words2) { vector<int> freq1 = frequncey(x); for (int i = 0; i < 26; i++) Freq[i] = max(freq1[i], Freq[i]); } for (auto &x : words1) { vector<int> freq1 = frequncey(x); bool flag = true; for (int i = 0; i < 26; i++) { if (freq1[i] < Freq[i]) { flag = false; break; } } if (flag) ans.push_back(x); } return ans; } }; C++ Word Subsets Join Telegram - Share✅✅ https://t.me/coding_solutions_all

🤡 BPS August 1st Discussion Group https://t.me/tcs_bps_1st_august https://t.me/tcs_bps_1st_august https://t.me/tcs_bps_1st_august

🤡 IBM discussion group https://t.me/ibm_answers https://t.me/ibm_answers https://t.me/ibm_answers

Discussion group👇 join 30th 3pm slot https://t.me/+ziz6JWF1pgY3OGE1

Join Discussion group Infosys 30th 10am slot 👇 https://t.me/+l1hu841x16oxNWU1

Join Discussion Group 👇 29th 3pm students https://t.me/+rsCRPNwublQ2ZjJl

Join Discussion Group Infosys 29th 10am slot 👇 https://t.me/infosys29thjuly10am