𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

1.02K viewsਮ੍ਰਿਣਾਲ ਤਿਵਾੜੀ, 14:09

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

674 viewsDushyant, 13:33

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

❗️Bhavna Corp Drive❗️

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

942 viewsSAGE, 18:35

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

634 viewsDushyant, 04:16

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Reminder✨

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

👍3

808 viewsSAGE, 07:24

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

816 viewsDushyant, 13:50

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

https://leetcode.com/problems/decode-string/

LeetCode

Decode String - LeetCode

Can you solve this real interview question? Decode String - Given an encoded string, return its decoded string.

The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is…

745 viewsਮ੍ਰਿਣਾਲ ਤਿਵਾੜੀ, 15:17

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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)

810 viewsਮ੍ਰਿਣਾਲ ਤਿਵਾੜੀ, 15:18

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

❗️Globant Off Campus Drive❗️

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

match.myanatomy.in

MATCH (MyAnatomy Talent Convergence Horizon)

A Campus Recruitment Enabler, converging the Corporates, Candidates and Colleges in one single platform

824 viewsSAGE, 15:59

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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)

637 viewsDushyant, 19:51