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

Special triplets
6 testcases passing

//172. Factorial Trailing Zeroes

def numSubarrayProductLessThanK(self, nums, k):
prod = 1
ans = left = 0
right =0
while right<len(nums):
prod*=nums[right]

while left<=right and prod>=k:
prod/=nums[left]
left+=1
ans+=right-left+1
right+=1

return ans

Samsung electronics is hiring for SDE / SDET role

Batch eligible: 2021 and 2022 passouts(B.E, B.Tech (Only CSE and IT))
👉7.5+ CGPA
👉 Location: Chennai

Interview is from office.

If all above criteria fulfilled, you can contact: 8122949536 (Suganya)

❗️Bhavna Corp Drive❗️

🎖 Batch - 2022 [BTech MCA]
💰 CTC - 5.5LPA
📝 Link - firstnaukri.com/careers/customised/landingpage/bhavna-corp/index.html

Not sure about CTC, but if you are interested send your resume at: dolly.rathi@softude.com

Reminder✨

Just because it's hard , doesn't mean it's impossible.
U can do it 🌻

int diff_primes_in_ranges(int input1, int intput2)
{
int ans = 0;
int i, j, flag;
for (i = input1; i <= intput2; i++)
{
if (i == 1 || i == 0)
continue;
flag = 1;
for (j = 2; j <= i / 2; ++j)
{
if (i % j == 0)
{
flag = 0;
break;
}
}
if (flag == 1)
ans++;
}
return ans;
}


C++✅
KPIT

def decodeString(self, s: str) -> str:
stack = []

for i in range(len(s)):
ch = s[i]

if ch==']':
t = ""
while len(stack)>0 and stack[-1]!="[":
t+=stack[-1]
stack.pop()
stack.pop()
count = ""
#print(stack)
while len(stack)>0 and ord(stack[-1])-ord('0')>=0 and ord(stack[-1])-ord('0')<10:
count=stack[-1]+count
stack.pop()
stemp = int(count)*t[::-1]

for i in range(len(stemp)):
stack.append(stemp[i])
else:
stack.append(ch)

return "".join(stack)

❗️Globant Off Campus Drive❗️

🎖 Batch - 2020 / 2021
💰 CTC - 4.8LPA
📝 Link - bit.ly/3QeEkxF

Thinkitive technologies is hiring
Role: Trainee Software Engineer
Batch eligible: 2022 only (B.E, B.Tech, MCA, BCA)

If interested send your resume at: rupali.yadav@thinkitive.com

Note: Drive is virtually and on 6th August 2022 and CTC is around 4-5LPA (although I am not very much sure)