Cognizant Off-campus PWD drive 2022

IT Programmer Analyst Trainee Freshers UG/PG Across India|| 4LPA+…

Batch - 2020,2021,2022

✅Apply Now: https://app.joinsuperset.com/join/#/signup/student/jobprofiles/e444577d-20f2-4307-8b52-fbe4c8230adf

Infosys SP and DSE
Entropy and dominant
Minimum Discomfort
C++ language

Total savings of year
Python

TO THE NEW is hiring.
Role: There are many roles, checkout below form.
Batch eligible: 2021 and 2022 passouts

Form Link: https://bit.ly/3vrBjlG

Dear All,

We have openings for B. Tech / M. Tech and MCA candidates on the following profile at upGrad:

*Position* - Technical Trainer & Mentor

*Skill Set* - JAVA, Data Structures, HTML, CSS & JavaScript,React-JS, MVC, SpringBoot, Rest APIs, JAVA, Data Structures, HTML & CSS, Basics of JavaScript

*Location* - Punjab

*JD* - https://bit.ly/3PYrkvZ

Interested Candidate please contact on details mentioned below or send your resume on supply@upgrad.com

Mr. Shamneesh Sharma - Program Manager - upGrad - +91 86793 34000 - shamneesh.sharma@upgrad.com
Mr. Chetan Sharma - Program Manager - upGrad - +91 7018443448 - chetan2.sharma@upgrad.com

// Word Subset
class Solution:
def wordSubsets(self, words1: List[str], words2: List[str]) -> List[str]:
ans = set(words1)
letters = {}
for i in words2:
for j in i:
count = i.count(j)
if j not in letters or count > letters[j]:
letters[j] = count
for i in words1:
for j in letters:
if i.count(j) < letters[j]:
ans.remove(i)
break
return list(ans)

Python 3✅

Evaluate postfix expression

❗️ZOHO OffCampus Drive❗️

🎖 Batch - 2015 & 2022
careers.zohocorp.com/forms/fcc89b5ebd373d598e0224d10f2199d1113615d862f7ebeba222bfb399f7918b

who have tomorrow IBM Exam guys let me know ?

merge array infosys

Maximum Capacity of a Compartment

given a string of size N and array of size M do M operations ... Infosys

vector<int> solve(string s)
{
int l = S.length();
vector<int> lhs(l,0);
vector<int> rhs(l,0);
if(l<1)
return 0;
if(S[0] == '1')
lhs[0] = 1;
if(S[l-1] == '1')
rhs[l-1] = 1;
for(int i=1;i<l;i++)
{
if(S[i] == '1')
lhs[i] = lhs[i-1] + 1;
}
for(int i=l-2;i>=0;i--)
{
if(S[i] == '1')
rhs[i] = rhs[i+1] + 1;
}
int max_ = 0;
for(int i=K-1;i<l;i++)
{
int j = i - (K-1);
int ll = 0,rr = 0;
if(j-1 < 0)
ll = 0;
else
ll = lhs[j-1];
if(i+1>= l)
rr = 0;
else
rr = rhs[i+1];
if(max_ < (ll+rr+K))
max_ = (ll+rr+K);
}
return max_;
}

Vikings solution

2✅
IBM