๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.62K subscribers
5.61K photos
3 videos
95 files
10.6K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
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
๐Ÿ‘1
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)
๐Ÿ‘1